{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:44:38Z","timestamp":1742913878034,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642320897"},{"type":"electronic","value":"9783642320903"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-32090-3_19","type":"book-chapter","created":{"date-parts":[[2012,8,10]],"date-time":"2012-08-10T05:47:26Z","timestamp":1344577646000},"page":"211-223","source":"Crossref","is-referenced-by-count":2,"title":["On Computing Tractable Variations of Unordered Tree Edit Distance with Network Algorithms"],"prefix":"10.1007","author":[{"given":"Yoshiyuki","family":"Yamamoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouichi","family":"Hirata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuji","family":"Kuboyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows. Prentice Hall (1993)","key":"19_CR1"},{"unstructured":"Chawathe, S.S.: Comparing hierarchical data in external memory. In: Proc. VLDB 1999, pp. 90\u2013101 (1999)","key":"19_CR2"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1137\/0218069","volume":"18","author":"H.N. Gabow","year":"1989","unstructured":"Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for network problems. SIAM J. Comput.\u00a018, 1013\u20131036 (1989)","journal-title":"SIAM J. Comput."},{"key":"19_CR4","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)"},{"unstructured":"Kuboyama, T.: Matching and learning in trees, Ph.D thesis, University of Tokyo (2007), \n                      http:\/\/tk.cc.gakushuin.ac.jp\/doc\/kuboyama2007phd.pdf","key":"19_CR5"},{"unstructured":"Kuboyama, T., Shin, K., Kashima, H.: Flexible tree kernels based on counting the number of tree mappings. In: Proc. MLG 2006, pp. 61\u201372 (2006)","key":"19_CR6"},{"key":"19_CR7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/TPAMI.1979.6786615","volume":"1","author":"S.-Y. Lu","year":"1979","unstructured":"Lu, S.-Y.: A tree-to-tree distance and its application to cluster analysis. IEEE Trans. Pattern Anal. Mach. Intell.\u00a01, 219\u2013224 (1979)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"unstructured":"Luke, S., Panait, L.: A survey and comparison of tree generation algorithms. In: Proc. GECCO 2001, pp. 81\u201388 (2001)","key":"19_CR8"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","volume":"6","author":"S.M. Selkow","year":"1977","unstructured":"Selkow, S.M.: The tree-to-tree editing problem. Inform. Process. Lett.\u00a06, 184\u2013186 (1977)","journal-title":"Inform. Process. Lett."},{"key":"19_CR10","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":"19_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0031-3203(99)00199-5","volume":"34","author":"J.T.L. Wang","year":"2001","unstructured":"Wang, J.T.L., Zhang, K.: Finding similar consensus between trees: An algorithm and a distance hierarchy. Pattern Recog.\u00a034, 127\u2013137 (2001)","journal-title":"Pattern Recog."},{"unstructured":"Wang, Y., DeWitt, D.J., Cai, J.-Y.: X-Diff: An effective change detection algorithm for XML documents. In: Proc. ICDE 2003, pp. 519\u2013530 (2003)","key":"19_CR12"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/0031-3203(94)00109-Y","volume":"28","author":"K. Zhang","year":"1995","unstructured":"Zhang, K.: Algorithms for the constrained editing distance between ordered labeled trees and related problems. Pattern Recog.\u00a028, 463\u2013474 (1995)","journal-title":"Pattern Recog."},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01975866","volume":"15","author":"K. Zhang","year":"1996","unstructured":"Zhang, K.: A constrained edit distance between unordered labeled trees. Algorithmica\u00a015, 205\u2013222 (1996)","journal-title":"Algorithmica"},{"key":"19_CR15","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. Let.\u00a049, 249\u2013254 (1994)","journal-title":"Inform. Process. Let."},{"key":"19_CR16","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. Let.\u00a042, 133\u2013139 (1992)","journal-title":"Inform. Process. Let."},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1142\/S0129054196000051","volume":"7","author":"K. Zhang","year":"1995","unstructured":"Zhang, K., Wang, J., Shasha, D.: On the editing distance between undirected acyclic graphs. Int. J. Found. Comput. Sci.\u00a07, 43\u201358 (1995)","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32090-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T23:08:08Z","timestamp":1676156888000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-32090-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642320897","9783642320903"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32090-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}