Improved Algorithms for Edit Distance and LCS: Beyond Worst Case

DOI10.1137/1.9781611975994.99MaRDI QIDQ5146877zbMATH OpenOpenAlexFDO

Authors Mahdi Safarnejad Boroujeni, Masoud Seddighin, S. 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)

Cited in

(4)

• Approximating longest common subsequence in linear time: beating the \(\sqrt{n}\) barrier
• Indexed dynamic programming to boost edit distance and LCSS computation
• An improved sketching algorithm for edit distance
• Edit distance in near-linear time: it's a constant factor

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146877)