# 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} }

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