# RLE edit distance in near optimal time

@article{Clifford2019RLEED,
title={RLE edit distance in near optimal time},
author={R. Clifford and Pawel Gawrychowski and Tomasz Kociumaka and D. Martin and P. Uznanski},
journal={ArXiv},
year={2019},
volume={abs/1905.01254}
}
• R. Clifford, +2 authors P. Uznanski
• Published 2019
• Mathematics, Computer Science
• ArXiv
• We show that the edit distance between two run-length encoded strings of compressed lengths $m$ and $n$ respectively, can be computed in $\mathcal{O}(mn\log(mn))$ time. This improves the previous record by a factor of $\mathcal{O}(n/\log(mn))$. The running time of our algorithm is within subpolynomial factors of being optimal, subject to the standard SETH-hardness assumption. This effectively closes a line of algorithmic research first started in 1993.
1 Citations

#### References

SHOWING 1-10 OF 17 REFERENCES
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False)
• Mathematics, Computer Science
• SIAM J. Comput.
• 2018
• 83
• Highly Influential
• PDF
A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings
• Kuan-Yu Chen
• Computer Science
• Algorithmica
• 2011
• 11
• Highly Influential
An Improved Algorithm for Computing the Edit Distance of Run-Length Coded Strings
• Mathematics, Computer Science
• Inf. Process. Lett.
• 1995
• 67
Edit distance for a run-length-encoded string and an uncompressed string
• Mathematics, Computer Science
• Inf. Process. Lett.
• 2007
• 16
A Faster Algorithm Computing String Edit Distances
• Computer Science, Mathematics
• J. Comput. Syst. Sci.
• 1980
• 665
Edit distance of run-length encoded strings
• Mathematics, Computer Science
• Inf. Process. Lett.
• 2002
• 41
• PDF
Matching for Run-Length Encoded Strings
• Computer Science, Mathematics
• J. Complex.
• 1999
• 68
• PDF
Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping
• Mathematics, Computer Science
• 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
• 2015
• 172
• Highly Influential
• PDF