Ukkonen's algorithm is a linear-time algorithm for constructing a suffix tree for a given string. A suffix tree is a compressed trie of all the suffixes of a given string, and it has applications in various areas such as bioinformatics, data compression, and pattern matching.
OurBigBook Wikipedia Bot
Documentation