We present a novel compressed suffix tree. Compared to the existing ones, ours is the first achieving at the same time sublogarithmic complexity for the ...
▻ For example, O(n/log logn) bits and o((log logn)2) time. J. Fischer, V. Mäkinen, G. Navarro. An(other) Entropy-Bounded Compressed Suffix Tree ...
The main idea is to sample some suffix tree nodes and use the compressed suffix array as a tool to find nearby sampled nodes. The most adequate compressed ...
This work presents a novel compressed suffix tree, which is the first achieving at the same time sublogarithmic complexity for the operations, ...
Suffix trees are one of the most important data structures in stringology, with myriads of applications in fluorishing areas like bioinformatics.
Abstract: Suffix trees are one of the most important data structures in stringology, with myriads of applications in fluorishing areas like bioinformatics.
Abouelhoda, M., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2(1), 53–86 (2004)
TL;DR: This work presents a novel compressed suffix tree, which is the first achieving at the same time sublogarithmic complexity for the operations, and space ...
We present a novel compressed suffix tree, which is the first achieving at the same time sublogarithmic complexity for the operations, and space usage that ...
People also ask
What is the difference between suffix tree and suffix trie?
What is a compressed trie for all the suffixes of a text string called?
What is a suffix tree used for?
What is the difference between suffix tree and array?
Our suffix tree is still orders of magnitude slower than general-purpose compressed suffix ... An(other) Entropy-Bounded Compressed Suffix Tree. June 2008. Veli ...