Rabin and Karp proposed a string matching algorithm that performs well in practice and that also generalizes to other algorithms for related problems, such as two-dimensional pattern matching.

• The Rabin-Karp string matching algorithm calculates a hash value for the pattern, as well as for each M-character subsequence of given text …