{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T04:10:02Z","timestamp":1740197402731,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135088"},{"type":"electronic","value":"9783642135095"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13509-5_1","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T09:19:57Z","timestamp":1277198397000},"page":"1-12","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms for Forest Pattern Matching"],"prefix":"10.1007","author":[{"given":"Kaizhong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunkun","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"1_CR1","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1142\/S0219720004000818","volume":"2","author":"R. Backofen","year":"2004","unstructured":"Backofen, R., Will, S.: Local Sequence-structure Motifs in RNA. Journal of Bioinformatics and Computational Biology\u00a02(4), 681\u2013698 (2004)","journal-title":"Journal of Bioinformatics and Computational Biology"},{"key":"1_CR2","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)"},{"key":"1_CR3","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 IEEE Computational Systems Bioinformatics Conference, pp. 159\u2013168 (2003)","DOI":"10.1109\/CSB.2003.1227315"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/978-3-540-30551-4_50","volume-title":"Algorithms and Computation","author":"J. Jansson","year":"2004","unstructured":"Jansson, J., Hieu, N.T., Sung, W.-K.: Local gapped subforest alignment and its application in finding RNA structural motifs. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 569\u2013580. Springer, Heidelberg (2004)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/11780441_34","volume-title":"Combinatorial Pattern Matching","author":"J. Jansson","year":"2006","unstructured":"Jansson, J., Peng, Z.: Algorithms for Finding a Most Similar Subforest. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 377\u2013388. Springer, Heidelberg (2006)"},{"key":"1_CR6","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 - an alternative to tree edit. Theoretical Computer Science\u00a0143, 137\u2013148 (1995)","journal-title":"Theoretical Computer Science"},{"key":"1_CR7","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":"1_CR8","unstructured":"Motifs database, http:\/\/subviral.med.uottawa.ca\/cgi-bin\/motifs.cgi"},{"issue":"4","key":"1_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","volume":"1","author":"P.H. Sellers","year":"1980","unstructured":"Sellers, P.H.: The theory and computation of evolutionary distances: pattern recognition. Journal of Algorithms\u00a01(4), 359\u2013373 (1980)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"1_CR10","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":"1_CR11","doi-asserted-by":"crossref","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 Association for Computing Machinery (JACM)\u00a026(3), 422\u2013433 (1979)","journal-title":"Journal of the Association for Computing Machinery (JACM)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/11496656_29","volume-title":"Combinatorial Pattern Matching","author":"H. Touzet","year":"2005","unstructured":"Touzet, H.: A linear time edit distance algorithm for similar ordered trees. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 334\u2013345. Springer, Heidelberg (2005)"},{"issue":"1\u20133","key":"1_CR13","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","volume":"64","author":"E. Ukkonen","year":"1985","unstructured":"Ukkonen, E.: Algorithms for approximate string matching. Information and Control\u00a064(1\u20133), 100\u2013118 (1985)","journal-title":"Information and Control"},{"key":"1_CR14","unstructured":"Zhang, K.: Computing similarity between RNA secondary structures. In: Proceedings of IEEE International Joint Symposia on Intelligence and Systems, Rockville, Maryland, May 1998, pp. 126\u2013132 (1998)"},{"issue":"6","key":"1_CR15","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","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13509-5_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T03:57:16Z","timestamp":1740196636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13509-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135088","9783642135095"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13509-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}