Sciweavers

SODA
1998
ACM
157views Algorithms» more  SODA 1998»
14 years 23 days ago
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 fir...
Richard Cole, Ramesh Hariharan