| Information | |
|---|---|
| has gloss | eng: A generalised suffix tree is a suffix tree for a set of strings. Given the set of strings D=S_1,S_2,\dots,S_d of total length n, it is a Patricia trie containing all n suffixes of the strings. It is mostly used in bioinformatics. |
| lexicalization | eng: generalised suffix tree |
| instance of | c/Algorithms on strings |
| Media | |
|---|---|
| media:img | Suffix tree ABAB BABA.svg |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint
