Sciweavers

27 search results - page 4 / 6
» Syllable-Based Burrows-Wheeler Transform
Sort
View
CAI
2007
Springer
14 years 10 days ago
Sturmian and Episturmian Words
Abstract. This survey paper contains a description of some recent results concerning Sturmian and episturmian words, with particular emphasis on central words. We list fourteen cha...
Jean Berstel
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
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
13 years 8 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan