Flexible indexing of repetitive collections
DOI10.1007/978-3-319-58741-7_17zbMATH Open1489.68056OpenAlexW2614020870MaRDI QIDQ2011648FDOQ2011648
Authors: Fabio Cunial, Travis Gagie, Nicola Prezza, Djamal Belazzougui, Mathieu Raffinot 
Publication date: 4 August 2017
Full work available at URL: https://orbit.dtu.dk/en/publications/9d82245e-1742-429a-a17a-b16b809cf4aa
Recommendations
Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Cites Work
- Algorithms on Strings, Trees and Sequences
- Stronger Lempel-Ziv based compressed text indexing
- Succinct representation of balanced parentheses and static trees
- Indexing compressed text
- A universal algorithm for sequential data compression
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Orthogonal range searching on the RAM, revisited
- On compressing and indexing repetitive sequences
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
- Self-indexing based on LZ77
- On maximal repeats in strings
- Linear time construction of compressed text indices in compact space
- Composite repetition-aware data structures
- LZ77-based self-indexing with faster pattern matching
- Combinatorial Pattern Matching
- The Complexity of Some Simple Retrieval Problems
Cited In (13)
- Storage and Retrieval of Individual Genomes
- Title not available (Why is that?)
- Self-indexing based on LZ77
- Optimal construction of compressed indexes for highly repetitive texts
- Fully functional suffix trees and optimal text searching in BWT-runs bounded space
- Contextual Pattern Matching
- Document listing on repetitive collections with guaranteed performance
- On compressing and indexing repetitive sequences
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
- Composite repetition-aware data structures
- Indexing highly repetitive collections
- Document Listing on Repetitive Collections with Guaranteed Performance
- Universal compressed text indexing
Uses Software
This page was built for publication: Flexible indexing of repetitive collections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011648)
