It 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. (http://en.wikipedia.org/wiki/Suffix_tree)
Suffix tree
#
Find similar titles
- (rev. 1)
- Hyungyong Kim