Alphabet Partitioning for Compressed Rank/Select and Applications

DOI10.1007/978-3-642-17514-5_27zbMath1310.68060OpenAlexW1828691170MaRDI QIDQ3060784

Jérémy Barbay, Travis Gagie, Yakov Nekrich, Gonzalo Navarro

Publication date: 9 December 2010

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17514-5_27

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items (20)

Engineering a lightweight external memory suffix array construction algorithm ⋮ Compressed Data Structures for Dynamic Sequences ⋮ Random access to Fibonacci encoded files ⋮ A space efficient direct access data structure ⋮ Succinct encoding of binary strings representing triangulations ⋮ Compact binary relation representations with rich functionality ⋮ Colored range queries and document retrieval ⋮ Compact representation of graphs with bounded bandwidth or treedepth ⋮ On compressing permutations and adaptive sorting ⋮ Top-\(k\) document retrieval in optimal space ⋮ Wavelet trees for all ⋮ Optimal skeleton and reduced Huffman trees ⋮ Optimal Skeleton Huffman Trees ⋮ LRM-trees: compressed indices, adaptive sorting, and compressed permutations ⋮ New space/time tradeoffs for top-\(k\) document retrieval on sequences ⋮ Distribution-aware compressed full-text indexes ⋮ Compact representation of graphs of small clique-width ⋮ Accelerated partial decoding in wavelet trees ⋮ General Document Retrieval in Compact Space ⋮ Space-efficient substring occurrence estimation

This page was built for publication: Alphabet Partitioning for Compressed Rank/Select and Applications