{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T17:40:31Z","timestamp":1736444431608,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354550"},{"type":"electronic","value":"9783540354611"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780441_34","type":"book-chapter","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T15:02:51Z","timestamp":1151679771000},"page":"377-388","source":"Crossref","is-referenced-by-count":3,"title":["Algorithms for Finding a Most Similar Subforest"],"prefix":"10.1007","author":[{"given":"Jesper","family":"Jansson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeshan","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"34_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1006\/jagm.2001.1170","volume":"40","author":"W. Chen","year":"2001","unstructured":"Chen, W.: New algorithm for ordered tree-to-tree correction problem. Journal of Algorithms\u00a040(2), 135\u2013158 (2001)","journal-title":"Journal of Algorithms"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Cob\u00e9na, G., Abiteboul, S., Marian, A.: Detecting changes in XML documents. In: Proceedings of the 18th IEEE International Conference on Data Engineering (ICDE\u00a02002), pp. 41\u201352 (2002)","DOI":"10.1109\/ICDE.2002.994696"},{"key":"34_CR3","volume-title":"Text algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text algorithms. Oxford University Press, Oxford (1994)"},{"key":"34_CR4","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 (CSB\u00a02003), pp. 159\u2013168 (2003)","DOI":"10.1109\/CSB.2003.1227315"},{"issue":"1\u20132","key":"34_CR5","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"},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Ngo, T.H., 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":"34_CR7","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"},{"issue":"2","key":"34_CR8","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1137\/S0097539791218202","volume":"24","author":"P. Kilpel\u00e4inen","year":"1995","unstructured":"Kilpel\u00e4inen, P., Mannila, H.: Ordered and unordered tree inclusion. SIAM Journal on Computing\u00a024(2), 340\u2013356 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"34_CR9","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":"34_CR10","unstructured":"Motifs database, http:\/\/subviral.med.uottawa.ca\/cgi-bin\/motifs.cgi"},{"issue":"4","key":"34_CR11","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"},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T.F. Smith","year":"1981","unstructured":"Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. Journal of Molecular Biology\u00a0147, 195\u2013197 (1981)","journal-title":"Journal of Molecular Biology"},{"issue":"3","key":"34_CR13","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"},{"key":"34_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"34_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/3-540-44888-8_26","volume-title":"Combinatorial Pattern Matching","author":"G. Valiente","year":"2003","unstructured":"Valiente, G.: Constrained tree inclusion. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 361\u2013371. Springer, Heidelberg (2003)"},{"issue":"6","key":"34_CR16","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\/11780441_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T17:09:00Z","timestamp":1736442540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780441_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354550","9783540354611"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11780441_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}