{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:52Z","timestamp":1725490252250},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_60","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:32:38Z","timestamp":1188351158000},"page":"690-703","source":"Crossref","is-referenced-by-count":5,"title":["Alignment between Two RNA Structures"],"prefix":"10.1007","author":[{"given":"Zhuozhi","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaizhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"60_CR1","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proc. Combinatorial Pattern Matching Conf. 95","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"},{"key":"60_CR2","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1093\/nar\/27.1.314","volume":"27","author":"J. W. Brown","year":"1999","unstructured":"J. W. Brown, \u2018The Ribonuclease P Database\u2019, Nucleic Acids Research, 27:314, 1999.","journal-title":"Nucleic Acids Research"},{"issue":"4","key":"60_CR3","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1093\/nar\/28.4.991","volume":"28","author":"J. H. Chen","year":"2000","unstructured":"J. H. Chen, S. Y. Le, and J. V. Maizel, \u2018Prediction of common secondary structures of RNAs: a genetic algorithm approach\u2019, Nucleic Acids Research, 28:4, pp. 991\u2013999, 2000.","journal-title":"Nucleic Acids Research"},{"key":"60_CR4","unstructured":"G. Collins, S. Y. Le, and K. Zhang, \u2018A new method for computing similarity between RNA structures\u2019, Proceedings of the Second International workshop on Biomolecular Informatics, pp. 761\u2013765, Atlantic City, March 2000."},{"key":"60_CR5","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":"60_CR6","unstructured":"P. A. Evans, Algorithms and Complexity for Annotated Sequence Analysis, PhD thesis, University of Victoria, 1999."},{"key":"60_CR7","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/0022-2836(82)90398-9","volume":"162","author":"O. Gotoh","year":"1982","unstructured":"O. Gotoh, \u2018An improved algorithm for matching biological sequences\u2019, J. Mol. Biol., 162, pp. 705\u2013708, 1982.","journal-title":"J. Mol. Biol."},{"key":"60_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/3-540-45123-4_15","volume-title":"Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching (CPM 2000)","author":"T. Jiang","year":"2000","unstructured":"T. Jiang, G.-H. Lin, B. Ma, and K. Zhang, \u2018The longest common subsequence problem for arc-annotated sequences\u2019, Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching (CPM 2000), LNCS 1848, pages 154\u2013165, 2000."},{"key":"60_CR9","doi-asserted-by":"crossref","unstructured":"H. Lenhof, K. Reinert, and M. Vingron. \u2018A polyhedral approach to RNA sequence structure alignment\u2019. Proceedings of the Second Annual International Conference on Computational Molecular Biology (RECOMB\u201998), pages 153\u2013159, 1998.","DOI":"10.1145\/279069.279109"},{"key":"60_CR10","doi-asserted-by":"crossref","unstructured":"G.-H. Lin, B. Ma, and K. Zhang, \u2018Edit distance between two RNA structures\u2019, to appear Proceedings of the Fifth Annual International Conference on Computational Molecular Biology (RECOMB\u20192001), pp. 200\u2013209, 2001.","DOI":"10.1145\/369133.369214"},{"key":"60_CR11","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."},{"key":"60_CR12","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C. H. Papadimitriou","year":"1991","unstructured":"C. H. Papadimitriou and M. Yannakakis, \u2018Optimization, approximation, and complexity classes\u2019, J. Comput. System Sciences, vol. 43, pp. 425\u2013440, 1991.","journal-title":"J. Comput. System Sciences"},{"issue":"23","key":"60_CR13","doi-asserted-by":"publisher","first-page":"5112","DOI":"10.1093\/nar\/22.23.5112","volume":"22","author":"Y. Sakakibara","year":"1994","unstructured":"Y. Sakakibara, M. Brown, R. Hughey, I. S. Mian, K. Sj\u00f6lander, R. Underwood, and D. Haussler, \u2018Stochastic context-free grammar for tRNA modeling\u2019, Nucleic aids research, vol. 22, no. 23, pp. 5112\u20135120, 1994.","journal-title":"Nucleic aids research"},{"issue":"5","key":"60_CR14","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1137\/0145048","volume":"45","author":"D. Sankoff","year":"1985","unstructured":"D. Sankoff, \u2018Simultaneous solution of the RNA folding, alignment and protose-quence problems\u2019, SIAM J. Appl. Math vol. 45, no. 5, pp. 810\u2013824, 1985.","journal-title":"SIAM J. Appl. Math"},{"key":"60_CR15","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."},{"key":"60_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/3-540-48452-3_21","volume-title":"Proceedings of the Tenth Symposium on Combinatorial Pattern Matching","author":"K. Zhang","year":"1999","unstructured":"K. Zhang, L. Wang, and B. Ma, \u2018Computing similarity between RNA structures\u2019, Proceedings of the Tenth Symposium on Combinatorial Pattern Matching. LNCS 1645, pp. 281\u2013293, 1999."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:27:56Z","timestamp":1556818076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_60","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}