{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:16Z","timestamp":1750220656191,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T00:00:00Z","timestamp":1603065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P 29859"],"award-info":[{"award-number":["P 29859"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,19]]},"DOI":"10.1145\/3340531.3412026","type":"proceedings-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T06:32:45Z","timestamp":1603089165000},"page":"1225-1234","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Minimal Edit-Based Diffs for Large Trees"],"prefix":"10.1145","author":[{"given":"Mateusz","family":"Pawlik","sequence":"first","affiliation":[{"name":"University of Salzburg, Salzburg, Austria"}]},{"given":"Nikolaus","family":"Augsten","sequence":"additional","affiliation":[{"name":"University of Salzburg, Salzburg, Austria"}]}],"member":"320","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Tree edit distance problems algorithms and applications to bioinformatics. IEICE Trans. on Information and Systems E93-D, 2","author":"Akutsu Tatsuya","year":"2010","unstructured":"Tatsuya Akutsu . 2010. Tree edit distance problems algorithms and applications to bioinformatics. IEICE Trans. on Information and Systems E93-D, 2 ( 2010 ), 208--218. Tatsuya Akutsu. 2010. Tree edit distance problems algorithms and applications to bioinformatics. IEICE Trans. on Information and Systems E93-D, 2 (2010), 208--218."},{"key":"e_1_3_2_2_2_1","first-page":"134","article-title":"Efficient tree-matching methods for accurate carbohydrate database queries","volume":"14","author":"Aoki Kiyoko F.","year":"2003","unstructured":"Kiyoko F. Aoki , Atsuko Yamaguchi , Yasushi Okuno , Tatsuya Akutsu , Nobuhisa Ueda , Minoru Kanehisa , and Hiroshi Mamitsuka . 2003 . Efficient tree-matching methods for accurate carbohydrate database queries . Genome Informatics 14 (2003), 134 -- 143 . Kiyoko F. Aoki, Atsuko Yamaguchi, Yasushi Okuno, Tatsuya Akutsu, Nobuhisa Ueda, Minoru Kanehisa, and Hiroshi Mamitsuka. 2003. Efficient tree-matching methods for accurate carbohydrate database queries. Genome Informatics 14 (2003), 134--143.","journal-title":"Genome Informatics"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.245"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-018-0532-7"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-005-1544-y"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICIAP.1999.797676"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316388"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.77"},{"key":"e_1_3_2_2_9_1","volume-title":"Altigran Soares da Silva, and Alberto H. F. Laender.","author":"de Castro Reis Davi","year":"2004","unstructured":"Davi de Castro Reis , Paulo Braz Golgher , Altigran Soares da Silva, and Alberto H. F. Laender. 2004 . Automatic web news extraction using tree edit distance. In WWW. 502--511. Davi de Castro Reis, Paulo Braz Golgher, Altigran Soares da Silva, and Alberto H. F. Laender. 2004. Automatic web news extraction using tree edit distance. In WWW. 502--511."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644015.1644017"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794369"},{"key":"e_1_3_2_2_12_1","volume-title":"Workshop, SSPR & SPR. 86--96","author":"Habrard Amaury","year":"2008","unstructured":"Amaury Habrard , Jos\u00e9 Manuel I\u00f1esta , David Rizo , and Marc Sebban . 2008 . Melody recognition with learned edit distances. In Structural, Syntactic, and Statistical Pattern Recognition: Joint IAPR Int . Workshop, SSPR & SPR. 86--96 . Amaury Habrard, Jos\u00e9 Manuel I\u00f1esta, David Rizo, and Marc Sebban. 2008. Melody recognition with learned edit distances. In Structural, Syntactic, and Statistical Pattern Recognition: Joint IAPR Int. Workshop, SSPR & SPR. 86--96."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12021-009-9051-4"},{"key":"e_1_3_2_2_14_1","volume-title":"Effective Filters and Linear Time Verification for Tree Similarity Joins. In IEEE Int. Conf. on Data Engineering.","author":"H\u00fctter Thomas","year":"2019","unstructured":"Thomas H\u00fctter , Mateusz Pawlik , Robert Loschinger , and Nikolaus Augsten . 2019 . Effective Filters and Linear Time Verification for Tree Similarity Joins. In IEEE Int. Conf. on Data Engineering. Thomas H\u00fctter, Mateusz Pawlik, Robert Loschinger, and Nikolaus Augsten. 2019. Effective Filters and Linear Time Verification for Tree Similarity Joins. In IEEE Int. Conf. on Data Engineering."},{"key":"e_1_3_2_2_15_1","volume-title":"Retrieving Documents with Mathematical Content. In Int. Conf. on Research and Development in Information Retrieval. 353--362","author":"Kamali Shahab","year":"2013","unstructured":"Shahab Kamali and Frank Wm Tompa . 2013 . Retrieving Documents with Mathematical Content. In Int. Conf. on Research and Development in Information Retrieval. 353--362 . Shahab Kamali and Frank Wm Tompa. 2013. Retrieving Documents with Mathematical Content. In Int. Conf. on Research and Development in Information Retrieval. 353--362."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2692050.2692052"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIT.2007.19"},{"key":"e_1_3_2_2_18_1","volume-title":"Kimia","author":"Klein Philip N.","year":"2000","unstructured":"Philip N. Klein , Srikanta Tirthapura , Daniel Sharvit , and Benjamin B . Kimia . 2000 . A tree-edit-distance algorithm for comparing simple, closed shapes. In ACM-SIAM Symposium on Discrete Algorithms. 696--704. Philip N. Klein, Srikanta Tirthapura, Daniel Sharvit, and Benjamin B. Kimia. 2000. A tree-edit-distance algorithm for comparing simple, closed shapes. In ACM-SIAM Symposium on Discrete Algorithms. 696--704."},{"volume-title":"Int. Conf. on Applications of Natural Language to Information Systems. 13--23","author":"Lin Zhiwei","key":"e_1_3_2_2_19_1","unstructured":"Zhiwei Lin , Hui Wang , and Sally I . McClean. 2010. Measuring tree similarity for natural language processing based information retrieval . In Int. Conf. on Applications of Natural Language to Information Systems. 13--23 . Zhiwei Lin, Hui Wang, and Sally I. McClean. 2010. Measuring tree similarity for natural language processing based information retrieval. In Int. Conf. on Applications of Natural Language to Information Systems. 13--23."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00192-X"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2095686.2095692"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699485"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2015.08.004"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/322139.322143"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2006.07.002"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/3118740.3118864"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260818"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(94)00109-Y"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218082"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90136-J"}],"event":{"name":"CIKM '20: The 29th ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Virtual Event Ireland","acronym":"CIKM '20"},"container-title":["Proceedings of the 29th ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412026","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340531.3412026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:29Z","timestamp":1750197749000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,19]]},"references-count":30,"alternative-id":["10.1145\/3340531.3412026","10.1145\/3340531"],"URL":"https:\/\/doi.org\/10.1145\/3340531.3412026","relation":{},"subject":[],"published":{"date-parts":[[2020,10,19]]},"assertion":[{"value":"2020-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}