Unit SS, Part B: String Matching, Karp-Rabin

• Compute signature fn of each possible m- character substring, compare with pat's signature, re-check strings to be sure (false matches are very rare)
• Could thus pre-process text if have many searches
• Signature at position i given ito signature at position i-1