a data-structure that allows many problems on strings (sequences of characters) to be solved quickly

a data structure that encodes information about repetition within a textual string

a data structure with many applications in string processing

a data type that can be used for several things

a device that exposes the substring structure of a single

a member of the trie family

an efficient method for encoding the frequencies of motifs in a sequence

a path-compressed trie into which all suffixes of a string have been inserted

a Patricia tree corresponding to the suffixes of a given string

a trie data structure built over all the suffixes of the text

a trie like data structure that compactly represents a string by collapsing a series of nodes having one child to a single node whose parent edge is associated with a string

a trie that stores all the strings in a

In computer science, a suffix tree (also called PAT tree or, in an earlier form, position tree) is a certain data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many important string operations.