Results 181 to 190 of about 58,659 (213)
Some of the next articles are maybe not open access.
2014
The suffix tree is one of the oldest full-text inverted indexes and one of the most persistent subjects of study in the theory of algorithms. With extensions and refinements, including succinct and compressed variants that provide some of its expressive power in smaller space, it constitutes a fundamental conceptual tool in the design of string ...
Alberto Apostolico, Fabio Cunial
openaire +1 more source
The suffix tree is one of the oldest full-text inverted indexes and one of the most persistent subjects of study in the theory of algorithms. With extensions and refinements, including succinct and compressed variants that provide some of its expressive power in smaller space, it constitutes a fundamental conceptual tool in the design of string ...
Alberto Apostolico, Fabio Cunial
openaire +1 more source
Suffix cactus: A cross between suffix tree and suffix array
1995The suffix cactus is a new alternative to the suffix tree and the suffix array as an index of large static texts. Its size and its performance in searches lies between those of the suffix tree and the suffix array. Structurally, the suffix cactus can be seen either as a compact variation of the suffix tree or as an augmented suffix array.
openaire +1 more source
On the sorting-complexity of suffix tree construction
Journal of the ACM, 2000Martin Farach-Colton, Paolo Ferragina
exaly
Constructing suffix tree for gigabyte sequences with megabyte memory
IEEE Transactions on Knowledge and Data Engineering, 2005Jeffrey Yu
exaly
A suffix tree approach to anti-spam email filtering
Machine Learning, 2006Boris G Mirkin, Mark Levene
exaly