Hybrid indexes for repetitive datasets

DOI10.1098/rsta.2013.0137zbMath1353.68315arXiv1306.4037OpenAlexW2099112381WikidataQ44175590 ScholiaQ44175590MaRDI QIDQ2955636

Travis Gagie, Simon J. Puglisi, Héctor Ferrada, Tommi Hirvola

Publication date: 13 January 2017

Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.4037

Mathematics Subject Classification ID

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

Related Items (6)

FM-index of alignment: a compressed index for similar strings ⋮ FM-index of alignment with gaps ⋮ Unnamed Item ⋮ A compressed dynamic self-index for highly repetitive text collections ⋮ LZ-End Parsing in Linear Time ⋮ Lazy Lempel-Ziv Factorization Algorithms

Cites Work

• Unnamed Item
• On compressing and indexing repetitive sequences
• Approximate string matching with compressed indexes
• ESP-index: a compressed index based on edit-sensitive parsing
• Stronger Lempel-Ziv based compressed text indexing
• Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
• Indexing compressed text
• A universal algorithm for sequential data compression

This page was built for publication: Hybrid indexes for repetitive datasets