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

DOI10.1007/3-540-44888-8_10zbMATH Open1279.68367OpenAlexW1515706989MaRDI QIDQ3550832FDOQ3550832

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

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

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)

Cited In (13)

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

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)