Burrows–Wheeler transform
Algorithm used in data compression techniques
The Burrows–Wheeler transform (BWT) rearranges a character string into runs of similar characters, in a manner that can be reversed to recover the original string. Since compression techniques such as move-to-front transform and run-length encoding are more effective when such runs are present, the BWT can be used as a preparatory step to improve the efficiency of a compression algorithm, and is used this way in software such as bzip2.
Nº Q2806 ★
Common · Knowledge
Burrows–Wheeler transform
Algorithm used in data compression techniques
The Burrows–Wheeler transform (BWT) rearranges a character string into runs of similar characters, in a manner that can be reversed to recover the original string. Since compression techniques such as move-to-front transform and run-length encoding are more effective when such runs are present, the BWT can be used as a preparatory step to improve the efficiency of a compression algorithm, and is used this way in software such as bzip2.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
The Burrows–Wheeler transform (BWT) rearranges a character string into runs of similar characters, in a manner that can be reversed to recover the original string. Since compression techniques such as move-to-front transform and run-length encoding are more effective when such runs are present, the BWT can be used as a preparatory step to improve the efficiency of a compression algorithm, and is used this way in software such as bzip2. The algorithm can be implemented efficiently using a suffix array thus reaching linear time complexity. It was invented by David Wheeler in 1983, and later published by him and Michael Burrows in 1994. Their paper included a compression algorithm, called the Block-sorting Lossless Data Compression Algorithm or BSLDCA, that compresses data by using the BWT followed by move-to-front coding and Huffman coding or arithmetic coding.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
David Wheeler (computer scientist)
British computer scientist (1927–2004)
Nº Q92944 ★
Not listed
-
Huffman coding
Entropy encoding algorithm used for lossless data compression
Nº Q2647 ★★★
Not listed
-
Bzip2
Compression software
Nº Q283563 ★
Not listed
-
Comb sort
Sorting algorithm
Nº Q133939 ★
Not listed
-
B
Beowulf cluster
Parallel computing cluster of networked commodity computers
Nº Q818610 ★
Not listed
-
B
Booth's multiplication algorithm
Algorithm invented by Andrew D. Booth
Nº Q477049 ★
Not listed