The extended Burrows-Wheeler-Transform (eBWT), introduced by Mantaci et al. [Theor. Comput. Sci., 2007], is a generalization of the Burrows-Wheeler-Transform (BWT) to mul- tisets of strings. A number of tools are available that compute the BWT of string collections; however, the data structures they generate in most cases differ from the one originally defined, as well as from each other. Here we give a brief overview of the differences between these BWT variants.
On different variants of the Burrows-Wheeler-Transform of string collections
Davide Cenzato;Zsuzsanna Lipták
2022-01-01
Abstract
The extended Burrows-Wheeler-Transform (eBWT), introduced by Mantaci et al. [Theor. Comput. Sci., 2007], is a generalization of the Burrows-Wheeler-Transform (BWT) to mul- tisets of strings. A number of tools are available that compute the BWT of string collections; however, the data structures they generate in most cases differ from the one originally defined, as well as from each other. Here we give a brief overview of the differences between these BWT variants.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
DCC2022.pdf
solo utenti autorizzati
Tipologia:
Versione dell'editore
Licenza:
Copyright dell'editore
Dimensione
62.73 kB
Formato
Adobe PDF
|
62.73 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
