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.

Data Structures

Suffix Tree Data Structure

Suffix tree - Gnarley trees visualization of algorithms and data

Ukkonen's Suffix Tree Algorithm

Suffix Tries

Suffix Tree for a Sliding Window: An Overview

5 Text Processing

Suffix tries and trees

Suffix Trees by Bryan Camacho on Prezi

Generalized Suffix Tree - GeeksforGeeks

Petro Protsyk personal page

Alex Xu on X: What are some of the most common data structures

Suffix Tree Application 2 - Searching All Patterns - GeeksforGeeks

Enhanced Document Retrieval System Using Suffix Tree Clustering Algorithm