{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:17:28Z","timestamp":1742397448748,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662785"},{"type":"electronic","value":"9783540484523"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48452-3_21","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T01:55:40Z","timestamp":1191722140000},"page":"281-293","source":"Crossref","is-referenced-by-count":20,"title":["Computing Similarity between RNA Structures"],"prefix":"10.1007","author":[{"given":"Kaizhong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,7,8]]},"reference":[{"key":"21_CR1","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Comparing similarity between RNA strings","author":"V. Bafna","year":"1995","unstructured":"V. Bafna, S. Muthukrishnan, and R. Ravi, \u2018Comparing similarity between RNA strings\u2019, Proc. Combinatorial Pattern Matching Conf. 95, LNCS 937, pp.1\u201314, 1995"},{"issue":"4","key":"21_CR2","first-page":"389","volume":"10","author":"F. Corpet","year":"1995","unstructured":"F. Corpet and B. Michot, \u2018RNAlign program: alignment of RNA sequences using both primary and secondary structures\u2019, Comput. Appl. Biosci vol. 10, no. 4, pp. 389\u2013399, 1995","journal-title":"Comput. Appl. Biosci"},{"key":"21_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/3-540-68530-8_8","volume-title":"Computing the edit-distance between unrooted ordered trees","author":"P.N. Klein","year":"1998","unstructured":"P.N. Klein, \u2018Computing the edit-distance between unrooted ordered trees\u2019, Proc. Annual European Symposium on Algorithms 98 LNCS 1461, pp.91\u2013102, 1998."},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/0010-4809(89)90039-6","volume":"22","author":"S.Y. Le","year":"1989","unstructured":"S.Y. Le, R. Nussinov and J.V. Mazel, \u2018Tree graphs of RNA secondary structures and their comparisons\u2019 Comput. Biomed. Res. vol. 22, pp.461\u2013473, 1989","journal-title":"Comput. Biomed. Res."},{"key":"21_CR5","first-page":"205","volume":"5","author":"S.Y. Le","year":"1989","unstructured":"S.Y. Le, J. Owens, R. Nussinov, J.H. chen, B. Shapiro, and J.V. Mazel, \u2018RNA secondary structures: comparisons and determination of frequently recurring sub-structures by consensus\u2019, Comput. Appl. Biosci vol. 5, pp.205\u2013210, 1989","journal-title":"Comput. Appl. Biosci"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S.E. Needleman","year":"1970","unstructured":"S.E. Needleman and C.D. Wunsch, \u2018A general method applicable to the search for similarities in the amino-acid sequences of two proteins\u2019, J. Mol. Bio., 48, pp.443\u2013453, 1970","journal-title":"J. Mol. Bio."},{"issue":"3","key":"21_CR7","first-page":"387","volume":"4","author":"B. Shapiro","year":"1988","unstructured":"B. Shapiro, \u2018An algorithm for comparing multiple RNA secondary structures\u2019, Comput. Appl. Biosci vol. 4, no. 3, pp.387\u2013393, 1988","journal-title":"Comput. Appl. Biosci"},{"issue":"4","key":"21_CR8","first-page":"309","volume":"6","author":"B. Shapiro","year":"1990","unstructured":"B. Shapiro and K. Zhang, \u2018Comparing multiple RNA secondary structures using tree comparisons\u2019, Comput. Appl. Biosci vol. 6, no.4, pp.309\u2013318, 1990","journal-title":"Comput. Appl. Biosci"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T.F. Smith","year":"1981","unstructured":"T.F. Smith and M.S. Waterman, \u2018The identi_cation of common molecular subsequences\u2019, J. Mol. Bio. 147, pp.195\u2013197, 1981","journal-title":"J. Mol. Bio."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1016\/0196-8858(81)90046-4","volume":"2","author":"T.F. Smith","year":"1981","unstructured":"T.F. Smith and M.S. Waterman, \u2018Comparison of biosequences\u2019, Adv. in Appl. Math.2, pp.482\u2013489, 1981","journal-title":"Adv. in Appl. Math"},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K.C. Tai","year":"1979","unstructured":"K.C. Tai, \u2018The tree to tree correction problem\u2019, JACM vol.26, no.3, pp.422\u2013433, 1979","journal-title":"JACM"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Kaizhong Zhang, \u2018Computing similarity between RNA secondary structures\u2019, Proceedings of IEEE International Joint Symposia on Intelligence and Systems, Rockville, Maryland, May 1998, pp. 126\u2013132.","DOI":"10.1109\/IJSIS.1998.685429"},{"issue":"6","key":"21_CR13","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"K. Zhang and D. Shasha, \u2018Simple fast algorithms for the editing distance between trees and related problems\u2019, SIAM J. Computing vol. 18, no. 6, pp.1245\u20131262, 1989","journal-title":"SIAM J. Computing"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1126\/science.2468181","volume":"244","author":"M. Zuker","year":"1989","unstructured":"M. Zuker, \u2018On finding all suboptimal foldings from of an RNA molecule\u2019, Science 244, pp.48\u201352, 1989","journal-title":"Science"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/BF02459506","volume":"46","author":"M. Zuker","year":"1984","unstructured":"M. Zuker and D. Sankoff, \u2018RNA secondary structure and their prediction\u2019, Bull.Math. Biol. 46, pp.591\u2013621, 1984","journal-title":"Bull.Math. Biol."},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1093\/nar\/9.1.133","volume":"9","author":"M. Zuker","year":"1981","unstructured":"M. Zuker and P. Stiegler, \u2018Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information\u2019, Nucleic Acid Res. 9, pp.133\u2013148, 1981","journal-title":"Nucleic Acid Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48452-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T12:33:34Z","timestamp":1737462814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48452-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662785","9783540484523"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-48452-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}