Simple Random Access Compression

DOI10.3233/FI-2009-0066MaRDI QIDQ3635991zbMATH OpenOpenAlexFDO

Authors Kimmo Fredriksson, Fedor Nikitin

Publication date 30 June 2009

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2009-0066

zbMATH Keywords

full-text indexingsuccinct data structuresstring matchingtext compression

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

• Simple Compression Code Supporting Random Access and Fast String Matching
• Compressed representations of sequences and full-text indexes
• scientific article; zbMATH DE number 2079421
• Random access to high-order entropy compressed text
• CRAM: compressed random access memory

Cited in

(9)

• Relative Lempel-Ziv with constant-time random access
• scientific article; zbMATH DE number 1421009 (Why is no real title available?)
• Simple Compression Code Supporting Random Access and Fast String Matching
• Succinct 2D dictionary matching
• CRAM: compressed random access memory
• Random access to high-order entropy compressed text
• Supporting random access in files of variable length records
• scientific article; zbMATH DE number 1773096 (Why is no real title available?)
• scientific article; zbMATH DE number 1794209 (Why is no real title available?)

This page was built for publication: Simple Random Access Compression

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