Document Open Access Logo

Hardness of Dynamic Tree Edit Distance and Friends

Authors Bingbing Hu , Jakob Nogler , Barna Saha

PDF

File

Thumbnail PDF
PDF
LIPIcs.ITCS.2026.78.pdf
  • Filesize: 1.22 MB
  • 26 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Dynamic graph algorithms
Keywords
  • fine-grained complexity
  • dynamic lower bounds
  • pattern matching

Metrics

Abstract

String Edit Distance is a more-than-classical problem whose behavior in the dynamic setting, where the strings are updated over time, is well studied. A single-character substitution, insertion, or deletion can be processed in time 𝒪̃(n w) when operation costs are positive integers bounded by w [Charalampopoulos, Kociumaka, Mozes, CPM 2020][Gorbachev, Kociumaka, STOC 2025]. If the weights are further uniform (insertions and deletions have equal cost), also an 𝒪̃(n √n)-update time algorithm exists [Charalampopoulos, Kociumaka, Mozes, CPM 2020]. This is a substantial improvement over the static 𝒪(n²) algorithm when w ≪ n or when we are dealing with uniform weights.
In contrast, for inherently related problems such as Tree Edit Distance, Dyck Edit Distance, and RNA Folding, it has remained unknown whether it is possible to devise dynamic algorithms with an advantage over the static algorithm. In this paper, we resolve this question by showing that (weighted) Tree Edit Distance, Dyck Edit Distance, and RNA Folding admit no dynamic speedup: under well-known fine-grained assumptions, we show that the best possible algorithm recomputes the solution from scratch after each update. Furthermore, we prove a quadratic per-update lower bound for unweighted Tree Edit Distance under the k-Clique Conjecture. This provides the first separation between dynamic unweighted String Edit Distance and unweighted Tree Edit Distance, problems whose relative difficulty in the static setting is still open.

Cite As Get BibTex

