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.
|Numero di pagine||15|
|Rivista||Theoretical Computer Science|
|Stato di pubblicazione||Published - 2007|
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science