Compression, Indexing, and Retrieval for Massive String Data

DOI10.1007/978-3-642-13509-5_24zbMath1286.68118OpenAlexW2104132688MaRDI QIDQ3575253

Rahul Shah, Wing-Kai Hon, Jeffrey Scott Vitter

Publication date: 26 July 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-13509-5_24

Mathematics Subject Classification ID

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

Related Items (7)

Lightweight data indexing and compression in external memory ⋮ A quick tour on suffix arrays and compressed suffix arrays ⋮ Spaces, Trees, and Colors ⋮ Random Access to High-Order Entropy Compressed Text ⋮ Indexes for Document Retrieval with Relevance ⋮ Unnamed Item ⋮ Geometric BWT: compressed text indexing via sparse suffixes and range searching

This page was built for publication: Compression, Indexing, and Retrieval for Massive String Data