Sciweavers

837 search results - page 3 / 168
» Dynamic Burrows-Wheeler Transform
Sort
View
ALGORITHMICA
2010
164views more  ALGORITHMICA 2010»
13 years 5 months ago
Space Efficient Algorithms for the Burrows-Wheeler Backtransformation
The Burrows-Wheeler transformation is used for effective data compression, e.g., in the well known program bzip2. Compression and decompression are done in a block-wise fashion; la...
Ulrich Lauther, Tamás Lukovszki
CORR
2012
Springer
220views Education» more  CORR 2012»
12 years 1 months ago
A Bijective String Sorting Transform
Given a string of characters, the Burrows-Wheeler Transform rearranges the characters in it so as to produce another string of the same length which is more amenable to compressio...
Joseph Yossi Gil, David Allen Scott
COCOON
2008
Springer
13 years 7 months ago
Damaged BZip Files Are Difficult to Repair
bzip is a program written by Julian Seward that is often used under Unix to compress single files. It splits the file into blocks which are compressed individually using a combinat...
Christian Hundt, Ulf Ochsenfahrt
ESA
2009
Springer
143views Algorithms» more  ESA 2009»
13 years 12 months ago
On Optimally Partitioning a Text to Improve Its Compression
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
Paolo Ferragina, Igor Nitto, Rossano Venturini