Compressed Text Indexes with Fast Locate

DOI10.1007/978-3-540-73437-6_23MaRDI QIDQ3506924zbMATH OpenOpenAlexFDO

Authors Rodrigo González, Gonzalo Navarro

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)

Recommendations

• Compressed text indexes, from theory to practice
• Compressed indexes for text with wildcards
• Compressed text indexing with wildcards
• Compressed indexes for dynamic text collections
• Compressed Indexes for Approximate String Matching
• Compressed indexes for approximate string matching
• Combinatorial Pattern Matching

Cited in

(13)

• Faster entropy-bounded compressed suffix trees
• Practical compressed suffix trees
• Improved and extended locating functionality on compressed suffix arrays
• Wavelet trees for all
• Locally compressed suffix arrays
• General document retrieval in compact space
• A compressed text index on secondary memory
• Parallel and distributed compressed indexes
• Colored range queries and document retrieval
• String matching with alphabet sampling
• Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
• Compressed text indexes, from theory to practice
• Re^2Pair: increasing the scalability of repair by decreasing memory usage

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

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