{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:35:01Z","timestamp":1743035701760,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031206429"},{"type":"electronic","value":"9783031206436"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20643-6_21","type":"book-chapter","created":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T13:18:09Z","timestamp":1667222289000},"page":"290-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Hardness of\u00a0Computing the\u00a0Edit Distance of\u00a0Shallow Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6024-1557","authenticated-orcid":false,"given":"Panagiotis","family":"Charalampopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6993-5440","authenticated-orcid":false,"given":"Pawe\u0142","family":"Gawrychowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9262-1821","authenticated-orcid":false,"given":"Shay","family":"Mozes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4510-7552","authenticated-orcid":false,"given":"Oren","family":"Weimann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,1]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","unstructured":"Akmal, S., Jin, C.: Faster algorithms for bounded tree edit distance. In: 48th ICALP, pp. 12:1\u201312:15 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2021.12","DOI":"10.4230\/LIPIcs.ICALP.2021.12"},{"key":"21_CR2","doi-asserted-by":"publisher","unstructured":"Akutsu, T., Fukagawa, D., Takasu, A.: Approximating tree edit distance through string edit distance. In: 17th ISAAC, pp. 90\u201399 (2006). https:\/\/doi.org\/10.1007\/11940128_11","DOI":"10.1007\/11940128_11"},{"key":"21_CR3","unstructured":"Alur, R., D\u2019Antoni, L., Gulwani, S., Kini, D., Viswanathan, M.: Automated grading of DFA constructions. In: 23rd IJCAI, pp. 1976\u20131982 (2013). http:\/\/dl.acm.org\/citation.cfm?id=2540128.2540412"},{"volume-title":"Pattern Matching Algorithms","year":"1997","key":"21_CR4","unstructured":"Apostolico, A., Galil, Z. (eds.): Pattern Matching Algorithms. Oxford University Press, Oxford, UK (1997)"},{"issue":"3","key":"21_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.3233\/FI-2010-282","volume":"101","author":"T Aratsu","year":"2010","unstructured":"Aratsu, T., Hirata, K., Kuboyama, T.: Approximating tree edit distance through string edit distance for binary tree codes. Fundam. Inform. 101(3), 157\u2013171 (2010). https:\/\/doi.org\/10.3233\/FI-2010-282","journal-title":"Fundam. Inform."},{"key":"21_CR6","doi-asserted-by":"publisher","unstructured":"Bellando, J., Kothari, R.: Region-based modeling and tree edit distance as a basis for gesture recognition. In: 10th International Conference on Image Analysis and Processing, ISIAP 1999, pp. 698\u2013703 (1999). https:\/\/doi.org\/10.1109\/ICIAP.1999.797676","DOI":"10.1109\/ICIAP.1999.797676"},{"issue":"1\u20133","key":"21_CR7","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. 337(1\u20133), 217\u2013239 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2004.12.030","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR8","doi-asserted-by":"publisher","unstructured":"Boroujeni, M., Ghodsi, M., Hajiaghayi, M., Seddighin, S.: 1+$$\\epsilon $$ approximation of tree edit distance in quadratic time. In: 51st STOC, pp. 709\u2013720. ACM (2019). https:\/\/doi.org\/10.1145\/3313276.3316388","DOI":"10.1145\/3313276.3316388"},{"issue":"4","key":"21_CR9","doi-asserted-by":"publisher","first-page":"48:1","DOI":"10.1145\/3381878","volume":"16","author":"K Bringmann","year":"2020","unstructured":"Bringmann, K., Gawrychowski, P., Mozes, S., Weimann, O.: Tree edit distance cannot be computed in strongly subcubic time (unless APSP can). ACM Trans. Algorithms 16(4), 48:1-48:22 (2020). https:\/\/doi.org\/10.1145\/3381878","journal-title":"ACM Trans. Algorithms"},{"key":"21_CR10","doi-asserted-by":"publisher","unstructured":"Buneman, P., Grohe, M., Koch, C.: Path queries on compressed XML. In: VLDB, pp. 141\u2013152 (2003). https:\/\/doi.org\/10.1016\/B978-012722442-8\/50021-5","DOI":"10.1016\/B978-012722442-8\/50021-5"},{"key":"21_CR11","unstructured":"Chawathe, S.: Comparing hierarchical data in external memory. In: VLDB, pp. 90\u2013101 (1999). http:\/\/www.vldb.org\/conf\/1999\/P8.pdf"},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"2:1","DOI":"10.1145\/1644015.1644017","volume":"6","author":"ED Demaine","year":"2009","unstructured":"Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. ACM Trans. Algorithms 6(1), 2:1-2:19 (2009). https:\/\/doi.org\/10.1145\/1644015.1644017","journal-title":"ACM Trans. Algorithms"},{"key":"21_CR13","doi-asserted-by":"publisher","unstructured":"Dudek, B., Gawrychowski, P.: Edit distance between unrooted trees in cubic time. In: 45th ICALP, pp. 45:1\u201345:14 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.45","DOI":"10.4230\/LIPIcs.ICALP.2018.45"},{"issue":"2\u20134","key":"21_CR14","doi-asserted-by":"publisher","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 Algorithms 3(2\u20134), 448\u2013471 (2005). https:\/\/doi.org\/10.1016\/j.jda.2004.08.018","journal-title":"J. Discrete Algorithms"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"D\u00fcrr, A.: Improved bounds for rectangular monotone min-plus product and applications. Arxiv 2208.02862v1 (2022)","DOI":"10.2139\/ssrn.4187498"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1613676.1613680","volume":"57","author":"P Ferragina","year":"2009","unstructured":"Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Compressing and indexing labeled trees, with applications. J. ACM 57, 1\u201333 (2009). https:\/\/doi.org\/10.1145\/1613676.1613680","journal-title":"J. ACM"},{"key":"21_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"issue":"1","key":"21_CR18","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"CM Hoffmann","year":"1982","unstructured":"Hoffmann, C.M., O\u2019Donnell, M.J.: Pattern matching in trees. J. ACM 29(1), 68\u201395 (1982). https:\/\/doi.org\/10.1145\/322290.322295","journal-title":"J. ACM"},{"key":"21_CR19","unstructured":"Klein, P.N., Tirthapura, S., Sharvit, D., Kimia, B.B.: A tree-edit-distance algorithm for comparing simple, closed shapes. In: 11th SODA, pp. 696\u2013704 (2000). http:\/\/dl.acm.org\/citation.cfm?id=338219.338628"},{"key":"21_CR20","doi-asserted-by":"publisher","unstructured":"Klein, P.N.: Computing the edit-distance between unrooted ordered trees. In: 6th ESA, pp. 91\u2013102 (1998). https:\/\/doi.org\/10.1007\/3-540-68530-8_8","DOI":"10.1007\/3-540-68530-8_8"},{"key":"21_CR21","doi-asserted-by":"publisher","unstructured":"Mao, X.: Breaking the cubic barrier for (unweighted) tree edit distance. In: 62nd FOCS, pp. 792\u2013803 (2021). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00082","DOI":"10.1109\/FOCS52979.2021.00082"},{"issue":"1","key":"21_CR22","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/2699485","volume":"40","author":"M Pawlik","year":"2015","unstructured":"Pawlik, M., Augsten, N.: Efficient computation of the tree edit distance. ACM Trans. Database Syst. 40(1), 3:1-3:40 (2015). https:\/\/doi.org\/10.1145\/2699485","journal-title":"ACM Trans. Database Syst."},{"issue":"9\u201310","key":"21_CR23","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1016\/S0167-8655(02)00382-3","volume":"24","author":"JR Rico-Juan","year":"2003","unstructured":"Rico-Juan, J.R., Mic\u00f3, L.: Comparison of AESA and LAESA search algorithms using string and tree-edit-distances. Pattern Recogn. Lett. 24(9\u201310), 1417\u20131426 (2003). https:\/\/doi.org\/10.1016\/S0167-8655(02)00382-3","journal-title":"Pattern Recogn. Lett."},{"issue":"6","key":"21_CR24","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","volume":"6","author":"S Selkow","year":"1977","unstructured":"Selkow, S.: The tree-to-tree editing problem. Inf. Process. Lett. 6(6), 184\u2013186 (1977). https:\/\/doi.org\/10.1016\/0020-0190(77)90064-3","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"21_CR25","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1093\/bioinformatics\/6.4.309","volume":"6","author":"BA Shapiro","year":"1990","unstructured":"Shapiro, B.A., Zhang, K.: Comparing multiple RNA secondary structures using tree comparisons. Comput. Appl. Biosci. 6(4), 309\u2013318 (1990). https:\/\/doi.org\/10.1093\/bioinformatics\/6.4.309","journal-title":"Comput. Appl. Biosci."},{"issue":"4","key":"21_CR26","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/0196-6774(90)90011-3","volume":"11","author":"D Shasha","year":"1990","unstructured":"Shasha, D., Zhang, K.: Fast algorithms for the unit cost editing distance between trees. J. Algorithms 11(4), 581\u2013621 (1990). https:\/\/doi.org\/10.1016\/0196-6774(90)90011-3","journal-title":"J. Algorithms"},{"issue":"3","key":"21_CR27","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K Tai","year":"1979","unstructured":"Tai, K.: The tree-to-tree correction problem. J. ACM 26(3), 422\u2013433 (1979). https:\/\/doi.org\/10.1145\/322139.322143","journal-title":"J. ACM"},{"issue":"4","key":"21_CR28","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1016\/j.jda.2006.07.002","volume":"5","author":"H Touzet","year":"2007","unstructured":"Touzet, H.: Comparing similar ordered trees in linear-time. J. Discrete Algorithms 5(4), 696\u2013705 (2007). https:\/\/doi.org\/10.1016\/j.jda.2006.07.002","journal-title":"J. Discrete Algorithms"},{"key":"21_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81885-2","volume-title":"Algorithms on Trees and Graphs","author":"G Valiente","year":"2002","unstructured":"Valiente, G.: Algorithms on Trees and Graphs. Springer, Cham (2002). https:\/\/doi.org\/10.1007\/978-3-030-81885-2"},{"issue":"1","key":"21_CR30","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168\u2013173 (1974). https:\/\/doi.org\/10.1145\/321796.321811","journal-title":"J. ACM"},{"key":"21_CR31","unstructured":"Waterman, M.: Introduction to Computational Biology: Maps, Sequences and Genomes, Chapters 13, 14. Chapman and Hall (1995)"},{"issue":"5","key":"21_CR32","doi-asserted-by":"publisher","first-page":"27:1","DOI":"10.1145\/3186893","volume":"65","author":"VV Williams","year":"2018","unstructured":"Williams, V.V., Williams, R.R.: Subcubic equivalences between path, matrix, and triangle problems. J. ACM 65(5), 27:1-27:38 (2018). https:\/\/doi.org\/10.1145\/3186893","journal-title":"J. ACM"},{"key":"21_CR33","unstructured":"Yao, X., Durme, B.V., Callison-Burch, C., Clark, P.: Answer extraction as sequence tagging with tree edit distance. In: HLT-NAACL 2013, pp. 858\u2013867 (2013). http:\/\/aclweb.org\/anthology\/N\/N13\/N13-1106.pdf"},{"issue":"3","key":"21_CR34","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 Recogn. 28(3), 463\u2013474 (1995). https:\/\/doi.org\/10.1016\/0031-3203(94)00109-Y","journal-title":"Pattern Recogn."},{"issue":"6","key":"21_CR35","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.E.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18(6), 1245\u20131262 (1989). https:\/\/doi.org\/10.1137\/0218082","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20643-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T13:20:38Z","timestamp":1667222438000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20643-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206429","9783031206436"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20643-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Concepci\u00f3n","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spire2022.inf.udec.cl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.62","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}