Skip to search formSkip to main contentSkip to account menu

Burrows–Wheeler transform

Known as: Burrows-wheeler, Block-sorting compression, Burrows-Wheeler Transform 
The Burrows–Wheeler transform (BWT, also called block-sorting compression) rearranges a character string into runs of similar characters. This is… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
In large scale applications of genome analysis, compressed indexes are very useful to avoid the memory usage imposed by suffix… 
2012
2012
Scrambled Burrows-Wheeler transform [6] is an attempt to combine privacy (encryption) and data compression. We show that the… 
Highly Cited
2012
Highly Cited
2012
It is understood that the supernovae (SNe) associated with gamma-ray bursts (GRBs) are of Type Ib/c. The temporal coincidence of… 
2008
2008
In this paper, we present parallel algorithms for lossless data compression based on the Burrows-Wheeler Transform (BWT) block… 
2007
2007
The Burrows-Wheeler Transform (BWT) is a compression method which reorders an input string into the form, which is prefer- able… 
2007
2007
In this paper we present a new lossless audio coder using the Burrows-Wheeler transform (BWT). Audio signals under consideration… 
2001
2001
Compressors based on the Burrows Wheeler transform (1994) convert the transformed text into a string of (move-to-front) ranks… 
1999
1999
[Summary form only given]. In this paper we describe several methods that can be used to improve the compression ratio of… 
Highly Cited
1990
Highly Cited
1990
A fast algorithm for component labeling of binary images is proposed. Component labeling is an important method for separation of… 
1980
1980
As reported previously,1) we found that the autoxidized fatty acids showed the mutage nicity when they were pretreated with deter…