We show how to determine whether the edit distance between two given strings is small in sublinear time. Specifically, we present a test which, given two n-character strings A and...
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...