Suffix Tree Search
Suffix Tree Search Suffix tree search finds whether a pattern occurs in a text by traversing a compressed trie of all suffixes of the text. A suffix tree stores every suffix of a string. Each edge represents a substring of the original text. This allows pattern matching in time proportional to the pattern length, independent of the text size. Problem Given a suffix tree built from a text $T$ and...