01
Suffix Trees and the Data Structure That Made Linear-Time String Indexing Possible
Suffix trees compact all suffixes of a string into one trie-like index, enabling linear preprocessing and pattern searches whose time depends on the query length rather than the text length.
↗