{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:15:32Z","timestamp":1740287732489,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_50","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"569-580","source":"Crossref","is-referenced-by-count":4,"title":["Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs"],"prefix":"10.1007","author":[{"given":"Jesper","family":"Jansson","sequence":"first","affiliation":[]},{"given":"Ngo Trung","family":"Hieu","sequence":"additional","affiliation":[]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2\u20133","key":"50_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. Theoretical Computer Science\u00a0312(2\u20133), 337\u2013358 (2004)","journal-title":"Theoretical Computer Science"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Backofen, R., Will, S.: Local sequence-structure motifs in RNA. In: Journal of Bioinformatics and Computational Biology (to appear)","DOI":"10.1142\/S0219720004000818"},{"key":"50_CR3","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.) CPM 1995. LNCS, vol.\u00a0937, pp. 1\u201316. Springer, Heidelberg (1995)"},{"issue":"3","key":"50_CR4","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/s002390010081","volume":"51","author":"L.J. Collins","year":"2000","unstructured":"Collins, L.J., Moulton, V., Penny, D.: Use of RNA secondary structure for studying the evolution of RNase P and RNase MRP. Journal of Molecular Evolution\u00a051(3), 194\u2013204 (2000)","journal-title":"Journal of Molecular Evolution"},{"key":"50_CR5","unstructured":"Evans, P.A.: Algorithms and Complexity for Annotated Sequence Analysis. PhD thesis, University of Victoria, Canada (1999)"},{"key":"50_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-48452-3_20","volume-title":"Combinatorial Pattern Matching","author":"P.A. Evans","year":"1999","unstructured":"Evans, P.A.: Finding common subsequences with arcs and pseudoknots. In: Crochemore, M., Paterson, M. (eds.) CPM 1999. LNCS, vol.\u00a01645, pp. 270\u2013280. Springer, Heidelberg (1999)"},{"key":"50_CR7","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)"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"H\u00f6chsmann, M., T\u00f6ller, T., Giegerich, R., Kurtz, S.: Local similarity in RNA secondary structures. In: Proceedings of the Computational Systems Bioinformatics Conference (CSB2003), pp. 159\u2013168 (2003)","DOI":"10.1109\/CSB.2003.1227315"},{"issue":"1\u20132","key":"50_CR9","first-page":"105","volume":"56","author":"J. Jansson","year":"2003","unstructured":"Jansson, J., Lingas, A.: A fast algorithm for optimal alignment between similar ordered trees. Fundamenta Informaticae\u00a056(1\u20132), 105\u2013120 (2003)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"50_CR10","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S1570-8667(03)00080-7","volume":"2","author":"T. Jiang","year":"2004","unstructured":"Jiang, T., Lin, G., Ma, B., Zhang, K.: The longest common subsequence problem for arc-annotated sequences. Journal of Discrete Algorithms\u00a02(2), 257\u2013270 (2004)","journal-title":"Journal of Discrete Algorithms"},{"issue":"1","key":"50_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(95)80015-8","volume":"143","author":"T. Jiang","year":"1995","unstructured":"Jiang, T., Wang, L., Zhang, K.: Alignment of trees \u2013 an alternative to tree edit. Theoretical Computer Science\u00a0143(1), 137\u2013148 (1995)","journal-title":"Theoretical Computer Science"},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"Lenhof, H.-P., Reinert, K., Vingron, M.: A polyhedral approach to RNA sequence structure alignment. In: Proceedings of the Annual International Conference on Computational Biology (RECOMB\u00a01998), pp. 153\u2013162 (1998)","DOI":"10.1145\/279069.279109"},{"issue":"3","key":"50_CR13","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/S0022-0000(02)00004-1","volume":"65","author":"G. Lin","year":"2002","unstructured":"Lin, G., Chen, Z.-Z., Jiang, T., Wen, J.: The longest common subsequence problem for sequences with nested arc annotations. Journal of Computer and System Sciences\u00a065(3), 465\u2013480 (2002)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"50_CR14","first-page":"309","volume":"6","author":"B.A. Shapiro","year":"1990","unstructured":"Shapiro, B.A., Zhang, K.: Comparing multiple RNA secondary structures using tree comparisons. Computer Applications in the Biosciences\u00a06(4), 309\u2013318 (1990)","journal-title":"Computer Applications in the Biosciences"},{"issue":"3","key":"50_CR15","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K.-C. Tai","year":"1979","unstructured":"Tai, K.-C.: The tree-to-tree correction problem. Journal of the ACM\u00a026(3), 422\u2013433 (1979)","journal-title":"Journal of the ACM"},{"issue":"1\u20134","key":"50_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0020-0255(00)00014-1","volume":"126","author":"J.T.L. Wang","year":"2000","unstructured":"Wang, J.T.L., Zhang, K.: Identifying consensus of trees through alignment. Information Sciences\u00a0126(1\u20134), 165\u2013189 (2000)","journal-title":"Information Sciences"},{"issue":"17","key":"50_CR17","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1093\/bioinformatics\/btg305","volume":"19","author":"L. Wang","year":"2003","unstructured":"Wang, L., Zhao, J.: Parametric alignment of ordered trees. Bioinformatics\u00a019(17), 2237\u20132245 (2003)","journal-title":"Bioinformatics"},{"issue":"4","key":"50_CR18","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1006\/jmbi.1996.0812","volume":"266","author":"R. Wilting","year":"1997","unstructured":"Wilting, R., Schorling, S., Persson, B.C., B\u00f6ck, A.: Selenoprotein synthesis in archaea: Identification of an mRNA element of Methanococcus jannaschii probably directing selenocysteine insertion. Journal of Molecular Biology\u00a0266(4), 637\u2013641 (1997)","journal-title":"Journal of Molecular Biology"},{"issue":"5","key":"50_CR19","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(94)90062-0","volume":"49","author":"K. Zhang","year":"1994","unstructured":"Zhang, K., Jiang, T.: Some MAX\u00a0SNP-hard results concerning unordered labeled trees. Information Processing Letters\u00a049(5), 249\u2013254 (1994)","journal-title":"Information Processing Letters"},{"issue":"6","key":"50_CR20","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.: 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"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:52:24Z","timestamp":1740261144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}