{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:11:29Z","timestamp":1725466289555},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642320897"},{"type":"electronic","value":"9783642320903"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32090-3_17","type":"book-chapter","created":{"date-parts":[[2012,8,10]],"date-time":"2012-08-10T05:47:26Z","timestamp":1344577646000},"page":"186-196","source":"Crossref","is-referenced-by-count":6,"title":["An A* Algorithm for Computing Edit Distance between Rooted Labeled Unordered Trees"],"prefix":"10.1007","author":[{"given":"Shoichi","family":"Higuchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomohiro","family":"Kan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiyuki","family":"Yamamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouichi","family":"Hirata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","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. Theoret. Comput. Sci.\u00a0337, 217\u2013239 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Fukagawa, D., Tamura, T., Takasu, A., Tomita, E., Akutsu, T.: A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures. BMC Bioinformatics\u00a012 (2011)","DOI":"10.1186\/1471-2105-12-S1-S13"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-642-21458-5_34","volume-title":"Combinatorial Pattern Matching","author":"K. Hirata","year":"2011","unstructured":"Hirata, K., Yamamoto, Y., Kuboyama, T.: Improved MAX\u00a0SNP-Hard Results for Finding an Edit Distance between Unordered Trees. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 402\u2013415. Springer, Heidelberg (2011)"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1089\/cmb.2006.13.1165","volume":"13","author":"Y. Horesh","year":"2006","unstructured":"Horesh, Y., Mehr, R., Unger, R.: Designing an $A^*\\!\\!$ algorithm for calculating edit distance between rooted-unordered trees. J.\u00a0Comput. Bio.\u00a013, 1165\u20131176 (2006)","journal-title":"J.\u00a0Comput. Bio."},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1007\/978-3-540-24741-8_39","volume-title":"Advances in Database Technology - EDBT 2004","author":"K. Kailing","year":"2004","unstructured":"Kailing, K., Kriegel, H.-P., Sch\u00f6nauer, S., Seidl, T.: Efficient Similarity Search for Hierarchical Data in Large Databases. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., B\u00f6hm, K. (eds.) EDBT 2004. LNCS, vol.\u00a02992, pp. 676\u2013693. Springer, Heidelberg (2004)"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1109\/21.286387","volume":"24","author":"D. Shasha","year":"1994","unstructured":"Shasha, D., Wang, J.T.-L., Zhang, K., Shih, F.Y.: Exact and approximate algorithms for unordered tree matching. IEEE Trans. Sys. Man and Cybernet.\u00a024, 668\u2013678 (1994)","journal-title":"IEEE Trans. Sys. Man and Cybernet."},{"key":"17_CR7","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":"17_CR8","doi-asserted-by":"crossref","unstructured":"Zhang, K., Shasha, D.: Tree pattern matching. In: Apostolico, A., Galil, Z. (eds.) Pattern Matching Algorithms, pp. 341\u2013371 (1997)","DOI":"10.1093\/oso\/9780195113679.003.0014"},{"key":"17_CR9","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. Inform. Process. Lett.\u00a049, 249\u2013254 (1994)","journal-title":"Inform. Process. Lett."},{"key":"17_CR10","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. Inform. Process. Lett.\u00a042, 133\u2013139 (1992)","journal-title":"Inform. Process. Lett."},{"key":"17_CR11","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. Comput.\u00a018, 1245\u20131262 (1989)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32090-3_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T03:46:40Z","timestamp":1643168800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32090-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642320897","9783642320903"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32090-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}