Flexible indexing of repetitive collections

DOI10.1007/978-3-319-58741-7_17zbMath1489.68056OpenAlexW2614020870MaRDI QIDQ2011648

Nicola Prezza, Travis Gagie, Fabio Cunial, 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

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Algorithms on strings (68W32)

Uses Software

• PATRICIA

Cites Work

• On compressing and indexing repetitive sequences
• On maximal repeats in strings
• Log-logarithmic worst-case range queries are possible in space theta(N)
• Stronger Lempel-Ziv based compressed text indexing
• Succinct Representation of Balanced Parentheses and Static Trees
• Composite Repetition-Aware Data Structures
• Self-indexing Based on LZ77
• Indexing compressed text
• The Complexity of Some Simple Retrieval Problems
• A universal algorithm for sequential data compression
• Algorithms on Strings, Trees and Sequences
• Linear time construction of compressed text indices in compact space
• Orthogonal range searching on the RAM, revisited
• LZ77-Based Self-indexing with Faster Pattern Matching
• Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
• Combinatorial Pattern Matching

This page was built for publication: Flexible indexing of repetitive collections