Optimal partitions of strings: a new class of Burrows-Wheeler compression algorithms

DOI10.1007/3-540-44888-8_10MaRDI QIDQ3550832zbMATH OpenOpenAlexFDO

Authors M. Sciortino, R. Giancarlo

Publication date 6 April 2010

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44888-8_10

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)

Recommendations

• scientific article; zbMATH DE number 1305460
• An analysis of the Burrows-Wheeler transform
• A Simpler Analysis of Burrows-Wheeler Based Compression
• A simpler analysis of Burrows-Wheeler-based compression
• On optimally partitioning a text to improve its compression

Cited in

(13)

• A simpler analysis of Burrows-Wheeler-based compression
• On optimally partitioning a text to improve its compression
• From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
• Boosting textual compression in optimal linear time
• scientific article; zbMATH DE number 2006809 (Why is no real title available?)
• NC algorithms for finding a maximal set of paths with application to compressing strings
• A Simpler Analysis of Burrows-Wheeler Based Compression
• Compression boosting in optimal linear time using the Burrows-Wheeler transform
• On Optimally Partitioning a Text to Improve Its Compression
• The Burrows-Wheeler transform between data compression and combinatorics on words
• Inversion Coding
• Second step algorithms in the Burrows-Wheeler compression algorithm
• Move-to-Front, Distance Coding, and Inversion Frequencies Revisited

This page was built for publication: Optimal partitions of strings: a new class of Burrows-Wheeler compression algorithms

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