A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
RLE Edit Distance in Near Optimal Time
2019
International Symposium on Mathematical Foundations of Computer Science
We show that the edit distance between two run-length encoded strings of compressed lengths m and n respectively, can be computed in O(mn log(mn)) time. This improves the previous record by a factor of 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. ACM Subject Classification Theory of computation → Design and analysis
doi:10.4230/lipics.mfcs.2019.66
dblp:conf/mfcs/CliffordGKMU19
fatcat:pu6uwgwtkzfntlfm6jiq3lm3r4