Bingbing Hu, Jakob Nogler, and Barna Saha. Hardness of Dynamic Tree Edit Distance and Friends. In 17th Innovations in Theoretical Computer Science Conference (ITCS 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 362, pp. 78:1-78:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.ITCS.2026.78

Author Details

Bingbing Hu
  • University of California San Diego, La Jolla, CA, USA
Jakob Nogler
  • Massachusetts Institute of Technology, Cambridge, MA, USA
Barna Saha
  • University of California San Diego, La Jolla, CA, USA

Funding

The authors are partially supported by NSF grants 1652303, 1909046, 2112533, and HDR TRIPODS Phase II grant 2217058.

References

  1. Amir Abboud, Arturs Backurs, and Virginia Vassilevska Williams. Tight hardness results for LCS and other sequence similarity measures. In Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS), pages 59-78, 2015. URL: https://doi.org/10.1109/FOCS.2015.14.
  2. Amir Abboud, Arturs Backurs, and Virginia Vassilevska Williams. If the current clique algorithms are optimal, so is Valiant’s parser. SIAM Journal on Computing, 47(6):2527-2555, 2018. URL: https://doi.org/10.1137/16M1061771.
  3. Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, and Raghu Meka. New graph decompositions and combinatorial boolean matrix multiplication algorithms. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, pages 935-943, New York, NY, USA, 2024. Association for Computing Machinery. URL: https://doi.org/10.1145/3618260.3649696.
  4. Amir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams, and Ryan Williams. Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made. In Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC), pages 375-388, 2016. URL: https://doi.org/10.1145/2897518.2897653.
  5. Amir Abboud and Virginia Vassilevska Williams. Popular conjectures imply strong lower bounds for dynamic problems. In Proceedings of the 55th Annual Symposium on Foundations of Computer Science (FOCS), 2014. Google Scholar
  6. Ittai Abraham, Shiri Chechik, and Sebastian Krinninger. Fully dynamic all-pairs shortest paths with worst-case update-time revisited. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '17, pages 440-452, USA, 2017. Society for Industrial and Applied Mathematics. URL: https://doi.org/10.1137/1.9781611974782.28.
  7. Alfred V. Aho and Thomas G Peterson. A minimum distance error-correcting parser for context-free languages. SIAM J. Comput., 1(4):305-312, 1972. URL: https://doi.org/10.1137/0201022.
  8. Josh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, and Renfei Zhou. More asymmetry yields faster matrix multiplication. In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), page to appear, 2025. Google Scholar
  9. Arturs Backurs and Piotr Indyk. Edit distance cannot be computed in strongly subquadratic time (unless SETH is false). In Proceedings of the 47th Annual ACM Symposium on Theory of Computing (STOC), pages 51-58, 2015. URL: https://doi.org/10.1145/2746539.2746612.
  10. Grey Ballard, James Demmel, Olga Holtz, and Oded Schwartz. Graph expansion and communication costs of fast matrix multiplication. J. ACM, 59(6), January 2013. URL: https://doi.org/10.1145/2395116.2395121.
  11. John Bellando and Ravi Kothari. Region-based modeling and tree edit distance as a basis for gesture recognition. In Proceedings of the 10th International Conference on Image Analysis and Processing (ICIAP), pages 698-703, 1999. URL: https://doi.org/10.1109/ICIAP.1999.797676.
  12. Mahdi Boroujeni, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, and Saeed Seddighin. 1+ε approximation of tree edit distance in quadratic time. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 709-720, 2019. URL: https://doi.org/10.1145/3313276.3316388.
  13. 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.
  14. Karl Bringmann, Fabrizio Grandoni, Barna Saha, and Virginia Vassilevska Williams. Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product. SIAM J. Comput., 48(2):481-512, 2019. URL: https://doi.org/10.1137/17M112720X.
  15. Karl Bringmann and Marvin Kunnemann. Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping . In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS), pages 79-97, Los Alamitos, CA, USA, October 2015. IEEE Computer Society. URL: https://doi.org/10.1109/FOCS.2015.15.
  16. Peter Buneman, Martin Grohe, and Christoph Koch. Path queries on compressed XML. In Proceedings of the 29th International Conference on Very Large Data Bases (VLDB), pages 141-152, 2003. URL: https://doi.org/10.1016/B978-012722442-8/50021-5.
  17. Alejandro Cassis, Tomasz Kociumaka, and Philip Wellnitz. Optimal algorithms for bounded weighted edit distance. In Proceedings of the 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pages 2177-2187, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00135.
  18. Yi-Jun Chang. Hardness of RNA Folding Problem With Four Symbols. In Roberto Grossi and Moshe Lewenstein, editors, 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), volume 54 of Leibniz International Proceedings in Informatics (LIPIcs), pages 13:1-13:12, Dagstuhl, Germany, 2016. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.CPM.2016.13.
  19. Panagiotis Charalampopoulos, Tomasz Kociumaka, and Shay Mozes. Dynamic String Alignment. In Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching (CPM), pages 9:1-9:13, 2020. URL: https://doi.org/10.4230/LIPIcs.CPM.2020.9.
  20. Sudarshan S. Chawathe. Comparing hierarchical data in external memory. In Proceedings of the 25th International Conference on Very Large Data Bases (VLDB), pages 90-101, 1999. URL: http://www.vldb.org/conf/1999/P8.pdf.
  21. Shiri Chechik and Tianyi Zhang. Faster deterministic worst-case fully dynamic all-pairs shortest paths via decremental hop-restricted shortest paths. In Nikhil Bansal and Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pages 87-99. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.CH4.
  22. Shucheng Chi, Ran Duan, and Tianle Xie. Faster algorithms for bounded-difference min-plus product. In Joseph (Seffi) Naor and Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pages 1435-1447. SIAM, 2022. URL: https://doi.org/10.1137/1.9781611977073.60.
  23. Shucheng Chi, Ran Duan, Tianle Xie, and Tianyi Zhang. Faster min-plus product for monotone instances. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 1529-1542, 2022. URL: https://doi.org/10.1145/3519935.3520057.
  24. Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, and Barna Saha. Weighted edit distance computation: Strings, trees, and Dyck. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, pages 377-390, New York, NY, USA, 2023. Association for Computing Machinery. URL: https://doi.org/10.1145/3564246.3585178.
  25. Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, and Hamed Saleh. Õ(n+poly(k))-time algorithm for bounded tree edit distance. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pages 686-697, 2022. URL: https://doi.org/10.1109/FOCS54457.2022.00071.
  26. Debarati Das, Jacob Gilbert, Tomasz Kociumaka, MohammadTaghi Hajiaghayi, and Barna Saha. Dynamic Dyck and tree edit distance: Decompositions and reductions to string edit distance. In Proceedings of the 66th IEEE Symposium on Foundations of Computer Science (FOCS) 2025, 2025. to appear. Google Scholar
  27. Debarati Das, Tomasz Kociumaka, and Barna Saha. Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding. In Mikołaj Bojańczyk, Emanuela Merelli, and David P. Woodruff, editors, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), volume 229 of Leibniz International Proceedings in Informatics (LIPIcs), pages 49:1-49:20, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ICALP.2022.49.
  28. 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.
  29. Camil Demetrescu and Giuseppe F. Italiano. Improved bounds and new trade-offs for dynamic all pairs shortest paths. In Peter Widmayer, Stephan Eidenbenz, Francisco Triguero, Rafael Morales, Ricardo Conejo, and Matthew Hennessy, editors, Automata, Languages and Programming, pages 633-643, Berlin, Heidelberg, 2002. Springer Berlin Heidelberg. URL: https://doi.org/10.1007/3-540-45465-9_54.
  30. Camil Demetrescu and Giuseppe F. Italiano. A new approach to dynamic all pairs shortest paths. In Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC '03, pages 159-166, New York, NY, USA, 2003. Association for Computing Machinery. URL: https://doi.org/10.1145/780542.780567.
  31. Bartłomiej Dudek and Paweł Gawrychowski. Online Context-Free Recognition in OMv Time. In Shunsuke Inenaga and Simon J. Puglisi, editors, 35th Annual Symposium on Combinatorial Pattern Matching (CPM 2024), volume 296 of Leibniz International Proceedings in Informatics (LIPIcs), pages 13:1-13:9, Dagstuhl, Germany, 2024. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.CPM.2024.13.
  32. Anita Dürr. Improved bounds for rectangular monotone min-plus product and applications. Inf. Process. Lett., 181(C), March 2023. URL: https://doi.org/10.1016/j.ipl.2023.106358.
  33. Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, and S. Muthukrishnan. Compressing and indexing labeled trees, with applications. J. ACM, 57(1):4:1-4:33, 2009. URL: https://doi.org/10.1145/1613676.1613680.
  34. Egor Gorbachev and Tomasz Kociumaka. Bounded edit distance: Optimal static and dynamic algorithms for small integer weights, 2025. URL: https://doi.org/10.48550/arXiv.2404.06401.
  35. Dan Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997. URL: https://doi.org/10.1017/CBO9780511574931.
  36. Maximilian Probst Gutenberg and Christian Wulff-Nilsen. Fully-dynamic all-pairs shortest paths: Improved worst-case time and space bounds. In Shuchi Chawla, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, pages 2562-2574. SIAM, 2020. URL: https://doi.org/10.1137/1.9781611975994.156.
  37. Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. Dynamic approximate all-pairs shortest paths: Breaking the o(mn) barrier and derandomization. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pages 538-547, 2013. URL: https://doi.org/10.1109/FOCS.2013.64.
  38. Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak. Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In Proceedings of the 47th Annual ACM on Symposium on Theory of Computing (STOC), 2015. Google Scholar
  39. Matthias Höchsmann, Thomas Töller, Robert Giegerich, and Stefan Kurtz. Local similarity in RNA secondary structures. In Proceedings of 2nd IEEE Computer Society Bioinformatics Conference (CSB), pages 159-168, 2003. URL: https://doi.org/10.1109/CSB.2003.1227315.
  40. Bingbing Hu, Jakob Nogler, and Barna Saha. Hardness of dynamic tree edit distance and friends, 2025. URL: https://arxiv.org/abs/2511.09842.
  41. Bingbing Hu and Adam Polak. Non-boolean OMv: One more reason to believe lower bounds for dynamic problems. In Anne Benoit, Haim Kaplan, Sebastian Wild, and Grzegorz Herman, editors, 33rd Annual European Symposium on Algorithms, ESA 2025, September 15-17, 2025, Warsaw, Poland, volume 351 of LIPIcs, pages 54:1-54:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. URL: https://doi.org/10.4230/LIPIcs.ESA.2025.54.
  42. Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, and Masayuki Takeda. Fully incremental lcs computation. In Proceedings of the 15th International Conference on Fundamentals of Computation Theory, FCT'05, pages 563-574, Berlin, Heidelberg, 2005. Springer-Verlag. URL: https://doi.org/10.1007/11537311_49.
  43. Sung-Ryul Kim and Kunsoo Park. A dynamic edit distance table. Journal of Discrete Algorithms, 2(2):303-312, 2004. Combinatiorial Pattern Matching. URL: https://doi.org/10.1016/S1570-8667(03)00082-0.
  44. V. King. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), pages 81-89, 1999. URL: https://doi.org/10.1109/SFFCS.1999.814580.
  45. Valerie King and Mikkel Thorup. A space saving trick for directed dynamic transitive closure and shortest path algorithms. In Jie Wang, editor, Computing and Combinatorics, pages 268-277, Berlin, Heidelberg, 2001. Springer Berlin Heidelberg. URL: https://doi.org/10.1007/3-540-44679-6_30.
  46. Philip N. Klein. Computing the edit-distance between unrooted ordered trees. In Proceedings of the 6th Annual European Symposium on Algorithms (ESA), pages 91-102, 1998. URL: https://doi.org/10.1007/3-540-68530-8_8.
  47. Philip N. Klein, Thomas B. Sebastian, and Benjamin B. Kimia. Shape matching using edit-distance: an implementation. In Proceedings of the 12th Annual Symposium on Discrete Algorithms (SODA), pages 781-790, 2001. URL: http://dl.acm.org/citation.cfm?id=365411.365779.
  48. Philip N. Klein, Srikanta Tirthapura, Daniel Sharvit, and Benjamin B. Kimia. A tree-edit-distance algorithm for comparing simple, closed shapes. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 696-704, 2000. URL: http://dl.acm.org/citation.cfm?id=338219.338628.
  49. Tomasz Kociumaka, Anish Mukherjee, and Barna Saha. Approximating Edit Distance in the Fully Dynamic Model. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pages 1628-1638, Los Alamitos, CA, USA, November 2023. IEEE Computer Society. URL: https://doi.org/10.1109/FOCS57990.2023.00098.
  50. Tomasz Kociumaka and Ali Shahali. Faster algorithm for bounded tree edit distance in the low-distance regime, 2025. To appear in the European Symposium on Algorithms (ESA 2025). URL: https://doi.org/10.48550/arXiv.2507.02701.
  51. Michal Koucký and Michael E. Saks. Simple, deterministic, fast (but weak) approximations to edit distance and dyck edit distance. In Nikhil Bansal and Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pages 5203-5219. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.CH188.
  52. Gad M. Landau, Eugene W. Myers, and Jeanette P. Schmidt. Incremental string comparison. SIAM J. Comput., 27(2):557-582, 1998. URL: https://doi.org/10.1137/S0097539794264810.
  53. Kasper Green Larsen and Ryan Williams. Faster online matrix-vector multiplication. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '17, pages 2182-2189, USA, 2017. Society for Industrial and Applied Mathematics. URL: https://doi.org/10.1137/1.9781611974782.142.
  54. Xiao Mao. Breaking the cubic barrier for (unweighted) tree edit distance. In Proceedings of the 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 792-803, 2022. URL: https://doi.org/10.1109/FOCS52979.2021.00082.
  55. Xiao Mao. Fully dynamic all-pairs shortest paths: Likely optimal worst-case update time. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, pages 1141-1152, New York, NY, USA, 2024. Association for Computing Machinery. URL: https://doi.org/10.1145/3618260.3649695.
  56. Saul B. Needleman and Christian D. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48(3):443-453, March 1970. URL: https://doi.org/10.1016/0022-2836(70)90057-4.
  57. 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 Proceedings of the 57th Annual ACM Symposium on Theory of Computing, STOC '25, pages 2167-2178, New York, NY, USA, 2025. Association for Computing Machinery. URL: https://doi.org/10.1145/3717823.3718116.
  58. Ruth Nussinov and Ann B. Jacobson. Fast algorithm for predicting the secondary structure of single-stranded RNA. Proc. Natl. Acad. Sci. U.S.A., 77(11):6309-6313, 1980. Google Scholar
  59. Liam Roditty and Roei Tov. Approximating the girth. ACM Trans. Algorithms, 9(2), March 2013. URL: https://doi.org/10.1145/2438645.2438647.
  60. Barna Saha. The Dyck language edit distance problem in near-linear time. In Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS), pages 611-620, 2014. URL: https://doi.org/10.1109/FOCS.2014.71.
  61. Barna Saha. Language edit distance and maximum likelihood parsing of stochastic grammars: Faster algorithms and connection to fundamental graph problems. In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pages 118-135, 2015. URL: https://doi.org/10.1109/FOCS.2015.17.
  62. 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.
  63. Masoud Seddighin and Saeed Seddighin. 3+ε approximation of tree edit distance in truly subquadratic time. In Proceedings of the 13th Innovations in Theoretical Computer Science Conference (ITCS), pages 115:1-115:22, 2022. URL: https://doi.org/10.4230/LIPIcs.ITCS.2022.115.
  64. Peter H. Sellers. On the theory and computation of evolutionary distances. SIAM Journal on Applied Mathematics, 26(4):787-793, 1974. URL: https://doi.org/10.1137/0126070.
  65. Bruce A. Shapiro and Kaizhong Zhang. Comparing multiple RNA secondary structures using tree comparisons. Bioinformatics, 6(4):309-318, October 1990. URL: https://doi.org/10.1093/bioinformatics/6.4.309.
  66. Volker Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13(4):354-356, 1969. URL: https://doi.org/10.1007/BF02165411.
  67. Kuo-Chung Tai. The tree-to-tree correction problem. J. ACM, 26(3):42-433, July 1979. URL: https://doi.org/10.1145/322139.322143.
  68. Mikkel Thorup. Fully-dynamic all-pairs shortest paths: Faster and allowing negative cycles. In Torben Hagerup and Jyrki Katajainen, editors, Algorithm Theory - SWAT 2004, pages 384-396, Berlin, Heidelberg, 2004. Springer Berlin Heidelberg. URL: https://doi.org/10.1007/978-3-540-27810-8_33.
  69. Mikkel Thorup. Worst-case update times for fully-dynamic all-pairs shortest paths. In Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC '05, pages 112-119, New York, NY, USA, 2005. Association for Computing Machinery. URL: https://doi.org/10.1145/1060590.1060607.
  70. Alexander Tiskin. Semi-local string comparison: Algorithmic techniques and applications. Mathematics in Computer Science, 1(4):571-603, 2008. URL: https://doi.org/10.1007/s11786-007-0033-3.
  71. Virginia Vassilevska Williams. On some fine-grained questions in algorithms and complexity, pages 3447-3487. World Scientific, 2018. URL: https://doi.org/10.1142/9789813272880_0188.
  72. Virginia Vassilevska Williams and R. Ryan Williams. Subcubic equivalences between path, matrix, and triangle problems. J. ACM, 65(5):1-38, 2018. URL: https://doi.org/10.1145/3186893.
  73. Virginia Vassilevska Williams and Yinzhan Xu. Truly subcubic min-plus product for less structured matrices, with applications. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 12-29, 2020. URL: https://doi.org/10.1137/1.9781611975994.2.
  74. Balaji Venkatachalam, Dan Gusfield, and Yelena Frid. Faster algorithms for RNA-folding using the four-russians method. Algorithms for molecular biology : AMB, 9:5, March 2014. URL: https://doi.org/10.1186/1748-7188-9-5.
  75. T. K. Vintsyuk. Speech discrimination by dynamic programming. Cybernetics, 4(1):52-57, 1968. URL: https://doi.org/10.1007/BF01074755.
  76. Robert A. Wagner and Michael J. Fischer. The string-to-string correction problem. J. ACM, 21(1):168-173, January 1974. URL: https://doi.org/10.1145/321796.321811.
  77. Michael S. Waterman. Introduction to computational biology: maps, sequences and genomes. CRC Press, 1995. Google Scholar
  78. Kaizhong Zhang and Dennis 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.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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