Document Open Access Logo

Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime

Authors Tomasz Kociumaka , Ali Shahali

PDF

File

Thumbnail PDF
PDF
LIPIcs.ESA.2025.94.pdf
  • Filesize: 0.9 MB
  • 16 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Pattern matching
Keywords
  • tree edit distance
  • edit distance
  • kernelization
  • dynamic programming

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

The tree edit distance is a natural dissimilarity measure between rooted ordered trees whose nodes are labeled over an alphabet Σ. It is defined as the minimum number of node edits - insertions, deletions, and relabelings - required to transform one tree into the other. The weighted variant assigns costs ≥ 1 to edits (based on node labels), minimizing total cost rather than edit count.
The unweighted tree edit distance between two trees of total size n can be computed in 𝒪(n^{2.6857}) time; in contrast, determining the weighted tree edit distance is fine-grained equivalent to the All-Pairs Shortest Paths (APSP) problem and requires n³/2^Ω(√{log n}) time [Nogler, Polak, Saha, Vassilevska Williams, Xu, Ye; STOC'25]. These impractical super-quadratic times for large, similar trees motivate the bounded version, parameterizing runtime by the distance k to enable faster algorithms for k ≪ n.
Prior algorithms for bounded unweighted edit distance achieve 𝒪(nk²log n) [Akmal & Jin; ICALP’21] and 𝒪(n + k⁷log k) [Das, Gilbert, Hajiaghayi, Kociumaka, Saha; STOC'23]. For weighted, only 𝒪(n + k^{15}) is known [Das, Gilbert, Hajiaghayi, Kociumaka, Saha; STOC'23]. 
We present an 𝒪(n + k⁶ log k)-time algorithm for bounded tree edit distance in both weighted/unweighted settings. First, we devise a simpler weighted 𝒪(nk² log n)-time algorithm. Next, we exploit periodic structures in input trees via an optimized universal kernel: modifying prior 𝒪(n)-time 𝒪(k⁵)-size kernels to generate such structured instances, enabling efficient analysis.

Cite As Get BibTex

Tomasz Kociumaka and Ali Shahali. Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 94:1-94:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ESA.2025.94

Author Details

Tomasz Kociumaka
  • Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbrücken, Germany
Ali Shahali
  • Sharif University of Technology, Tehran, Iran

Funding

  • Shahali, Ali: The work of was carried out mostly during a summer internship at the Max Planck Institute for Informatics.

References

  1. Shyan Akmal and Ce Jin. Faster algorithms for bounded tree edit distance. In Nikhil Bansal, Emanuela Merelli, and James Worrell, editors, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference), volume 198 of LIPIcs, pages 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPIcs.ICALP.2021.12.
  2. Tatsuya Akutsu. Tree edit distance problems: Algorithms and applications to bioinformatics. IEICE Trans. Inf. Syst., 93-D(2):208-218, 2010. URL: https://doi.org/10.1587/TRANSINF.E93.D.208.
  3. Tatsuya Akutsu, Daiji Fukagawa, and Atsuhiro Takasu. Approximating tree edit distance through string edit distance. Algorithmica, 57(2):325-348, 2010. URL: https://doi.org/10.1007/s00453-008-9213-z.
  4. Arturs Backurs and Piotr Indyk. Edit distance cannot be computed in strongly subquadratic time (unless SETH is false). SIAM J. Comput., 47(3):1087-1097, 2018. URL: https://doi.org/10.1137/15M1053128.
  5. John Bellando and Ravi Kothari. Region-based modeling and tree edit distance as a basis for gesture recognition. In 1oth International Conference on Image Analysis and Processing (ICIAP 1999), 27-29 September 1999, Venice, Italy, pages 698-703. IEEE Computer Society, 1999. URL: https://doi.org/10.1109/ICIAP.1999.797676.
  6. Philip Bille. A survey on tree edit distance and related problems. Theor. Comput. Sci., 337(1–3):217-239, June 2005. URL: https://doi.org/10.1016/j.tcs.2004.12.030.
  7. Mahdi Boroujeni, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, and Saeed Seddighin. 1+ε approximation of tree edit distance in quadratic time. In Moses Charikar and Edith Cohen, editors, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019, pages 709-720. ACM, 2019. URL: https://doi.org/10.1145/3313276.3316388.
  8. Karl Bringmann, Paweł Gawrychowski, Shay Mozes, and Oren Weimann. Tree edit distance cannot be computed in strongly subcubic time (unless apsp can). ACM Trans. Algorithms, 16(4), July 2020. URL: https://doi.org/10.1145/3381878.
  9. Peter Buneman, Martin Grohe, and Christoph Koch. Path queries on compressed xml. In Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29, VLDB '03, pages 141-152. VLDB Endowment, 2003. URL: https://doi.org/10.1016/b978-012722442-8/50021-5.
  10. Alejandro Cassis, Tomasz Kociumaka, and Philip Wellnitz. Optimal algorithms for bounded weighted edit distance. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, pages 2177-2187. IEEE, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00135.
  11. Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, and Oren Weimann. On the hardness of computing the edit distance of shallow trees. In Diego Arroyuelo and Barbara Poblete, editors, String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Concepción, Chile, November 8-10, 2022, Proceedings, volume 13617 of Lecture Notes in Computer Science, pages 290-302. Springer, 2022. URL: https://doi.org/10.1007/978-3-031-20643-6_21.
  12. Sudarshan S. Chawathe. Comparing hierarchical data in external memory. In Malcolm P. Atkinson, Maria E. Orlowska, Patrick Valduriez, Stanley B. Zdonik, and Michael L. Brodie, editors, VLDB'99, Proceedings of 25th International Conference on Very Large Data Bases, September 7-10, 1999, Edinburgh, Scotland, UK, pages 90-101. Morgan Kaufmann, 1999. URL: http://www.vldb.org/conf/1999/P8.pdf.
  13. Gregory Cobena, Serge Abiteboul, and Amélie Marian. Detecting changes in XML documents. In Rakesh Agrawal and Klaus R. Dittrich, editors, Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26 - March 1, 2002, pages 41-52. IEEE Computer Society, 2002. URL: https://doi.org/10.1109/ICDE.2002.994696.
  14. Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, and Barna Saha. Weighted edit distance computation: Strings, trees, and dyck. In Barna Saha and Rocco A. Servedio, editors, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pages 377-390. ACM, 2023. URL: https://doi.org/10.1145/3564246.3585178.
  15. Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, and Hamed Saleh. Õ(n+poly(k))-time algorithm for bounded tree edit distance. In 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022. IEEE, 2022. URL: https://doi.org/10.1109/FOCS54457.2022.00071.
  16. Davi de Castro Reis, Paulo Braz Golgher, Altigran Soares da Silva, and Alberto H. F. Laender. Automatic web news extraction using tree edit distance. In Stuart I. Feldman, Mike Uretsky, Marc Najork, and Craig E. Wills, editors, Proceedings of the 13th international conference on World Wide Web, WWW 2004, New York, NY, USA, May 17-20, 2004, pages 502-511. ACM, 2004. URL: https://doi.org/10.1145/988672.988740.
  17. Erik D. Demaine, Shay Mozes, Benjamin Rossman, and Oren Weimann. An optimal decomposition algorithm for tree edit distance. ACM Trans. Algorithms, 6(1), December 2010. URL: https://doi.org/10.1145/1644015.1644017.
  18. Anita Dürr. Improved bounds for rectangular monotone min-plus product and applications. Inf. Process. Lett., 181:106358, 2023. URL: https://doi.org/10.1016/J.IPL.2023.106358.
  19. Dayi Fan, Rubao Lee, and Xiaodong Zhang. X-TED: massive parallelization of tree edit distance. Proc. VLDB Endow., 17(7):1683-1696, 2024. URL: https://doi.org/10.14778/3654621.3654634.
  20. Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, and S. Muthukrishnan. Compressing and indexing labeled trees, with applications. J. ACM, 57(1), November 2009. URL: https://doi.org/10.1145/1613676.1613680.
  21. Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, and Tatiana Starikovskaya. An improved algorithm for the k-dyck edit distance problem. ACM Trans. Algorithms, 20(3):26, 2024. URL: https://doi.org/10.1145/3627539.
  22. Dan Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, USA, 1997. URL: https://doi.org/10.1017/cbo9780511574931.
  23. Matthias Höchsmann, Thomas Töller, Robert Giegerich, and Stefan Kurtz. Local similarity in RNA secondary structures. In 2nd IEEE Computer Society Bioinformatics Conference, CSB 2003, Stanford, CA, USA, August 11-14, 2003, pages 159-168. IEEE Computer Society, 2003. URL: https://doi.org/10.1109/CSB.2003.1227315.
  24. Philip N. Klein. Computing the edit-distance between unrooted ordered trees. In Proceedings of the 6th Annual European Symposium on Algorithms, ESA '98, pages 91-102, Berlin, Heidelberg, 1998. Springer-Verlag. URL: https://doi.org/10.1007/3-540-68530-8_8.
  25. Philip N. Klein, Thomas B. Sebastian, and Benjamin B. Kimia. Shape matching using edit-distance: an implementation. In S. Rao Kosaraju, editor, Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA, pages 781-790. ACM/SIAM, 2001. URL: http://dl.acm.org/citation.cfm?id=365411.365779.
  26. Philip N. Klein, Srikanta Tirthapura, Daniel Sharvit, and Benjamin B. Kimia. A tree-edit-distance algorithm for comparing simple, closed shapes. In David B. Shmoys, editor, Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, USA, pages 696-704. ACM/SIAM, 2000. URL: http://dl.acm.org/citation.cfm?id=338219.338628.
  27. Tomasz Kociumaka and Ali Shahali. Faster algorithm for bounded tree edit distance in the low-distance regime, 2025. URL: https://doi.org/10.48550/arXiv.2507.02701.
  28. Gad M. Landau and Uzi Vishkin. Fast string matching with k differences. Journal of Computer and System Sciences, 37(1):63-78, 1988. URL: https://doi.org/10.1016/0022-0000(88)90045-1.
  29. Xiao Mao. Breaking the cubic barrier for (unweighted) tree edit distance. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pages 792-803. IEEE, 2021. URL: https://doi.org/10.1109/FOCS52979.2021.00082.
  30. J. Ian Munro and Venkatesh Raman. Succinct representation of balanced parentheses and static trees. SIAM J. Comput., 31(3):762-776, 2001. URL: https://doi.org/10.1137/S0097539799364092.
  31. Eugene W. Myers. An O(ND) difference algorithm and its variations. Algorithmica, 1(2):251-266, 1986. URL: https://doi.org/10.1007/BF01840446.
  32. Gonzalo Navarro and Kunihiko Sadakane. Fully functional static and dynamic succinct trees. ACM Trans. Algorithms, 10(3):16:1-16:39, 2014. URL: https://doi.org/10.1145/2601073.
  33. Jakob Nogler, Adam Polak, Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, and Christopher Ye. Faster weighted and unweighted tree edit distance and APSP equivalence. In 57th Annual ACM Symposium on Theory of Computing, STOC 2025, pages 2167-2178. ACM, 2025. URL: https://doi.org/10.1145/3717823.3718116.
  34. Mateusz Pawlik and Nikolaus Augsten. Efficient computation of the tree edit distance. ACM Trans. Database Syst., 40(1):3:1-3:40, 2015. URL: https://doi.org/10.1145/2699485.
  35. Mateusz Pawlik and Nikolaus Augsten. Tree edit distance: Robust and memory-efficient. Inf. Syst., 56:157-173, 2016. URL: https://doi.org/10.1016/J.IS.2015.08.004.
  36. Thomas B. Sebastian, Philip N. Klein, and Benjamin B. Kimia. Recognition of shapes by editing their shock graphs. IEEE Trans. Pattern Anal. Mach. Intell., 26(5):550-571, 2004. URL: https://doi.org/10.1109/TPAMI.2004.1273924.
  37. Masoud Seddighin and Saeed Seddighin. 3+ε approximation of tree edit distance in truly subquadratic time. In 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, volume 215, pages 115:1-115:22, 2022. URL: https://doi.org/10.4230/LIPIcs.ITCS.2022.115.
  38. Stanley M. Selkow. The tree-to-tree editing problem. Information Processing Letters, 6(6):184-186, 1977. URL: https://doi.org/10.1016/0020-0190(77)90064-3.
  39. Bruce A. Shapiro and Kaizhong Zhang. Comparing multiple RNA secondary structures using tree comparisons. Comput. Appl. Biosci., 6(4):309-318, 1990. URL: https://doi.org/10.1093/bioinformatics/6.4.309.
  40. Raghavendra Sridharamurthy, Talha Bin Masood, Adhitya Kamakshidasan, and Vijay Natarajan. Edit distance between merge trees. IEEE Trans. Vis. Comput. Graph., 26(3):1518-1531, 2020. URL: https://doi.org/10.1109/TVCG.2018.2873612.
  41. Kuo-Chung Tai. The tree-to-tree correction problem. J. ACM, 26(3):422-433, July 1979. URL: https://doi.org/10.1145/322139.322143.
  42. Hélène Touzet. A linear tree edit distance algorithm for similar ordered trees. In Proceedings of the 16th Annual Conference on Combinatorial Pattern Matching, CPM'05, pages 334-345, Berlin, Heidelberg, 2005. Springer-Verlag. URL: https://doi.org/10.1007/11496656_29.
  43. Esko Ukkonen. Algorithms for approximate string matching. Information and Control, 64(1):100-118, 1985. International Conference on Foundations of Computation Theory. URL: https://doi.org/10.1016/S0019-9958(85)80046-2.
  44. Yuan Wang, David J. DeWitt, and Jin-yi Cai. X-diff: An effective change detection algorithm for XML documents. In Umeshwar Dayal, Krithi Ramamritham, and T. M. Vijayaraman, editors, Proceedings of the 19th International Conference on Data Engineering, March 5-8, 2003, Bangalore, India, pages 519-530. IEEE Computer Society, 2003. URL: https://doi.org/10.1109/ICDE.2003.1260818.
  45. Michael S. Waterman. Introduction to computational biology - maps, sequences, and genomes: interdisciplinary statistics. CRC Press, 1995. Google Scholar
  46. R. Ryan Williams. Faster all-pairs shortest paths via circuit complexity. SIAM J. Comput., 47(5):1965-1985, 2018. URL: https://doi.org/10.1137/15M1024524.
  47. Yoshiyuki Yamamoto, Kouichi Hirata, and Tetsuji Kuboyama. Tractable and intractable variations of unordered tree edit distance. Int. J. Found. Comput. Sci., 25(3):307-330, 2014. URL: https://doi.org/10.1142/S0129054114500154.
  48. Xuchen Yao, Benjamin Van Durme, Chris Callison-Burch, and Peter Clark. Answer extraction as sequence tagging with tree edit distance. In Lucy Vanderwende, Hal Daumé III, and Katrin Kirchhoff, editors, Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics, Proceedings, June 9-14, 2013, Westin Peachtree Plaza Hotel, Atlanta, Georgia, USA, pages 858-867. The Association for Computational Linguistics, 2013. URL: https://aclanthology.org/N13-1106/.
  49. Kaizhong Zhang and Dennis E. Shasha. Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput., 18(6):1245-1262, 1989. URL: https://doi.org/10.1137/0218082.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact