A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
An Application of Self-organizing Data Structures to Compression
[chapter]
2009
Lecture Notes in Computer Science
List update algorithms have been widely used as subroutines in compression schemas, most notably as part of Burrows-Wheeler compression. The Burrows-Wheeler transform (BWT), which is the basis of many state-of-the-art general purpose compressors applies a compression algorithm to a permuted version of the original text. List update algorithms are a common choice for this second stage of BWT-based compression. In this paper we perform an experimental comparison of various list update algorithms
doi:10.1007/978-3-642-02011-7_14
fatcat:4l67nkiwj5brdc42uw3jbkil4u