Compressed Text Indexes with Fast Locate

DOI10.1007/978-3-540-73437-6_23zbMath1138.68415OpenAlexW1529451410MaRDI QIDQ3506924

Gonzalo Navarro, Rodrigo A. González

Publication date: 17 June 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73437-6_23

Mathematics Subject Classification ID

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

Related Items (8)

Colored range queries and document retrieval ⋮ String matching with alphabet sampling ⋮ Wavelet trees for all ⋮ Practical compressed suffix trees ⋮ Spaces, Trees, and Colors ⋮ Locally Compressed Suffix Arrays ⋮ General Document Retrieval in Compact Space ⋮ Faster entropy-bounded compressed suffix trees

This page was built for publication: Compressed Text Indexes with Fast Locate