Resolution of the Burrows-Wheeler Transform Conjecture.

The Burrows-Wheeler Transform (BWT) is an invertible text transformation that permutes symbols of a text according to the lexicographical order of its suffixes. BWT is the main component of popular lossless compression programs (such as bzip2) as well as recent powerful compressed indexes (such as t...

Full description

Bibliographic Details

Published in:	Communications of the ACM Vol. 65; no. 6; pp. 91 - 99
Main Authors:	Kempa, Dominik, Kociumaka, Tomasz
Format:	Article
Published:	Association for Computing Machinery Jun2022
Subjects:	Computer programming Computers in lexicography Algorithms Data structures Computer science
Online Access:	View this record in EBSCOhost