Approximate String Matching: A Simpler Faster Algorithm

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 m +n+m) on all patterns except k-break periodic strings (defined later). The second algorithm runs in time O( nk4 m + n + m) on k-break periodic patterns. The two classes of patterns are easily distinguished in O(m) time. Key words. algorithms, string matching, edit distance AMS subject classification. 68W40 PII. S0097539700370527

• Type: Conference
• Year: 1998
• Where: SODA
• Authors: Richard Cole, Ramesh Hariharan
• Keywords: Algorithms, Edit Distance, K-break Periodic Strings, Matching Text Substring, SODA 1998