Fixed block compression boosting in FM-indexes: theory and practice

DOI10.1007/s00453-018-0475-9zbMath1422.68047OpenAlexW2811012751WikidataQ129605268 ScholiaQ129605268MaRDI QIDQ1739099

Juha Kärkkäinen, Matthias Petri, Simon Gog, Dominik Kempa, Simon J. Puglisi

Publication date: 25 April 2019

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10138/308353

zbMATH Keywords

pattern matchingsuffix arraytext indexingwavelet treeFM-indexcompression boosting

Mathematics Subject Classification ID

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

Related Items (3)

Weighted forward looking adaptive coding ⋮ Practical Wavelet Tree Construction ⋮ A compressed dynamic self-index for highly repetitive text collections

Uses Software

• Soap
• LZ77

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On optimally partitioning a text to improve its compression
• Bidirectional Variable-Order de Bruijn Graphs
• Compressed representations of sequences and full-text indexes
• An analysis of the Burrows—Wheeler transform
• Boosting textual compression in optimal linear time
• Indexing compressed text
• Succinct de Bruijn Graphs
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• Lempel-Ziv Factorization: Simple, Fast, Practical
• Practical Entropy-Compressed Rank/Select Dictionary
• String Processing and Information Retrieval
• Compressed text indexes

This page was built for publication: Fixed block compression boosting in FM-indexes: theory and practice