When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2017.57
URN: urn:nbn:de:0030-drops-82328
URL: http://drops.dagstuhl.de/opus/volltexte/2017/8232/
 Go to the corresponding LIPIcs Volume Portal

### Fast Compressed Self-Indexes with Deterministic Linear-Time Construction

 pdf-format:

### Abstract

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(n\log\sigma) bits of working space, and counts the number of occurrences of any pattern P in T in time O(|P| + \log\log_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(n\log n) bits.

### BibTeX - Entry

@InProceedings{munro_et_al:LIPIcs:2017:8232,
author =	{J. Ian Munro and Gonzalo Navarro and Yakov Nekrich},
title =	{{Fast Compressed Self-Indexes with Deterministic Linear-Time Construction}},
booktitle =	{28th International Symposium on Algorithms and Computation (ISAAC 2017)},
pages =	{57:1--57:12},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-95977-054-5},
ISSN =	{1868-8969},
year =	{2017},
volume =	{92},
editor =	{Yoshio Okamoto and Takeshi Tokuyama},
publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},