Polylogarithmic approximation for edit distance and the asymmetric query complexity

DOI10.1109/FOCS.2010.43MaRDI QIDQ6990310zbMATH OpenFDO

Authors Robert Krauthgamer, Alexandr Andoni, Krzysztof Onak

Publication date 29 April 2025

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

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(7)

• Internal pattern matching in small space and applications
• Approximation algorithms for LCS and LIS with truly improved running times
• Approximating dynamic time warping distance between run-length encoded strings
• An improved sketching algorithm for edit distance
• Faster algorithms for bounded tree edit distance
• Improved approximation for longest common subsequence over small alphabets
• A linear-time \(n^{0.4}\)-approximation for longest common subsequence

This page was built for publication: Polylogarithmic approximation for edit distance and the asymmetric query complexity

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