Corpus ID: 218665375

Edit Distance in Near-Linear Time: it's a Constant Factor

@article{Andoni2020EditDI,
title={Edit Distance in Near-Linear Time: it's a Constant Factor},
author={Alexandr Andoni and Negev Shekel Nosatzki},
journal={ArXiv},
year={2020},
volume={abs/2005.07678}
}
• Published 2020
• Mathematics, Computer Science
• ArXiv
• We present an algorithm for approximating the edit distance between two strings of length $n$ in time $n^{1+\epsilon}$, for any $\epsilon>0$, up to a constant factor. Our result completes the research direction set forth in the recent breakthrough paper [Chakraborty-Das-Goldenberg-Koucky-Saks, FOCS'18], which showed the first constant-factor approximation algorithm with a (strongly) sub-quadratic running time. Several recent results have shown near-linear complexity under different restrictions… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 33 REFERENCES

Approximating edit distance in near-linear time

• Computer Science, Mathematics
• STOC '09
• 2009

Simpler Constant-Factor Approximation to Edit Distance Problems

• Alex Andoni
• 2018

Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time

• Computer Science, Mathematics
• 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
• 2018

Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity

• Computer Science, Mathematics
• 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
• 2010

Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)

• Mathematics, Computer Science
• STOC '15
• 2015

Reducing approximate Longest Common Subsequence to approximate Edit Distance

• Mathematics, Computer Science
• SODA
• 2020

Constant factor approximations to edit distance on far input pairs in nearly linear time

• Mathematics, Computer Science
• STOC
• 2020

Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce

• Mathematics, Computer Science, Physics
• SODA
• 2018

The smoothed complexity of edit distance

• Mathematics, Computer Science
• TALG
• 2012

Approximating edit distance efficiently

• Mathematics, Computer Science
• 45th Annual IEEE Symposium on Foundations of Computer Science
• 2004