{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:56:06Z","timestamp":1742914566105,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_40","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"452-463","source":"Crossref","is-referenced-by-count":2,"title":["Fast Algorithms for Comparison of Similar Unordered Trees"],"prefix":"10.1007","author":[{"given":"Daiji","family":"Fukagawa","sequence":"first","affiliation":[]},{"given":"Tatsuya","family":"Akutsu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","volume-title":"The design and analysis of computer algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison-Wesley, Reading (1974)"},{"key":"40_CR2","first-page":"1488","volume":"76","author":"T. Akutsu","year":"1992","unstructured":"Akutsu, T.: A Polynomial Time Algorithm for Finding a Largest Common Subgraph of Almost Trees of Bounded Degree. IEICE Trans. on Information and Systems\u00a0E76-A, 1488\u20131493 (1992)","journal-title":"IEICE Trans. on Information and Systems"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(97)00278-8","volume":"233","author":"T. Akutsu","year":"2000","unstructured":"Akutsu, T., Halld\u00f3rsson, M.M.: On the approximation of largest common subtrees and largest common point sets. Theoretical Computer Science\u00a0233, 33\u201350 (2000)","journal-title":"Theoretical Computer Science"},{"key":"40_CR4","first-page":"134","volume":"14","author":"K.F. Aoki","year":"2003","unstructured":"Aoki, K.F., Yamaguchi, A., Okuno, Y., Akutsu, T., Ueda, N., Kanehisa, M., Mamitsuka, H.: Efficient tree-matching methods for accurate carbohydrate database queries. Genome Informatics\u00a014, 134\u2013143 (2003)","journal-title":"Genome Informatics"},{"key":"40_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0020-0190(00)00174-5","volume":"79","author":"K. Chin","year":"2001","unstructured":"Chin, K., Yen, H.: The symmetry number problem for trees. Information Processing Letters\u00a079, 73\u201379 (2001)","journal-title":"Information Processing Letters"},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1137\/S0097539700382704","volume":"32","author":"R. Cole","year":"2003","unstructured":"Cole, R., Hariharan, R.: Tree pattern matching to subset matching in linear time. SIAM J. Computing\u00a032, 1056\u20131066 (2003)","journal-title":"SIAM J. Computing"},{"key":"40_CR7","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, 105\u2013120 (2003)","journal-title":"Fundamenta Informaticae"},{"key":"40_CR8","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 \u2014 an alternative to tree edit. Theoretical Computer Science\u00a0143, 137\u2013148 (1995)","journal-title":"Theoretical Computer Science"},{"key":"40_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 1998","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":"40_CR10","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. J. Algorithms\u00a010, 157\u2013169 (1989)","journal-title":"J. Algorithms"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0167-5060(08)70324-8","volume-title":"Algorithmic Aspects of Combinatorics","author":"D.W. Matula","year":"1978","unstructured":"Matula, D.W.: Subtree isomorphism in O(n\n                        5\/2). In: Alspach, B., Hell, P., Miller, D.J. (eds.) Algorithmic Aspects of Combinatorics, Ann. Discrete Math, vol.\u00a02, pp. 91\u2013106. North-Holland, Amsterdam (1978)"},{"key":"40_CR12","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1999.1044","volume":"33","author":"R. Shamir","year":"1999","unstructured":"Shamir, R., Tsur, D.: Faster subtree isomorphism. J. Algorithms\u00a033, 267\u2013280 (1999)","journal-title":"J. Algorithms"},{"key":"40_CR13","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/0196-6774(90)90011-3","volume":"11","author":"D. Shasha","year":"1990","unstructured":"Shasha, D., Zhang, K.: Fast algorithms for the unit cost editing distance between trees. J. Algorithms\u00a011, 581\u2013621 (1990)","journal-title":"J. Algorithms"},{"key":"40_CR14","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. J. ACM\u00a026, 422\u2013433 (1979)","journal-title":"J. ACM"},{"key":"40_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04921-1","volume-title":"Algorithms on trees and graphs","author":"G. Valiente","year":"2002","unstructured":"Valiente, G.: Algorithms on trees and graphs. Springer, Heidelberg (2002)"},{"key":"40_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-540-24587-2_8","volume-title":"Algorithms and Computation","author":"A. Yamaguchi","year":"2003","unstructured":"Yamaguchi, A., Mamitsuka, H.: Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 58\u201367. Springer, Heidelberg (2003)"},{"key":"40_CR17","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 snp-hard results concerning unordered labeled trees. Information Processing Letters\u00a049, 249\u2013254 (1994)","journal-title":"Information Processing Letters"},{"key":"40_CR18","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 J. Computing\u00a018, 1245\u20131262 (1989)","journal-title":"SIAM J. Computing"},{"key":"40_CR19","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","volume":"42","author":"K. Zhang","year":"1992","unstructured":"Zhang, K., Statman, R., Shasha, D.: On the Editing Distance Between Unordered Labeled Trees. Information Processing Letters\u00a042, 133\u2013139 (1992)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T20:19:19Z","timestamp":1675196359000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}