We introduce a generalization of the Burrows-Wheeler Transform (BWT) that can be applied to a multiset of words. The extended transformation, denoted by E, is reversible, but, differently from BWT, it is also surjective. The E transformation allows to give a definition of distance between two sequences, that we apply here to the problem of the whole mitochondrial genome phylogeny. Moreover we give some consideration about compressing a set of words by using the E transformation as preprocessing. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Mantaci, S., Restivo, A., Rosone, G., & Sciortino, M. (2005). An extension of the Burrows Wheeler transform and applications to sequence comparison and data compression. In Lecture Notes in Computer Science (Vol. 3537, pp. 178–189). Springer Verlag. https://doi.org/10.1007/11496656_16
Mendeley helps you to discover research relevant for your work.