Generalized suffix tree

not shown.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

not shown. In computer science, a generalized 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 tree containing all n suffixes of the strings. It is mostly used in bioinformatics.

not shown.]] In computer science, a generalized 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 tree containing all n suffixes of the strings. It is mostly used in bioinformatics.

References

-->

A C implementation of Generalized Suffix Tree for two strings

Text derived from https://en.wikipedia.org/w/index.php?oldid=1283425883 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.