Why it matters

Suffix trees are powerful. Memory heavy; suffix arrays preferred.

Advertisement

The architecture

Compressed trie.

Ukkonen O(n) build.

Many queries in O(m).

Suffix tree structureCompressed trieof all suffixesUkkonenO(n) buildQueriesmany in O(m)Ukkonen 1995 linear-time; memory 15-30x string; SA + LCP often preferred
Suffix tree structure.
Advertisement

How it works end to end

Ukkonen 1995.

Memory 15-30x string.

Many query types.