A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is application/pdf
.
Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime
[article]
2023
arXiv
pre-print
We revisit the task of computing the edit distance in sublinear time. In the (k,K)-gap edit distance problem the task is to distinguish whether the edit distance of two strings is at most k or at least K. It has been established by Goldenberg, Krauthgamer and Saha (FOCS '19), with improvements by Kociumaka and Saha (FOCS '20), that the (k,k^2)-gap problem can be solved in time O(n/k+poly(k)). One of the most natural questions in this line of research is whether the (k,k^2)-gap is best-possible
arXiv:2202.08066v2
fatcat:5f67c5q3g5g3vk7bhis4wllqfm