{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:39:54Z","timestamp":1742395194828},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744498"},{"type":"electronic","value":"9783540744504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74450-4_13","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T01:49:24Z","timestamp":1189734564000},"page":"140-151","source":"Crossref","is-referenced-by-count":5,"title":["Extending the Hardness of RNA Secondary Structure Comparison"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Blin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Fertin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irena","family":"Rusu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Sinoquet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F. Bernhart","year":"1979","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. Journal of Combinatorial Theory, Series B\u00a027(3), 320\u2013331 (1979)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/PL00009182","volume":"19","author":"T. Biedl","year":"1997","unstructured":"Biedl, T., Kant, G., Kaufmann, M.: On triangulating planar graphs under the four-connectivity constraint. Algorithmica\u00a019, 427\u2013446 (1997)","journal-title":"Algorithmica"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/11880561_24","volume-title":"String Processing and Information Retrieval","author":"G. Blin","year":"2006","unstructured":"Blin, G., Touzet, H.: How to compare arc-annotated sequences: the alignment hierarchy. In: Crestani, F., Ferragina, P., Sanderson, M. (eds.) SPIRE 2006. LNCS, vol.\u00a04209, pp. 291\u2013303. Springer, Heidelberg (2006)"},{"key":"13_CR4","unstructured":"Evans, P.A.: Algorithms and Complexity for Annotated Sequence Analysis. PhD thesis, University of Victoria (1999)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/3-540-48224-5_37","volume-title":"Automata, Languages and Programming","author":"G.H. Lin","year":"2001","unstructured":"Lin, G.H., Chen, Z.Z., Jiang, T., Wen, J.: The longest common subsequence problem for sequences with nested arc annotations. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 444\u2013455. Springer, Heidelberg (2001)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/369133.369214","volume-title":"RECOMB 2001","author":"G.H. Lin","year":"2001","unstructured":"Lin, G.H., Ma, B., Zhang, K.: Edit distance between two RNA structures. In: RECOMB 2001. Proceedings of the 5th International Conference on Computational Biology, pp. 211\u2013220. ACM Press, New York (2001)"},{"key":"13_CR7","volume-title":"Time Warps, String Edits and Macromolecules: the Theory and Practice of Sequence Comparison","author":"D. Sankoff","year":"1983","unstructured":"Sankoff, D., Kruskal, B.: Time Warps, String Edits and Macromolecules: the Theory and Practice of Sequence Comparison. Addison-Wesley, Reading (1983)"}],"container-title":["Lecture Notes in Computer Science","Combinatorics, Algorithms, Probabilistic and Experimental Methodologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74450-4_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:28:00Z","timestamp":1619504880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74450-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744498","9783540744504"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74450-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}