An extension of the Burrows-Wheeler Transform

Risultato della ricerca: Articlepeer review

67 Citazioni (Scopus)

Abstract

We describe and highlight a generalization of the Burrows–Wheeler Transform (bwt) to a multiset of words. The extended transformation, denoted by ebwt, is reversible. Moreover, it allows to define a bijection between the words over a finite alphabet A and the finite multisets of conjugacy classes of primitive words in A∗. Besides its mathematical interest, the extended transform can be useful for applications in the context of string processing. In the last part of this paper we illustrate one such application, providing a similarity measure between sequences based on ebwt.
Lingua originaleEnglish
pagine (da-a)298-312
Numero di pagine15
RivistaTheoretical Computer Science
Volume387 (3)
Stato di pubblicazionePublished - 2007

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • ???subjectarea.asjc.1700.1700???

Fingerprint Entra nei temi di ricerca di 'An extension of the Burrows-Wheeler Transform'. Insieme formano una fingerprint unica.

Cita questo