Online Algorithms for Constructing Linear-size Suffix Trie

Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga

The suffix trees are fundamental data structures for various kinds of string processing. The suffix tree of a string $T$ of length $n$ has $O(n)$ nodes and edges, and the string la…