Sciweavers

27 search results - page 1 / 6
» Syllable-Based Burrows-Wheeler Transform
Sort
View
DATESO
2007
100views Database» more  DATESO 2007»
14 years 10 days ago
Syllable-Based Burrows-Wheeler Transform
The Burrows-Wheeler Transform (BWT) is a compression method which reorders an input string into the form, which is preferable to another compression. Usually Move-To-Front transfor...
Jan Lansky, Katsiaryna Chernik, Zuzana Vlckova
CORR
2012
Springer
220views Education» more  CORR 2012»
12 years 6 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
DCC
2008
IEEE
14 years 10 months ago
Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...
Yu-Feng Chien, Wing-Kai Hon, Rahul Shah, Jeffrey S...
DCC
1999
IEEE
14 years 3 months ago
Universal Lossless Source Coding with the Burrows Wheeler Transform
The Burrows Wheeler Transform (BWT) is a reversible sequence transformation used in a variety of practical lossless source-coding algorithms. In each, the BWT is followed by a loss...
Michelle Effros
DCC
2009
IEEE
14 years 5 months ago
Slepian-Wolf Coding of Binary Finite Memory Source Using Burrows-Wheeler Transform
Abstract—In this paper, an asymmetric Slepian-Wolf coding (SWC) scheme for binary finite memory source (FMS) is proposed. The a priori information about the source is extracted ...
Chao Chen, Xiangyang Ji, Qionghai Dai, Xiaodong Li...