Compression boosting in optimal linear time using the Burrows-Wheeler transform

MaRDI QIDQ5501323zbMATH OpenFDO

Authors Paolo Ferragina, Giovanni Manzini

Publication date 3 August 2015

Mathematics Subject Classification ID

Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Formal languages and automata (68Q45) Approximation algorithms (68W25) Algorithms on strings (68W32)

Recommendations

• Boosting textual compression in optimal linear time
• The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression
• scientific article; zbMATH DE number 1305460
• Optimal partitions of strings: a new class of Burrows-Wheeler compression algorithms
• From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization

Cited in

(11)

• A faster implementation of online run-length Burrows-Wheeler transform
• Parallel algorithms for Burrows-Wheeler compression and decompression
• Fast relative Lempel-Ziv self-index for similar sequences
• Faster suffix sorting
• Optimal information measures for weakly chaotic dynamical systems
• Boosting textual compression in optimal linear time
• Entropy lower bounds for dictionary compression
• The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression
• Combinatorial Pattern Matching
• Space efficient algorithms for the Burrows-Wheeler backtransformation
• On optimally partitioning a text to improve its compression

This page was built for publication: Compression boosting in optimal linear time using the Burrows-Wheeler transform

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