(algorithm)
Definition: Beginning with the (leftmost) position in a string and trying each position in turn, find the number of characters for which the pattern and the substring beginning at that position don't match (the Hamming distance). Return the first position with k or fewer mismatches.
Generalization (I am a kind of ...)
string matching with mismatches, brute force string search.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 13 December 2004.
HTML page formatted Mon Sep 11 09:46:01 2006.
Cite this as:
Paul E. Black, "brute force string search with mismatches", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 13 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/bruteForceStrSrchwMismatch.html