Improved Dynamic Rank-Select Entropy-Bound Structures
DOI10.1007/978-3-540-78773-0_33zbMATH Open1136.68365OpenAlexW1551247056MaRDI QIDQ5458544FDOQ5458544
Authors: Rodrigo González, Gonzalo Navarro 
Publication date: 15 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.732
Recommendations
- Rank/select on dynamic compressed sequences and applications
- Dynamic rank/select structures with applications to run-length encoded texts
- Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts
- Optimal Dynamic Sequence Representations
- Dynamic entropy-compressed sequences and full-text indexes
Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cited In (12)
- Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts
- Dynamic Entropy-Compressed Sequences and Full-Text Indexes
- Extended suffix array construction using Lyndon factors
- A four-stage algorithm for updating a Burrows-Wheeler transform
- Dynamic entropy-compressed sequences and full-text indexes
- Dynamic extended suffix arrays
- Fast construction of wavelet trees
- Alphabet partitioning for compressed rank/select and applications
- Dynamic rank/select structures with applications to run-length encoded texts
- Rank/select on dynamic compressed sequences and applications
- Rank and select revisited and extended
- Practical entropy-compressed rank/select dictionary
This page was built for publication: Improved Dynamic Rank-Select Entropy-Bound Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458544)
