{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:48:21Z","timestamp":1773276501808,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540297406","type":"print"},{"value":"9783540322412","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11575832_40","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T14:12:50Z","timestamp":1129212770000},"page":"360-369","source":"Crossref","is-referenced-by-count":1,"title":["Normalized Similarity of RNA Sequences"],"prefix":"10.1007","author":[{"given":"Rolf","family":"Backofen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Hermelin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oren","family":"Weimann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/3-540-45452-7_10","volume-title":"Combinatorial Pattern Matching","author":"J. Alber","year":"2002","unstructured":"Alber, J., Gramm, J., Guo, J., Niedermeier, R.: Towards optimally solving the longest common subsequence problem for sequences with nested arc annotations in linear time. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol.\u00a02373, pp. 99\u2013114. Springer, Heidelberg (2002)"},{"key":"40_CR2","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF01840365","volume":"2","author":"A. Apostolico","year":"1987","unstructured":"Apostolico, A., Guerra, C.: The longest common subsequence problem revisited. Algorithmica\u00a02, 315\u2013336 (1987)","journal-title":"Algorithmica"},{"issue":"4","key":"40_CR3","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1093\/bioinformatics\/17.4.327","volume":"17","author":"A.N. Arslan","year":"2001","unstructured":"Arslan, A.N., E\u01e7ecio\u011flu, \u00d6., Pevzner, P.A.: A new approach to sequence alignment: normalized sequence alignment. Bioinformatics\u00a017(4), 327\u2013337 (2001)","journal-title":"Bioinformatics"},{"key":"40_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P. Bille","year":"2005","unstructured":"Bille, P.: A survey on tree edit distance and related problems. Theoretical Computer Science\u00a0337, 217\u2013239 (2005)","journal-title":"Theoretical Computer Science"},{"key":"40_CR5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0960-9822(99)80144-4","volume":"9","author":"P. Chartrand","year":"1999","unstructured":"Chartrand, P., Meng, X.-H., Singer, R.H., Long, R.M.: Structural elements required for the localization of ASH1 mRNA and of a green fluorescent protein reporter particle in vivo. Current Biology\u00a09, 333\u2013336 (1999)","journal-title":"Current Biology"},{"issue":"5602","key":"40_CR6","doi-asserted-by":"publisher","first-page":"2296","DOI":"10.1126\/science.298.5602.2296","volume":"298","author":"J. Couzin","year":"2002","unstructured":"Couzin, J.: Breakthrough of the year. Small RNAs make big splash. Science\u00a0298(5602), 2296\u20132297 (2002)","journal-title":"Science"},{"key":"40_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-27801-6_25","volume-title":"Combinatorial Pattern Matching","author":"N. Efraty","year":"2004","unstructured":"Efraty, N., Landau, G.M.: Sparse normalized local alignment. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 333\u2013346. Springer, Heidelberg (2004)"},{"key":"40_CR8","unstructured":"Evans, P.A.: Algorithms and complexity for annotated sequence analysis. PhD thesis, University of Alberta (1999)"},{"key":"40_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/3-540-36206-1_17","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","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.) FSTTCS 2002. LNCS, vol.\u00a02556, pp. 182\u2013193. Springer, Heidelberg (2002)"},{"issue":"4","key":"40_CR10","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1145\/322033.322044","volume":"24","author":"D.S. Hirschberg","year":"1977","unstructured":"Hirschberg, D.S.: Algorithms for the longest common subsequence problem. Journal of the ACM\u00a024(4), 664\u2013675 (1977)","journal-title":"Journal of the ACM"},{"issue":"5","key":"40_CR11","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/359581.359603","volume":"20","author":"J.W. Hunt","year":"1977","unstructured":"Hunt, J.W., Szymanski, T.G.: A fast algorithm for computing longest common subsequences. Communications of the ACM\u00a020(5), 350\u2013353 (1977)","journal-title":"Communications of the ACM"},{"key":"40_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"40_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-68530-8_8","volume-title":"Algorithms - ESA \u201998","author":"P.N. Klein","year":"1998","unstructured":"Klein, P.N.: Computing the Edit-Distance between Unrooted Ordered Trees. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 91\u2013102. Springer, Heidelberg (1998)"},{"key":"40_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1146\/annurev.biochem.68.1.287","volume":"68","author":"P.B. Moore","year":"1999","unstructured":"Moore, P.B.: Structural motifs in RNA. Annual review of biochemistry\u00a068, 287\u2013300 (1999)","journal-title":"Annual review of biochemistry"},{"issue":"6","key":"40_CR15","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"D. Shasha","year":"1989","unstructured":"Shasha, D., Zhang, K.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing\u00a018(6), 1245\u20131262 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"40_CR16","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T.F. Smith","year":"1981","unstructured":"Smith, T.F., Waterman, M.S.: The identification of common molecular subsequences. Journal of Molecular Biology\u00a0147, 195\u2013197 (1981)","journal-title":"Journal of Molecular Biology"},{"key":"40_CR17","unstructured":"Zhang, K.: Computing similarity between RNA secondary structures. In: Proc. of the IEEE joint symposium on Intelligence and Systems conference, pp. 126\u2013132 (1998)"},{"issue":"4900","key":"40_CR18","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1126\/science.2468181","volume":"244","author":"M. Zuker","year":"1989","unstructured":"Zuker, M.: On finding all suboptimal foldings of an RNA molecule. Science\u00a0244(4900), 48\u201352 (1989)","journal-title":"Science"},{"issue":"1","key":"40_CR19","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1093\/nar\/9.1.133","volume":"9","author":"M. Zuker","year":"1981","unstructured":"Zuker, M., Stiegler, P.: Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. Nucleic Acids Research\u00a09(1), 133\u2013148 (1981)","journal-title":"Nucleic Acids Research"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11575832_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:42:58Z","timestamp":1619505778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11575832_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}