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 and Suffix Array

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

Petro Protsyk personal page

Suffix tree - Gnarley trees visualization of algorithms and data

Suffix Tree Application 3 - Longest Repeated Substring - GeeksforGeeks

What is a Suffix Tree?. Lets discuss Suffix Trees in detail…, by Sushant Gaurav

PPT - Suffix tree and suffix array techniques for pattern analysis

Suffix Tree SpringerLink

An example of the suffix tree and the suffix array.

Data Structures, Algorithms, & Applications in Java Suffix Trees

Solved A suffix tree is a data structure that holds

Suffix Array and Suffix Tree in Data Structures & Applications

Understanding and Implementing Suffix Tree in JavaScript