Abstract

Abstract. We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The first algorithm, which is quite simple, runs in time O ( nk3 + n + m) on all patterns except k-break periodic m strings (defined later). The second algorithm runs in time O ( nk4 + n + m) onk-break periodic m patterns. The two classes of patterns are easily distinguished in O(m) time.

Citations