Word.ws English Dictionary

Burrows-Wheeler transform

Burrows-Wheeler transform noun: an algorithm used in data compression that rearranges a character string into runs of similar characters.

Noun

Burrows-Wheeler transform (plural Burrows-Wheeler transforms)

  1. An algorithm used in data compression that rearranges a character string into runs of similar characters.

Forms of Burrows-Wheeler transform

pluralBurrows-Wheeler transforms

Origin of Burrows-Wheeler transform

Invented by Michael Burrows and David Wheeler in 1994.

Questions about Burrows-Wheeler transform

What does Burrows-Wheeler transform mean?
Burrows-Wheeler transform means an algorithm used in data compression that rearranges a character string into runs of similar characters.
What part of speech is Burrows-Wheeler transform?
Burrows-Wheeler transform is a noun.
What is the plural of Burrows-Wheeler transform?
The plural of Burrows-Wheeler transform is Burrows-Wheeler transforms.

Words near Burrows-Wheeler transform in the dictionary

  1. burrowing parrots
  2. burrowings
  3. burrowless
  4. burrowlike
  5. burrows
  6. Burrows-Wheeler transform
  7. Burrows-Wheeler transforms
  8. burrowstown
  9. burrowstowns
  10. Burrowye
  11. burrs

Source and license

Adapted from Wiktionary: Burrows-Wheeler transform (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Burrows-Wheeler transform.” Word.ws, https://word.ws/burrows-wheeler_transform. Based on Wiktionary, CC BY-SA 4.0.