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, Algorithms, & Applications in Java Suffix Trees

Patterns, Suffix Tree - Coding Ninjas

Suffix tree library for c++ with simple examples how to use it

Fast Pattern Matching of Strings Using Suffix Tree in Java

Introducing suffix forest for mining tri-clusters from time-series data

Pattern Searching using a Trie of all Suffixes - GeeksforGeeks

PDF) The weighted suffix tree: an efficient data structure for

Suffix Tree for a Sliding Window: An Overview

Suffix Tree: Python Build & Application - Trie vs Array

PPT - Augmenting Suffix Trees, with Applications PowerPoint Presentation - ID:2914606

Untitled

后缀树- sangmado - 博客园

a) Example of original suffix tree. Building with the snippets set