Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform

Abstract

Motivation The Burrows-Wheeler transform (BWT) is the foundation of many algorithms for compression and indexing of text data, but the cost of computing the BWT of very large string collections has prevented these techniques from being widely applied to the large sets of sequences often encountered as the outcome of DNA sequencing experiments. In previous work, we presented a novel algorithm that allows the BWT of human genome scale data to be computed on very moderate hardware, thus enabling us to investigate the BWT as a tool for the compression of such datasets. Results We first used simulated reads to explore the relationship between the level of compression and the error rate, the length of the reads and the level of sampling of the underlying genome and compare choices of second-stage compression algorithm. We demonstrate that compression may be greatly improved by a particular reordering of the sequences in the collection and give a novel `implicit sorting' strategy that enables these benefits to be realised without the overhead of sorting the reads. With these techniques, a 45x coverage of real human genome sequence data compresses losslessly to under 0.5 bits per base, allowing the 135.3Gbp of sequence to fit into only 8.2Gbytes of space (trimming a small proportion of low-quality bases from the reads improves the compression still further). This is more than 4 times smaller than the size achieved by a standard BWT-based compressor (bzip2) on the untrimmed reads, but an important further advantage of our approach is that it facilitates the building of compressed full text indexes such as the FM-index on large-scale DNA sequence collections.

Version here is as submitted to Bioinformatics and is same as the previously archived version. This submission registers the fact that the advanced access version is now available at http://bioinformatics.oxfordjournals.org/content/early/2012/05/02/bioinformatics.bts173.abstract . Bioinformatics should be considered as the original place of publication of this article, please cite accordingly

Cited by in corpus (14)

• MOSAIK: A hash-based algorithm for accurate next-generation sequencing read mapping
• Fast construction of FM-index for long sequence reads
• BWT construction and search at the terabase scale
• Comparing DNA sequence collections by direct comparison of compressed text indexes
• Alignment-free comparison of next-generation sequencing data using compression-based distance measures
• A survey of BWT variants for string collections
• Low-bandwidth and non-compute intensive remote identification of microbes from raw sequencing reads
• A massively parallel algorithm for constructing the BWT of large string sets
• E2FM: an encrypted and compressed full-text index for collections of genomic sequences
• A New Class of Searchable and Provably Highly Compressible String Transformations
• Lossy Compressor preserving variant calling through Extended BWT
• Compressing and Indexing Aligned Readsets
• On the Hardness Hierarchy for the $O(n\sqrt{\log n})$ Complexity in the Word RAM
• Disk-based genome sequencing data compression