✳flâneur — a map of the web's best reading

Notes - Suffix Tree

visualgo.net · 1,589 words · saved by 1 readers

A Suffix Tree is a compressed tree containing all the suffixes of the given (usually long) text string T of length n characters (n can be in order of hundred thousands characters).

Notes - Suffix Tree Suffix Tree 1. Introduction A Suffix Tree is a compressed tree containing all the suffixes of the given (usually long) text string T of length n characters ( n can be on order of hundred thousands of characters). The positions of each suffix in the text string T are recorded as integer indices at the leaves of the Suffix Tree whereas the path labels (concatenation of edge labels starting from the root) of the leaves describe the suffixes. Suffix Tree provides a particularly fast implementation for many important (long) string operations. This data structure is very related

Explore this link on the map →

saved by

related reading