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.

Parallel Generalized Suffix Tree Construction for Genomic Data

Suffix Trees - Scaler Topics

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

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

Suffix Tree-Ukkonen's Algorithm - Coding Ninjas

A fully-dynamic data structure for external substring search

Full article: Creating improvisations on chord progressions using suffix trees

Suffix trees: basic queries

Some BioInformatics: Suffix Tree Construction and the Longest

Suffix Tree: Python Build & Application - Trie vs Array

A suffix tree that represents the sequence 'BANANA'. The beginning