{"paper":{"title":"Efficient Fully-Compressed Sequence Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francisco Claude, Gonzalo Navarro, Jeremy Barbay, Travis Gagie, Yakov Nekrich","submitted_at":"2009-11-25T23:31:23Z","abstract_excerpt":"We present a data structure that stores a sequence $s[1..n]$ over alphabet $[1..\\sigma]$ in $n\\Ho(s) + o(n)(\\Ho(s){+}1)$ bits, where $\\Ho(s)$ is the zero-order entropy of $s$. This structure supports the queries \\access, \\rank\\ and \\select, which are fundamental building blocks for many other compressed data structures, in worst-case time $\\Oh{\\lg\\lg\\sigma}$ and average time $\\Oh{\\lg \\Ho(s)}$. The worst-case complexity matches the best previous results, yet these had been achieved with data structures using $n\\Ho(s)+o(n\\lg\\sigma)$ bits. On highly compressible sequences the $o(n\\lg\\sigma)$ bits"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4981","kind":"arxiv","version":4},"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"}