Date: 29 Nov 2005

An improved algorithm for approximate string matching

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.

Work supported in part by NSF Grants CCR-86-05353 and CCR-88-14977