2026-07-21T12:47:33Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:8232 2024-03-06T10:41:53Z ddc:004 open_access

Fast Compressed Self-Indexes with Deterministic Linear-Time Construction Munro, J. Ian Navarro, Gonzalo Nekrich, Yakov Succinct data structures Self-indexes Suffix arrays Deterministic construction 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik J. Ian Munro and Gonzalo Navarro and Yakov Nekrich 2017 Is Part Of LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ISAAC.2017.57 urn:nbn:de:0030-drops-82328 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.57 eng https://creativecommons.org/licenses/by/3.0/legalcode