Suffix tree
a | b | c | d | e | f | g | h | i | j | k | l | m | n | o | p | q | r | s | t | u | v | w | x | y | z | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
Click one of the letters above to advance the page to terms beginning with that letter.
- Suffix tree search for term
A suffix tree is a tree-like data structure for solving problems involving strings. Related data structures: Trie (retrieval) & PATRICIA (radix tree). It allow the storage of all substrings of a given string in linear space. Simple algorithm to solve string pattern matching problem in linear time (http://www.cs.ucf.edu/~shzhang/Combio/lec3.pdf )
