Statistical Encoding of Succinct Data Structures

DOI10.1007/11780441_27MaRDI QIDQ5307514zbMATH OpenOpenAlexFDO

Authors Rodrigo González, 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_27

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

• Compressed representations of sequences and full-text indexes
• scientific article; zbMATH DE number 2230164
• A simple storage scheme for strings achieving entropy bounds
• Combinatorial Pattern Matching
• Dynamic Entropy-Compressed Sequences and Full-Text Indexes

Cited in

(8)

• Can we locally compute sparse connected subgraphs?
• Random access to high-order entropy compressed text
• A simple storage scheme for strings achieving entropy bounds
• Efficient fully-compressed sequence representations
• Optimal indexes for sparse bit vectors
• Entropy lower bounds for dictionary compression
• Encoding data structures
• Wee LCP

This page was built for publication: Statistical Encoding of Succinct Data Structures

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