String data structures

computer science term: compressed trie containing all the suffixes of the given text

data structure that represents a space-optimized trie in which each node that is the only child is merged with its parent

computer science term: sorted array of all suffixes of a string

character string terminated by the null byte (0x00); used in e.g. the C programming language

computer data structure that represents a finite set of strings

data structure representing a long string as a tree of separate substrings to permit efficient random insertions and deletions

auxiliary data structure to the suffix array

succinct data structure

dynamic array data structure