褒别算法英文解释翻译、褒别算法的近义词、反义词、例句
英语翻译：
【计】 recognition algorithm
分词翻译：
别的英语翻译：
leave; other
【医】 allo-
算法的英语翻译：
algorithm; arithmetic
【计】 ALG; algorithm; D-algorithm; Roth's D-algorithm
【化】 algorithm
【经】 algorithm
网络扩展解释
褒别算法
褒别（bāo bié）算法是一种用于数据压缩的算法，也被称为伯利兹-褒别算法（Burrows–Wheeler Transform）。
英文解释翻译
The Burrows-Wheeler transform is a data compression algorithm also known as the BWT algorithm. It rearranges a character string into runs of similar characters to improve compressibility.
英文读音
bʌrəʊz ˈwiːlə(r) trænsˌfɔːm
英文的用法
The Burrows-Wheeler transform is often used as a preprocess step for data compression using algorithms such as Huffman coding or arithmetic coding. It is also used in genome sequencing and indexing.
英文例句
Here's an example of applying the Burrows-Wheeler transform:
Input string:
banana
Transformed string:
annbnaa
英文近义词
No direct synonyms for the Burrows-Wheeler transform, but it is commonly used in conjunction with other compression techniques such as Huffman coding or arithmetic coding.
英文反义词
There are no direct antonyms for the Burrows-Wheeler transform, as it is a specific algorithm for data compression.
英文单词常用度
The term "Burrows-Wheeler transform" is a specialized term used mainly in the fields of data compression, genome sequencing, and indexing.