A practical alphabet-partitioning rank/select data structure

DOI10.1007/978-3-030-32686-9_32MaRDI QIDQ6536272zbMATH OpenFDO

Authors Diego Arroyuelo, Erick Sepúlveda

Publication date 19 April 2024

Full work available at URL https://doi.org/10.1007/978-3-030-32686-9_32

Mathematics Subject Classification ID

Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Alphabet partitioning for compressed rank/select and applications
• Practical entropy-compressed rank/select dictionary
• Rank/select on dynamic compressed sequences and applications
• Rank and select revisited and extended
• Dynamic rank/select structures with applications to run-length encoded texts

Cites work

• Compressed representations of sequences and full-text indexes
• CSA++: Fast Pattern Search for Large Alphabets
• Efficient fully-compressed sequence representations
• scientific article; zbMATH DE number 2185599 (Why is no real title available?)
• scientific article; zbMATH DE number 2079421 (Why is no real title available?)
• On the Redundancy of Succinct Data Structures
• Optimal trade-offs for succinct string indexes
• Practical entropy-compressed rank/select dictionary
• Rank/select operations on large alphabets
• Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
• Wavelet trees for all

Cited in

(1)

• A Learned Approach to Design Compressed Rank/Select Data Structures

This page was built for publication: A practical alphabet-partitioning rank/select data structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536272)