Compressed text indexes
From MaRDI portal
Publication:5406182
DOI10.1145/1412228.1455268zbMath1284.68255MaRDI 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
data structures; text compression; text indexing; indexing methods; coding and information theory; data storage representation; textual databases; bioinformatics databases
68W40: Analysis of algorithms
68P15: Database theory
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
68P05: Data structures
Related Items
Spaces, Trees, and Colors, Space-efficient substring occurrence estimation, Compressed string dictionary search with edit distance one, String matching with alphabet sampling, Space-efficient construction of Lempel-Ziv compressed text indexes, Faster entropy-bounded compressed suffix trees, Approximate string matching with compressed indexes, Wheeler graphs: a framework for BWT-based data structures, Practical compressed suffix trees, Fixed block compression boosting in FM-indexes: theory and practice, Distribution-aware compressed full-text indexes, Grammar index by induced suffix sorting, Improved and extended locating functionality on compressed suffix arrays, Stronger Lempel-Ziv based compressed text indexing, Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds, Locally Compressed Suffix Arrays, Lossless Seeds for Searching Short Patterns with High Error Rates
