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.

Java Generalized Suffix Tree

Suffix trie for the string x = atatgtttgt$.

media./wp-content/uploads/pattern

Suffix Tree Application 1 - Substring Check - GeeksforGeeks

Suffix Array and Suffix Tree in Data Structures & Applications

Suffix tree for S = banana$ ($ denotes endof-string). Edge labels

Suffix Trees - Scaler Topics

Suffix Tree Application 2 - Searching All Patterns - GeeksforGeeks

Ukkonen's Suffix Tree Algorithm

Example of a generalized suffix tree.

Algorithms, Free Full-Text

Suffix Tree SpringerLink