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
We consider the approximate pattern matching problem under the edit distance. Given a text T of length n, a pattern P of length m, and a threshold k, the task is to find the starting positions of all substrings of T that can be transformed to P with at most k edits. More than 20 years ago, Cole and Hariharan [SODA'98, J. Comput.'02] gave an 𝒪(n+k^4 · n/ m)-time algorithm for this classic problem, and this runtime has not been improved since. Here, we present an algorithm that runs in timearXiv:2204.03087v1 fatcat:wgqepmoesna7fbhlchkp6m6tna