Burrows–Wheeler transform

最新推荐文章于 2025-02-06 23:34:35 发布

weixin_34077371

最新推荐文章于 2025-02-06 23:34:35 发布

阅读量331

点赞数

Burrows-Wheeler变换(BWT)是一种用于数据压缩的技术，由Michael Burrows和David Wheeler于1994年发明。该变换不改变字符值，而是重新排列字符串中的字符顺序。如果原始字符串中有重复出现的子串，则变换后的字符串会出现多个连续相同字符的情况，这有利于使用如移至前端变换和行程长度编码等技术进行进一步压缩。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

The Burrows–Wheeler transform (BWT, also called block-sorting compression), is an algorithm used in data compression techniques such as bzip2. It was invented by Michael Burrows and David Wheeler in 1994 while working at DEC Systems Research Center in Palo Alto, California.^[1] It is based on a previously unpublished transformation discovered by Wheeler in 1983.

When a character string is transformed by the BWT, none of its characters change value. The transformation permutes the order of the characters. If the original string had several substrings that occurred often, then the transformed string will have several places where a single character is repeated multiple times in a row. 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.