chapter  9
28 Pages

Pattern Matching

The pattern matching problem is to find a given needle sequence p in a haystack sequence t, for example to determine where a string t contains the string p as a substring. There are several variants of this problem:

• Exact Matching: Find substrings p in t. See Section 9.1 for single searching needles, and Section 9.2 for searching multiple needles.