In
computer science, a
suffix tree (also called
PAT tree or, in an earlier form,
position tree) is a compressed
trie containing all the
suffixes of the given text as their keys and positions in the text as their values. Suffix trees allow particularly fast implementations of many important string operations.