Sublinear algorithms for gap edit distance

DOI10.1109/FOCS.2019.00070MaRDI QIDQ6944167zbMATH OpenFDO

Authors Robert Krauthgamer, Elazar Goldenberg, Barna Saha

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2019.00070

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(5)

• Approximation algorithms for LCS and LIS with truly improved running times
• An improved sketching algorithm for edit distance
• A linear-time \(n^{0.4}\)-approximation for longest common subsequence
• Range counting oracles for geometric problems
• Edit distance in near-linear time: it's a constant factor

This page was built for publication: Sublinear algorithms for gap edit distance

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