Compressed text indexes

DOI10.1145/1412228.1455268zbMath1284.68255OpenAlexW2041445031MaRDI QIDQ5406182

Rossano Venturini, Paolo Ferragina, Gonzalo Navarro, Rodrigo A. González

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1412228.1455268

zbMATH Keywords

data structurestext compressiontext indexingindexing methodscoding and information theorydata storage representationtextual databasesbioinformatics databases

Mathematics Subject Classification ID

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

Related Items (17)

Compressed string dictionary search with edit distance one ⋮ Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds ⋮ Grammar index by induced suffix sorting ⋮ Approximate string matching with compressed indexes ⋮ Wheeler graphs: a framework for BWT-based data structures ⋮ Lossless Seeds for Searching Short Patterns with High Error Rates ⋮ String matching with alphabet sampling ⋮ Stronger Lempel-Ziv based compressed text indexing ⋮ Practical compressed suffix trees ⋮ Fixed block compression boosting in FM-indexes: theory and practice ⋮ Spaces, Trees, and Colors ⋮ Space-efficient construction of Lempel-Ziv compressed text indexes ⋮ Distribution-aware compressed full-text indexes ⋮ Locally Compressed Suffix Arrays ⋮ Faster entropy-bounded compressed suffix trees ⋮ Improved and extended locating functionality on compressed suffix arrays ⋮ Space-efficient substring occurrence estimation

This page was built for publication: Compressed text indexes