An extension of the burrows wheeler transform and applications to sequence comparison and data compression

Authors:
Sabrina Mantaci;Antonio Restivo;G. Rosone;Marinella Sciortino
Affiliations:
Dipartimento di Matematica ed Application, University of Palermo, Palermo, Italy;Dipartimento di Matematica ed Application, University of Palermo, Palermo, Italy;Dipartimento di Matematica ed Application, University of Palermo, Palermo, Italy;Dipartimento di Matematica ed Application, University of Palermo, Palermo, Italy
Venue:
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Year:
2005

Citing 6
Cited 8

Counting permutations with given cycle structure and descent set

Journal of Combinatorial Theory Series A
Invited Lecture: The Burrows-Wheeler Transform: Theory and Practice

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Burrows--Wheeler transform and Sturmian words

Information Processing Letters
A note on the Burrows-Wheeler transformation

Theoretical Computer Science
The similarity metric

IEEE Transactions on Information Theory
Clustering by compression

IEEE Transactions on Information Theory

Compressed permuterm index

SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
An extension of the Burrows–Wheeler Transform

Theoretical Computer Science
Distance measures for biological sequences: Some recent approaches

International Journal of Approximate Reasoning
The compressed permuterm index

ACM Transactions on Algorithms (TALG)
Lightweight BWT construction for very large string collections

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
A new combinatorial approach to sequence comparison

ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Burrows-Wheeler transformations and de Bruijn words

Theoretical Computer Science
Lightweight algorithms for constructing and inverting the BWT of string collections

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.