{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:59:15Z","timestamp":1725890355478},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642312649"},{"type":"electronic","value":"9783642312656"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31265-6_25","type":"book-chapter","created":{"date-parts":[[2012,6,12]],"date-time":"2012-06-12T03:28:23Z","timestamp":1339471703000},"page":"306-320","source":"Crossref","is-referenced-by-count":2,"title":["Local Exact Pattern Matching for Non-fixed RNA Structures"],"prefix":"10.1007","author":[{"given":"Mika","family":"Amit","sequence":"first","affiliation":[]},{"given":"Rolf","family":"Backofen","sequence":"additional","affiliation":[]},{"given":"Steffen","family":"Heyne","sequence":"additional","affiliation":[]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[]},{"given":"Mathias","family":"M\u00f6hl","sequence":"additional","affiliation":[]},{"given":"Christina","family":"Schmiedl","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Will","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1089\/cmb.2007.0062","volume":"14","author":"R. Backofen","year":"2007","unstructured":"Backofen, R., Chen, S., Hermelin, D., Landau, G.M., Roytberg, M.A., Weimann, O., Zhang, K.: Locality and gaps in RNA comparison. Journal of Computational Biology\u00a014, 1074\u20131087 (2007)","journal-title":"Journal of Computational Biology"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-02441-2_21","volume-title":"Combinatorial Pattern Matching","author":"R. Backofen","year":"2009","unstructured":"Backofen, R., Landau, G.M., M\u00f6hl, M., Tsur, D., Weimann, O.: Fast RNA Structure Alignment for Crossing Input Structures. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol.\u00a05577, pp. 236\u2013248. Springer, Heidelberg (2009)"},{"key":"25_CR3","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"},{"issue":"5602","key":"25_CR4","doi-asserted-by":"publisher","first-page":"2296","DOI":"10.1126\/science.298.5602.2296","volume":"298","author":"J. Couzin","year":"2002","unstructured":"Couzin, J.: Small RNAS make big splash. Science\u00a0298(5602), 2296\u20132297 (2002)","journal-title":"Science"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-73420-8_15","volume-title":"Automata, Languages and Programming","author":"E.D. Demaine","year":"2007","unstructured":"Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An Optimal Decomposition Algorithm for Tree Edit Distance. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 146\u2013157. Springer, Heidelberg (2007)"},{"issue":"2-4","key":"25_CR6","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/j.jda.2004.08.018","volume":"3","author":"S. Dulucq","year":"2005","unstructured":"Dulucq, S., Touzet, H.: Decomposition algorithms for the tree edit distance problem. J. Discrete Algorithms\u00a03(2-4), 448\u2013471 (2005)","journal-title":"J. Discrete Algorithms"},{"unstructured":"Evans, P.A.: Algorithms and Complexity for Annotated Sequence Analysis. PhD thesis, University of Alberta (1999)","key":"25_CR7"},{"issue":"4","key":"25_CR8","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/s00224-010-9274-7","volume":"48","author":"J. Jansson","year":"2011","unstructured":"Jansson, J., Peng, Z.: Algorithms for finding a most similar subforest. Theory Comput. Syst\u00a048(4), 865\u2013887 (2011)","journal-title":"Theory Comput. Syst"},{"issue":"2","key":"25_CR9","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. J. Discrete Algorithms\u00a02(2), 257\u2013270 (2004)","journal-title":"J. Discrete Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Jiang, T., Wang, L., Zhang, K.: Alignment of trees \u2013 an alternative to tree edit. TCS: Theoretical Computer Science\u00a0143 (1995)","key":"25_CR10","DOI":"10.1016\/0304-3975(95)80029-9"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"25_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G.M. Landau","year":"1989","unstructured":"Landau, G.M., Vishkin, U.: Fast parallel and serial approximate string matching. Journal of Algorithms\u00a010, 157\u2013169 (1989)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/S0022-0000(02)00004-1","volume":"65","author":"G.H. Lin","year":"2002","unstructured":"Lin, G.H., Chen, Z.Z., Jiang, T., Wen, J.: The longest common subsequence problem for sequences with nested arc annotations. JCSS: Journal of Computer and System Sciences\u00a065(3), 465\u2013480 (2002)","journal-title":"JCSS: Journal of Computer and System Sciences"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-02008-7_22","volume-title":"Research in Computational Molecular Biology","author":"M. M\u00f6hl","year":"2009","unstructured":"M\u00f6hl, M., Will, S., Backofen, R.: Lifting Prediction to Alignment of RNA Pseudoknots. In: Batzoglou, S. (ed.) RECOMB 2009. LNCS, vol.\u00a05541, pp. 285\u2013301. Springer, Heidelberg (2009)"},{"key":"25_CR15","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"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-21458-5_11","volume-title":"Combinatorial Pattern Matching","author":"S. Schirmer","year":"2011","unstructured":"Schirmer, S., Giegerich, R.: Forest Alignment with Affine Gaps and Anchors. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 104\u2013117. Springer, Heidelberg (2011)"},{"issue":"1","key":"25_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1089\/cmb.2006.0089","volume":"14","author":"S. Siebert","year":"2007","unstructured":"Siebert, S., Backofen, R.: A dynamic programming approach for finding common patterns in RNAS. Journal of Computational Biology\u00a014(1), 33\u201344 (2007)","journal-title":"Journal of Computational Biology"},{"issue":"3","key":"25_CR18","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. Journal of Computer and System Sciences\u00a026(3), 362\u2013391 (1983)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"25_CR19","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. JACM: Journal of the ACM\u00a026(3), 422\u2013433 (1979)","journal-title":"JACM: Journal of the ACM"},{"issue":"6","key":"25_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"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/3-540-48452-3_21","volume-title":"Combinatorial Pattern Matching","author":"K. Zhang","year":"1999","unstructured":"Zhang, K., Wang, L., Ma, B.: Computing Similarity between RNA Structures. In: Crochemore, M., Paterson, M. (eds.) CPM 1999. LNCS, vol.\u00a01645, pp. 281\u2013293. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31265-6_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:07:41Z","timestamp":1606187261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31265-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642312649","9783642312656"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31265-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}