{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:31:46Z","timestamp":1725489106028},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540737308"},{"type":"electronic","value":"9783540737315"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73731-5_10","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T12:04:55Z","timestamp":1187006695000},"page":"101-112","source":"Crossref","is-referenced-by-count":3,"title":["Comparing RNA Structures: Towards an Intermediate Model Between the Edit and the Lapcs Problems"],"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":"Ga\u00ebl","family":"Herry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Vialette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.tcs.2003.10.026","volume":"312","author":"J. Alber","year":"2004","unstructured":"Alber, J., Gramm, J., Guo, J., Niedermeier, R.: Computing the similarity of two sequences with nested arc annotations. Th. Comp. Science\u00a0312(2), 337\u2013358 (2004)","journal-title":"Th. Comp. Science"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Combinatorial Pattern Matching","author":"V. Bafna","year":"1995","unstructured":"Bafna, V., Muthukrishnan, S., Ravi, R.: Computing similarity between RNA strings. In: Galil, Z., Ukkonen, E. (eds.) Combinatorial Pattern Matching. LNCS, vol.\u00a0937, pp. 1\u201316. Springer, Heidelberg (1995)"},{"issue":"3","key":"10_CR3","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":"10_CR4","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":"10_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11567752_1","volume":"2","author":"G. Blin","year":"2005","unstructured":"Blin, G., Fertin, G., Rizzi, R., Vialette, S.: What makes the arc-preserving subsequence problem hard\u00a0? Trans. on Comp. Systems Biology\u00a02, 1\u201336 (2005)","journal-title":"Trans. on Comp. Systems Biology"},{"key":"10_CR6","unstructured":"Blin, G., Fertin, G., Rusu, I., Sinoquet, C.: Extending the hardness of RNA secondary structure comparison. In: (ESCAPE). intErnational Symposium on Combinatorics, Algorithms, Probabilistic and Experimental methodologies. Springer, Heidelberg (to appear 2007)"},{"key":"10_CR7","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)"},{"issue":"5","key":"10_CR8","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(97)00209-3","volume":"65","author":"P. Bose","year":"1998","unstructured":"Bose, P., Buss, J.F., Lubiw, A.: Pattern matching for permutations. Information Processing Letters\u00a065(5), 277\u2013283 (1998)","journal-title":"Information Processing Letters"},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.tcs.2006.09.013","volume":"368","author":"E. Davydov","year":"2006","unstructured":"Davydov, E., Batzoglou, S.: A computational model for RNA multiple structural alignment. Theoretical Computer Science\u00a0368(3), 205\u2013216 (2006)","journal-title":"Theoretical Computer Science"},{"key":"10_CR10","unstructured":"Evans, P.: Algorithms and Complexity for Annotated Sequences Analysis. PhD thesis, University of Victoria (1999)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/11780441_21","volume-title":"Combinatorial Pattern Matching","author":"P.A. Evans","year":"2006","unstructured":"Evans, P.A.: Finding common RNA pseudoknot structures in polynomial time. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 223\u2013232. Springer, Heidelberg (2006)"},{"key":"10_CR12","unstructured":"Goldman, D., Istrail, S., Papadimitriou, C.H.: Algorithmic aspects of protein structure similarity. In: Found. of Comp. Science (FOCS), pp. 512\u2013522 (1999)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/3-540-36206-1_17","volume-title":"FST TCS 2002","author":"J. Gramm","year":"2002","unstructured":"Gramm, J., Guo, J., Niedermeier, R.: Pattern matching for arc-annotated sequences. In: Agrawal, M., Seth, A.K. (eds.) FST TCS 2002. LNCS, vol.\u00a02556, pp. 182\u2013193. Springer, Heidelberg (2002)"},{"key":"10_CR14","unstructured":"Hirschberg, D.S.: The longest common subsequence problem. PhD thesis, Princeton University (1975)"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/3-540-45123-4_15","volume-title":"Combinatorial Pattern Matching","author":"T. Jiang","year":"2000","unstructured":"Jiang, T., Lin, G.-H., Ma, B., Zhang, K.: The longest common subsequence problem for arc-annotated sequences. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 154\u2013165. Springer, Heidelberg (2000)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11780441_20","volume-title":"Combinatorial Pattern Matching","author":"M. Kubica","year":"2006","unstructured":"Kubica, M., Rizzi, R., Vialette, S., Walen, T.: Approximation of RNA multiple structural alignment. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 211\u2013222. Springer, Heidelberg (2006)"},{"key":"10_CR17","first-page":"211","volume-title":"(RECOMB)","author":"G.H. Lin","year":"2001","unstructured":"Lin, G.H., Ma, B., Zhang, K.: Edit distance between two RNA structures. In (RECOMB). Int. Conf. on Computational Biology, pp. 211\u2013220. ACM Press, New York (2001)"},{"key":"10_CR18","unstructured":"Lozano, A., Valiente, G.: String Algorithmics. In: On the maximum common embedded subtree problem for ordered trees, ch. 7, pp. 155\u2013169. King\u2019s College London Publications (2004)"},{"issue":"2-3","key":"10_CR19","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.tcs.2003.08.010","volume":"312","author":"S. Vialette","year":"2004","unstructured":"Vialette, S.: On the computational complexity of 2-interval pattern matching problems. Theoretical Computer Science\u00a0312(2-3), 223\u2013249 (2004)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Advances in Bioinformatics and Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73731-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T01:05:08Z","timestamp":1558487108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73731-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540737308","9783540737315"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73731-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}