A practical alphabet-partitioning rank/select data structure
From MaRDI portal
Publication:6536272
DOI10.1007/978-3-030-32686-9_32zbMATH Open1539.68081MaRDI QIDQ6536272
Erick Sepúlveda, Diego Arroyuelo
Publication date: 19 April 2024
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient fully-compressed sequence representations
- Wavelet trees for all
- Compressed representations of sequences and full-text indexes
- On the Redundancy of Succinct Data Structures
- Rank/select operations on large alphabets
- Optimal Trade-Offs for Succinct String Indexes
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- CSA++: Fast Pattern Search for Large Alphabets
- Practical Entropy-Compressed Rank/Select Dictionary
This page was built for publication: A practical alphabet-partitioning rank/select data structure
