{"paper":{"title":"Run Compressed Rank/Select for Large Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dmitry Kosolobov, Jos\\'e Fuentes-Sep\\'ulveda, Juha K\\\"arkk\\\"ainen, Simon J. Puglisi","submitted_at":"2017-11-08T12:01:47Z","abstract_excerpt":"Given a string of length $n$ that is composed of $r$ runs of letters from the alphabet $\\{0,1,\\ldots,\\sigma{-}1\\}$ such that $2 \\le \\sigma \\le r$, we describe a data structure that, provided $r \\le n / \\log^{\\omega(1)} n$, stores the string in $r\\log\\frac{n\\sigma}{r} + o(r\\log\\frac{n\\sigma}{r})$ bits and supports select and access queries in $O(\\log\\frac{\\log(n/r)}{\\log\\log n})$ time and rank queries in $O(\\log\\frac{\\log(n\\sigma/r)}{\\log\\log n})$ time. We show that $r\\log\\frac{n(\\sigma-1)}{r} - O(\\log\\frac{n}{r})$ bits are necessary for any such data structure and, thus, our solution is succin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02910","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"}