Simple Compression Code Supporting Random Access and Fast String Matching

DOI10.1007/978-3-540-72845-0_16MaRDI QIDQ5432317zbMATH OpenOpenAlexFDO

Authors Kimmo Fredriksson, Fedor Nikitin

Publication date 2 January 2008

Published in Experimental Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72845-0_16

Mathematics Subject Classification ID

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

Recommendations

• Simple Random Access Compression
• scientific article; zbMATH DE number 1263249
• scientific article; zbMATH DE number 2079421
• String matching in Lempel-Ziv compressed strings
• Practical and flexible pattern matching over Ziv-Lempel compressed text.

Cited in

(10)

• scientific article; zbMATH DE number 1421009 (Why is no real title available?)
• Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation
• Dynamic Compressed Strings with Random Access
• A simple storage scheme for strings achieving entropy bounds
• CRAM: compressed random access memory
• Random access to high-order entropy compressed text
• scientific article; zbMATH DE number 1773096 (Why is no real title available?)
• scientific article; zbMATH DE number 1794209 (Why is no real title available?)
• Simple Random Access Compression
• Minimal and monotone minimal perfect hash functions

This page was built for publication: Simple Compression Code Supporting Random Access and Fast String Matching

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