Abstract
The suffix array of a string s of length n over the alphabet ∑ is the permutation that gives us the lexicographic order of all suffixes of s. This popular index can be used to solve many problems in sequence analysis. In practice, one limitation of this data structure is its size of n logn bits, while the size of the text is n log|∑| bits. For this reason compressed suffix arrays (CSAs) were introduced. The size of these CSAs is asymptotically less than or equal to the text size if the text is compressible, while maintaining O(log ε n) access time to the elements (0
Cite
CITATION STYLE
Gog, S. (2009). Broadword computing and fibonacci code speed up compressed suffix arrays. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5526 LNCS, pp. 161–172). https://doi.org/10.1007/978-3-642-02011-7_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
