Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts

DOI10.1007/978-3-540-73437-6_12MaRDI QIDQ3506912zbMATH OpenOpenAlexFDO

Authors Sunho Lee, Kunsoo Park

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73437-6_12

Mathematics Subject Classification ID

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

Recommendations

• Dynamic rank/select structures with applications to run-length encoded texts
• Rank/select on dynamic compressed sequences and applications
• An Opportunistic Text Indexing Structure Based on Run Length Encoding
• Improved Dynamic Rank-Select Entropy-Bound Structures
• Practical entropy-compressed rank/select dictionary
• Optimal rank and select queries on dictionary-compressed text
• Two conjectures about recency rank encoding
• Dynamic Entropy-Compressed Sequences and Full-Text Indexes

Cited in

(11)

• Approximate string matching with compressed indexes
• Fast compressed self-indexes with deterministic linear-time construction
• Rank and select revisited and extended
• An Opportunistic Text Indexing Structure Based on Run Length Encoding
• Fast construction of wavelet trees
• Compressed Data Structures for Dynamic Sequences
• An Online Algorithm for Finding the Longest Previous Factors
• Faster practical block compression for rank/select dictionaries
• Improved Dynamic Rank-Select Entropy-Bound Structures
• Dynamic rank/select structures with applications to run-length encoded texts
• Rank/select on dynamic compressed sequences and applications

This page was built for publication: Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts

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