Published Articles >> Table of Contents >> Abstract

IEEE Computer Society Bioinformatics Conference (CSB'02)   p. 303
DNA Sequence Compression Using the Burrows-Wheeler Transform
Don Adjeroh, West Virginia University
Yong Zhang, West Virginia University
Amar Mukherjee, University of Central Florida
Matt Powell, University of Canterbury
Tim Bell, University of Canterbury

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSB.2002.1039352
Send link to a friend

Abstract
We investigate off-line dictionary oriented approaches to DNA sequence compression, based on the Burrows-Wheeler Transform (BWT). The preponderance of short repeating patterns is an important phenomenon in biological sequences. Here, we propose off-line methods to compress DNA sequences that exploit the different repetition structures inherent in such sequences. Repetition analysis is performed based on the relationship between the BWT and important pattern matching data structures, such as the suffix tree and suffix array. We discuss how the proposed approach can be incorporated in the BWT compression pipeline.
Back to Top Additional Information
Index Terms- DNA sequence compression, repetition structures, Burrows-Wheeler Transform, BWT Citation:  Don Adjeroh, Yong Zhang, Amar Mukherjee, Matt Powell, Tim Bell, "DNA Sequence Compression Using the Burrows-Wheeler Transform," csb, p. 303,  IEEE Computer Society Bioinformatics Conference (CSB'02),  2002