Burrows–Wheeler transform
id:
burrows-wheeler-transform-185-3102187
title:
Burrows–Wheeler transform
text:
The Burrows–Wheeler transform rearranges a character string into runs of similar characters. This is useful for compression, since it tends to be easy to compress a string that has runs of repeated characters by techniques such as move-to-front transform and run-length encoding. More importantly, the transformation is reversible, without needing to store any additional data except the position of the first original character. The BWT is thus a "free" method of improving the efficiency of text co
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm used in data compression techniques
original url:
https://en.wikipedia.org/wiki/Burrows%E2%80%93Wheeler_transform
date created:
2002-01-27T20:05:30Z
date modified:
2024-09-07T15:57:07Z
main entity:
{"identifier":"Q2806","url":"https://www.wikidata.org/entity/Q2806"}
image:
fields total:
13
integrity:
15