Suffix tree
The suffix tree data structure was first described by E.M. McCreight in 1976. A suffix tree is similar to a trie where the paths between nodes without children have been merged into a single edge. Suffix trees are useful for string matching applications, such as those that arise when working with DNA sequences.
E.M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23:262-272, 1976.
E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249-260, September 1995.
