We introduce a compressed suffix array representation that, on a text T of length n over an alphabet of size sigma, can be built in O(n) deterministic time, within O(nlogsigma) bits of working space, and counts the number of occurrences of any pattern P in T in time O(|P| + loglog_w sigma) on a RAM machine of w=Omega(log n)-bit words. This new index outperforms all the other compressed indexes that can be built in linear deterministic time, and some others. The only faster indexes can be built in linear time only in expectation, or require Theta(nlog n) bits.
展开▼
