Definitions from Wiktionary (Burrows-Wheeler transform)
▸ noun: (computing theory) An algorithm used in data compression that rearranges a character string into runs of similar characters.
▸ Words similar to Burrows-Wheeler transform
▸ Usage examples for Burrows-Wheeler transform
▸ Idioms related to Burrows-Wheeler transform
▸ Wikipedia articles (New!)
▸ Words that often appear near Burrows-Wheeler transform
▸ Rhymes of Burrows-Wheeler transform
▸ Invented words related to Burrows-Wheeler transform
▸ noun: (computing theory) An algorithm used in data compression that rearranges a character string into runs of similar characters.
Similar:
chain code,
Boyer-Moore-Horspool algorithm,
string substitution,
stringifier,
word-wheeling,
Huffman coding,
code morphing,
compressor,
data compression,
metasequence,
more...
▸ Words similar to Burrows-Wheeler transform
▸ Usage examples for Burrows-Wheeler transform
▸ Idioms related to Burrows-Wheeler transform
▸ Wikipedia articles (New!)
▸ Words that often appear near Burrows-Wheeler transform
▸ Rhymes of Burrows-Wheeler transform
▸ Invented words related to Burrows-Wheeler transform