{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:35:22Z","timestamp":1725798922506},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319100722"},{"type":"electronic","value":"9783319100739"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10073-9_16","type":"book-chapter","created":{"date-parts":[[2014,8,20]],"date-time":"2014-08-20T03:15:36Z","timestamp":1408504536000},"page":"196-210","source":"Crossref","is-referenced-by-count":3,"title":["A Memory-Efficient Tree Edit Distance Algorithm"],"prefix":"10.1007","author":[{"given":"Mateusz","family":"Pawlik","sequence":"first","affiliation":[]},{"given":"Nikolaus","family":"Augsten","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1587\/transinf.E93.D.208","volume":"93-D","author":"T. Akutsu","year":"2010","unstructured":"Akutsu, T.: Tree edit distance problems: Algorithms and applications to bioinformatics. IEICE Trans. on Inf. Syst.\u00a093-D(2), 208\u2013218 (2010)","journal-title":"IEICE Trans. on Inf. Syst."},{"key":"16_CR2","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"},{"issue":"8","key":"16_CR3","first-page":"1123","volume":"23","author":"N. Augsten","year":"2011","unstructured":"Augsten, N., Barbosa, D., B\u00f6hlen, M., Palpanas, T.: Efficient top-k approximate subtree matching in small memory. IEEE TKDE\u00a023(8), 1123\u20131137 (2011)","journal-title":"IEEE TKDE"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Augsten, N., B\u00f6hlen, M.H., Gamper, J.: The pq-gram distance between ordered labeled trees. ACM TODS\u00a035(1) (2010)","DOI":"10.1145\/1670243.1670247"},{"key":"16_CR5","unstructured":"Chawathe, S.S.: Comparing hierarchical data in external memory. In: VLDB, pp. 90\u2013101 (1999)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Cobena, G., Abiteboul, S., Marian, A.: Detecting changes in XML documents. In: ICDE, pp. 41\u201352 (2002)","DOI":"10.1109\/ICDE.2002.994696"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, S.: Indexing for subtree similarity-search using edit distance. In: SIGMOD, pp. 49\u201360 (2013)","DOI":"10.1145\/2463676.2463716"},{"issue":"3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.is.2004.11.009","volume":"31","author":"T. Dalamagas","year":"2006","unstructured":"Dalamagas, T., Cheng, T., Winkel, K.-J., Sellis, T.K.: A methodology for clustering XML documents by structure. Inf. Syst.\u00a031(3), 187\u2013228 (2006)","journal-title":"Inf. Syst."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. ACM Trans. on Alg.\u00a06(1) (2009)","DOI":"10.1145\/1644015.1644017"},{"issue":"2-4","key":"16_CR10","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/j.jda.2004.08.018","volume":"3","author":"S. Dulucq","year":"2005","unstructured":"Dulucq, S., Touzet, H.: Decomposition algorithms for the tree edit distance problem. J. Discrete Alg.\u00a03(2-4), 448\u2013471 (2005)","journal-title":"J. Discrete Alg."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Finis, J.P., Raiber, M., Augsten, N., Brunel, R., Kemper, A., F\u00e4rber, F.: RWS-Diff: Flexible and efficient change detection in hierarchical data. In: CIKM, pp. 339\u2013348 (2013)","DOI":"10.1145\/2505515.2505763"},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1145\/1061318.1061326","volume":"30","author":"M. Garofalakis","year":"2005","unstructured":"Garofalakis, M., Kumar, A.: XML stream processing using tree-edit distance embeddings. ACM TODS\u00a030(1), 279\u2013332 (2005)","journal-title":"ACM TODS"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Guha, S., Jagadish, H.V., Koudas, N., Srivastava, D., Yu, T.: Approximate XML joins. In: SIGMOD, pp. 287\u2013298 (2002)","DOI":"10.1145\/564691.564725"},{"issue":"suppl. 1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1186\/1471-2202-10-S1-P89","volume":"10","author":"H. Heumann","year":"2009","unstructured":"Heumann, H., Wittum, G.: The tree-edit-distance, a measure for quantifying neuronal morphology. BMC Neuroscience\u00a010(suppl. 1), P89 (2009)","journal-title":"BMC Neuroscience"},{"key":"16_CR15","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":"16_CR16","doi-asserted-by":"crossref","unstructured":"Korn, F., Saha, B., Srivastava, D., Ying, S.: On repairing structural problems in semi-structured data. Proceedings of the VLDB Endowment\u00a06(9) (2013)","DOI":"10.14778\/2536360.2536361"},{"issue":"8","key":"16_CR17","first-page":"965","volume":"16","author":"K.-H. Lee","year":"2004","unstructured":"Lee, K.-H., Choy, Y.-C., Cho, S.-B.: An efficient algorithm to compute differences between structured documents. IEEE TKDE\u00a016(8), 965\u2013979 (2004)","journal-title":"IEEE TKDE"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-13881-2_2","volume-title":"Natural Language Processing and Information Systems","author":"Z. Lin","year":"2010","unstructured":"Lin, Z., Wang, H., McClean, S.: Measuring tree similarity for natural language processing based information retrieval. In: Hopfe, C.J., Rezgui, Y., M\u00e9tais, E., Preece, A., Li, H. (eds.) NLDB 2010. LNCS, vol.\u00a06177, pp. 13\u201323. Springer, Heidelberg (2010)"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Pawlik, M., Augsten, N.: RTED: A robust algorithm for the tree edit distance. Proceedings of the VLDB Endowment, 334\u2013345 (2011)","DOI":"10.14778\/2095686.2095692"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Springel, V., White, S.D.M., Jenkins, A., Frenk, C.S., Yoshida, N., Gao, L., Navarro, J., Thacker, R., Croton, D., Helly, J., Peacock, J.A., Cole, S., Thomas, P., Couchman, H., Evrard, A., Colberg, J., Pearce, F.: Simulations of the formation, evolution and clustering of galaxies and quasars. Nature\u00a0435 (2005)","DOI":"10.1038\/nature03597"},{"issue":"3","key":"16_CR21","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(3), 422\u2013433 (1979)","journal-title":"J. ACM"},{"issue":"3","key":"16_CR22","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 Recognition\u00a028(3), 463\u2013474 (1995)","journal-title":"Pattern Recognition"},{"issue":"6","key":"16_CR23","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(6), 1245\u20131262 (1989)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10073-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T04:04:46Z","timestamp":1565755486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10073-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319100722","9783319100739"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10073-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}