Dynamic Entropy-Compressed Sequences and Full-Text Indexes

DOI10.1007/11780441_28MaRDI QIDQ5307515zbMATH OpenOpenAlexFDO

Authors Veli Mäkinen, Gonzalo Navarro

Publication date 14 September 2007

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

Full work available at URL https://doi.org/10.1007/11780441_28

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

• Dynamic entropy-compressed sequences and full-text indexes
• Compressed representations of sequences and full-text indexes
• Improved Dynamic Rank-Select Entropy-Bound Structures
• Rank/select on dynamic compressed sequences and applications
• Compressed Data Structures for Dynamic Sequences

Cited in

(12)

• Extended suffix array construction using Lyndon factors
• High-order entropy compressed bit vectors with rank/select
• Geometric BWT: compressed text indexing via sparse suffixes and range searching
• Rank and select revisited and extended
• Compressed representations of sequences and full-text indexes
• Compressed Data Structures for Dynamic Sequences
• Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts
• Approximate all-pairs suffix/prefix overlaps
• Dynamic entropy-compressed sequences and full-text indexes
• Statistical Encoding of Succinct Data Structures
• Dynamic rank/select structures with applications to run-length encoded texts
• Optimal prefix and suffix queries on texts

This page was built for publication: Dynamic Entropy-Compressed Sequences and Full-Text Indexes

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