{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:06:33Z","timestamp":1749218793356},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214578"},{"type":"electronic","value":"9783642214585"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21458-5_34","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T17:11:27Z","timestamp":1309194687000},"page":"402-415","source":"Crossref","is-referenced-by-count":15,"title":["Improved MAX\u00a0SNP-Hard Results for Finding an Edit Distance between Unordered Trees"],"prefix":"10.1007","author":[{"given":"Kouichi","family":"Hirata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiyuki","family":"Yamamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuji","family":"Kuboyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_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":"34_CR2","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. ACM Trans. Algorithms\u00a06 (2009)","DOI":"10.1145\/1644015.1644017"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(95)80029-9","volume":"143","author":"T. Jiang","year":"1995","unstructured":"Jiang, T., Wang, L., Zhang, K.: Alignment of trees \u2013 an alternative to tree edit. Theoret. Comput. Sci.\u00a0143, 137\u2013148 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"37","author":"V. Kann","year":"1991","unstructured":"Kann, V.: Maximum bounded 3-demensional matching is MAX SNP-complete. Inform. Process. Let.\u00a037, 27\u201335 (1991)","journal-title":"Inform. Process. Let."},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation and complexity. J. Comput. System Sci.\u00a043, 425\u2013440 (1991)","journal-title":"J. Comput. System Sci."},{"key":"34_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":"34_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":"34_CR8","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. Inform. Process. Let.\u00a049, 249\u2013254 (1994)","journal-title":"Inform. Process. Let."},{"key":"34_CR9","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."},{"key":"34_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. Let.\u00a042, 133\u2013139 (1992)","journal-title":"Inform. Process. Let."},{"key":"34_CR11","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","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21458-5_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T10:14:51Z","timestamp":1553854491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21458-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214578","9783642214585"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21458-5_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}