Sciweavers

75 search results - page 3 / 15
» DNA Sequence Compression Using the Burrows-Wheeler Transform
Sort
View
VLDB
2007
ACM
117views Database» more  VLDB 2007»
14 years 6 months ago
RadixZip: Linear-Time Compression of Token Streams
RadixZip is a block compression technique for token streams. It introduces RadixZip Transform, a linear time algorithm that rearranges bytes using a technique inspired by radix so...
Binh Vo, Gurmeet Singh Manku
DCC
2004
IEEE
14 years 5 months ago
Fast Compression with a Static Model in High-Order Entropy
We report on a simple encoding format called wzip for decompressing block-sorting transforms, such as the Burrows-Wheeler Transform (BWT). Our compressor uses the simple notions o...
Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffre...
CPM
2007
Springer
73views Combinatorics» more  CPM 2007»
13 years 10 months ago
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
Move-to-Front, Distance Coding and Inversion Frequencies are three simple and effective techniques used to process the output of the Burrows-Wheeler Transform. In this paper we pr...
Travis Gagie, Giovanni Manzini
ACSC
2004
IEEE
13 years 10 months ago
Lossless Image Compression Using Pixel Reordering
Lossless image compression techniques typically consider images to be a sequence of pixels in row major order. The processing of each pixel consists of two separate operations. Th...
Michael Ciavarella, Alistair Moffat
DCC
1998
IEEE
13 years 10 months ago
The Context Trees of Block Sorting Compression
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...
N. Jesper Larsson