Lossy compression of quality scores in genomic data
- 2 May 2014
- journal article
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 30 (15) , 2130-2136
Abstract
Motivation: Next-generation sequencing technologies are revolutionizing medicine. Data from sequencing technologies are typically represented as a string of bases, an associated sequence of per-base quality scores and other metadata, and in aggregate can require a large amount of space. The quality scores show how accurate the bases are with respect to the sequencing process, that is, how confident the sequencer is of having called them correctly, and are the largest component in datasets in which they are retained. Previous research has examined how to store sequences of bases effectively; here we add to that knowledge by examining methods for compressing quality scores. The quality values originate in a continuous domain, and so if a fidelity criterion is introduced, it is possible to introduce flexibility in the way these values are represented, allowing lossy compression over the quality score data.Keywords
This publication has 20 references indexed in Scilit:
- Adaptive reference-free compression of sequence quality scoresBioinformatics, 2013
- The variant call format and VCFtoolsBioinformatics, 2011
- Compression of DNA sequence reads in FASTQ formatBioinformatics, 2011
- Efficient storage of high throughput DNA sequencing data using reference-based compressionGenome Research, 2011
- The Sanger FASTQ file format for sequences with quality scores, and the Solexa/Illumina FASTQ variantsNucleic Acids Research, 2009
- Next-generation DNA sequencing techniquesNew Biotechnology, 2009
- Textual data compression in computational biology: a synopsisBioinformatics, 2009
- Genomes for AllScientific American, 2006
- Base-Calling of Automated Sequencer Traces Using Phred. II. Error ProbabilitiesGenome Research, 1998
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975