no code implementations • 24 Jul 2020 • Tomasz Kociumaka, Barna Saha
For the gap edit distance problem, we give a greedy algorithm that distinguishes in time $\tilde{O}(\frac{n}{k}+k^2)$ between length-$n$ input strings with edit distance at most $k$ and those with edit distance more than $4k^2$.
Data Structures and Algorithms