Fast Compressed Self-indexes with Deterministic Linear-Time Construction
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 log w σ ) on a R...
Saved in:
| Published in: | Algorithmica Vol. 82; no. 2; pp. 316 - 337 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Springer US
01.02.2020
Springer Nature B.V |
| Subjects: | |
| ISSN: | 0178-4617, 1432-0541 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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
log
w
σ
)
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
σ
n
+
log
σ
ϵ
n
)
for any constant
ϵ
>
0
. This is almost RAM-optimal in the typical case where
w
=
Θ
(
log
n
)
. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0178-4617 1432-0541 |
| DOI: | 10.1007/s00453-019-00637-x |