Improved Algorithms for Edit Distance and LCS: Beyond Worst Case

DOI10.1137/1.9781611975994.99OpenAlexW2998685384MaRDI QIDQ5146877

Mahdi Safarnejad Boroujeni, Saeed Seddighin, Masoud Seddighin

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975994.99

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier

This page was built for publication: Improved Algorithms for Edit Distance and LCS: Beyond Worst Case