Data structures and compression algorithms for high-throughput sequencing technologies

• Published in: BMC bioinformatics Vol. 11; no. 1; p. 514
• Main Authors: Daily, Kenny, Rigor, Paul, Christley, Scott, Xie, Xiaohui, Baldi, Pierre
• Format: Journal Article
• Language: English
• Published: London BioMed Central 14.10.2010; BioMed Central Ltd; Springer Nature B.V; BMC
• Subjects: Algorithms; Bioinformatics; Biomedical and Life Sciences; Cloning; Colleges & universities; Computational Biology - methods; Computational Biology/Bioinformatics; Computer Appl. in Life Sciences; Computer science; Data Compression; Data structures; Databases, Factual; Entropy; Experiments; Genetic algorithms; Genetic testing; Genomes; Genomics; High-Throughput Nucleotide Sequencing - methods; High-throughput screening (Biochemical assaying); Information management; Life Sciences; Mass spectrometry; Microarrays; Research Article; Huffman Code; Reference Genome; Good Compression; Encode Strategy; Compression Algorithm
• ISSN: 1471-2105; 1471-2105
• DOI: 10.1186/1471-2105-11-514

Background High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively short nucleotide sequences, in applications ranging from genome sequencing and resequencing to digital microarrays and ChIP-Seq experiments. As experiments scale up, HTS technologies create new bioinformatics challenges for the storage and sharing of HTS data. Results We develop data structures and compression algorithms for HTS data. A processing stage maps short sequences to a reference genome or a large table of sequences. Then the integers representing the short sequence absolute or relative addresses, their length, and the substitutions they may contain are compressed and stored using various entropy coding algorithms, including both old and new fixed codes (e.g Golomb, Elias Gamma, MOV) and variable codes (e.g. Huffman). The general methodology is illustrated and applied to several HTS data sets. Results show that the information contained in HTS files can be compressed by a factor of 10 or more, depending on the statistical properties of the data sets and various other choices and constraints. Our algorithms fair well against general purpose compression programs such as gzip, bzip2 and 7zip; timing results show that our algorithms are consistently faster than the best general purpose compression programs. Conclusions It is not likely that exactly one encoding strategy will be optimal for all types of HTS data. Different experimental conditions are going to generate various data distributions whereby one encoding strategy can be more effective than another. We have implemented some of our encoding algorithms into the software package GenCompress which is available upon request from the authors. With the advent of HTS technology and increasingly new experimental protocols for using the technology, sequence databases are expected to continue rising in size. The methodology we have proposed is general, and these advanced compression techniques should allow researchers to manage and share their HTS data in a more timely fashion.