Fast compressed self-indexes with deterministic linear-time construction
Department of Computer Science
We introduce a compressed suffix array representation that, on a text T of length n over an alphabet of size σ, can be built in O(n) deterministic time, within O(n log σ) bits of working space, and counts the number of occurrences of any pattern P in T in time O(|P| + log logwσ) on a RAM machine of w = Ω (log n)-bit words. This time is almost optimal for large alphabets (log σ = 𝜣 (log n)), and it outperforms all the other compressed indexes that can be built in linear deterministic time, as well as some others. The only faster indexes can be built in linear time only in expectation, or require 𝜣(n log n) bits. For smaller alphabets, where log σ = o(log n), we show how, by using space proportional to a compressed representation of the text, we can build in linear time an index that counts in time O(|P|/ logσ + log∊σ n) for any constant ∊ > 0. This is almost RAM-optimal in the typical case where w = 𝜣(log n).
Munro, J. I.,
Fast compressed self-indexes with deterministic linear-time construction.
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/1345