The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words

Risultato della ricerca: Otherpeer review

10 Citazioni (Scopus)

Abstract

The Burrows-Wheeler Transform (BWT) is a tool of fundamental importance in Data Compression and, recently, has found many applications well beyond its original purpose.The main goal of this paper is to highlight the mathematical and combinatorial properties on which the outstanding versatility of the $BWT$ is based, i.e. its reversibility and the clustering effect on the output.Such properties have aroused curiosity and fervent interest in the scientific world both for theoretical aspects and for practical effects. In particular, in this paper we are interested both to survey the theoretical research issues which, by taking their cue from Data Compression, have been developed in the context of Combinatorics on Words, and to focus on those combinatorial results useful to explore the applicative potential of the Burrows-Wheeler Transform.
Lingua originaleEnglish
Pagine353-364
Numero di pagine12
Stato di pubblicazionePublished - 2013

All Science Journal Classification (ASJC) codes

  • ???subjectarea.asjc.2600.2614???
  • ???subjectarea.asjc.1700.1700???

Fingerprint

Entra nei temi di ricerca di 'The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words'. Insieme formano una fingerprint unica.

Cita questo