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...
| Publicado en: | Communications of the ACM Vol. 65; no. 6; pp. 91 - 99 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Jun2022
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |