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.
Some BioInformatics: Suffix Tree Construction and the Longest
What is a Suffix Tree?. Lets discuss Suffix Trees in detail…
media./wp-content/uploads/pattern
GitHub - aziztitu/suffix-tree-demo: A simple implementation of
Suffix Tree and Suffix Array
Suffix Trees Tutorials & Notes, Data Structures
Suffix Tries
5 Text Processing
Counter based suffix tree for DNA pattern repeats - ScienceDirect
Parallel Generalized Suffix Tree Construction for Genomic Data
后缀树- sangmado - 博客园
Fast Pattern Matching of Strings Using Suffix Tree in Java
