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