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 SpringerLink

A fully-dynamic data structure for external substring search

GitHub - ApurvPatki1703/Tries: This is implementation of Trie, Suffix tree data structure. This code is an implementation of the data structures on the lines of lecture by Robert Sedgewick in the course

Data Structures: Powering Your Database Performance

string - What is a generalized suffix tree? - Stack Overflow

Suffix Trees - Scaler Topics

Untitled

Suffix Tree Data Structure

Suffix Tree: Python Build & Application - Trie vs Array

Trie, Suffix Tree, Suffix Array

Trie, Suffix Tree, Suffix Array

Patterns, Suffix Tree - Coding Ninjas