NIST

string matching with mismatches

(algorithm)

Definition: The special case of string matching with errors where mismatches are the only type of error allowed.

Generalization (I am a kind of ...)
string matching with errors.

Specialization (... is a kind of me.)
brute force string search with mismatches.

Note: From Algorithms and Theory of Computation Handbook, page 13-17, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.

Author: CRC-A


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 13 December 2004.
HTML page formatted Mon Feb 2 13:10:40 2015.

Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "string matching with mismatches", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 13 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/stringMatchwMismatch.html