Smith algorithm

(algorithm)

Definition: A string matching algorithm which computes the shift value for both the rightmost character of the window and the character preceding it, then uses the maximum of the two values.

Author: BB

Implementation

visualization and code (C)

More information

P. D. Smith, Experiments with a very fast substring search algorithm, Software Practice & Experience, 21(10):1065-1074, 1991.

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 17 December 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:
Bob Bockholt, "Smith algorithm", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/smithAlgorithm.html