{"paper":{"title":"Linear time construction of compressed text indices in compact space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui","submitted_at":"2014-01-05T20:26:13Z","abstract_excerpt":"We show that the compressed suffix array and the compressed suffix tree for a string of length $n$ over an integer alphabet of size $\\sigma\\leq n$ can both be built in $O(n)$ (randomized) time using only $O(n\\log\\sigma)$ bits of working space. The previously fastest construction algorithms that used $O(n\\log\\sigma)$ bits of space took times $O(n\\log\\log\\sigma)$ and $O(n\\log^{\\epsilon}n)$ respectively (where $\\epsilon$ is any positive constant smaller than $1$). In the passing, we show that the Burrows-Wheeler transform of a string of length $n$ over an alphabet of size $\\sigma$ can be built in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0936","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}