An improved algorithm for approximate string matching
Given a text string, a pattern string, and an integer k, a new algorithm for finding all occurrences of the pattern string in the text string with at most k differences is presented. Both its theoretical and practical variants improve the known algorithms.
Unable to display preview. Download preview PDF.
- Landau, G. M., and Vishkin, U. Fast parallel and serial approximate string matching. Journal of Algorithms 10 (1989).Google Scholar
- Lowrance, R., and Wagner, R. A. An extension of the string-to-string correction problem. J. Assoc. Comput. Mach. 22 (1975), 177–183.Google Scholar
- Wagner, R. A., and Fischer, M. J. The string-to-string correction problem. J. Assoc. Comput. Mach. 21 (1974), 168–173.Google Scholar