(algorithm)
Definition: A string matching algorithm that compares string's hash values, rather than the strings themselves. For efficiency, the hash value of the next position in the text is easily computed from the hash value of the current position.
Also known as Rabin-Karp.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 28 February 2005.
HTML page formatted Mon Sep 11 09:46:04 2006.
Cite this as:
Paul E. Black, "Karp-Rabin", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 28 February 2005. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/karpRabin.html