Suffix Tree Data Structure

Suffix trees are a compressed version of the trie that includes all of a string's suffixes. It can be used to solve many string problems that occur in text editing, free-text searches, etc. Some popular applications of suffix trees are string search, finding the longest repeated substring, finding the longest common substring, data compression, etc.

Suffix tree - Wikipedia

Data Structures

Ukkonen's Suffix Tree Algorithm (Python, C++ & Java code)

Advanced Data Structures, Suffix Tree

Fast Pattern Matching of Strings Using Suffix Tree in Java

Ukkonen's Suffix Tree Algorithm (Python, C++ & Java code)

Algorithms, Free Full-Text

a) Example of original suffix tree. Building with the snippets set

Ukkonen's Suffix Tree Algorithm (Python, C++ & Java code)

What is a Suffix Tree?. Lets discuss Suffix Trees in detail…