Lossy compression of quality scores in genomic data

Bioinformatics

Volumn 30, Issue 15, 2014, Pages 2130-2136

  Cánovas, Rodrigo ^a   Moffat, Alistair ^a   Turpin, Andrew ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; GENETICS; GENOME; GENOMICS; HIGH THROUGHPUT SEQUENCING; INFORMATION PROCESSING; METHODOLOGY; NUCLEOTIDE SEQUENCE; QUALITY CONTROL; SINGLE NUCLEOTIDE POLYMORPHISM; STANDARD;

ALGORITHMS; BASE SEQUENCE; DATA COMPRESSION; GENOME; GENOMICS; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; POLYMORPHISM, SINGLE NUCLEOTIDE; QUALITY CONTROL;

EID: 84905027735     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btu183     Document Type: Article

References (23)

1. Ansorge, W. (2009) Next-generation DNA sequencing techniques. N. Biotechnol., 25, 195-203.
2. Burrows, M. and Wheeler, D. (1994) A block-sorting lossless data compression algorithm. In: Technical report SRC-RR 124. Digital Equipment Corporation Systems Research Center.
3. Canovas, R. and Moffat, A. (2013) Practical compression for multi-Alignment genomic files. In: Proceedings of 36th Australasian Computer Science Conference. Adelaide, Australia, pp. 51-60.
4. Cha, S. (2007) Comprehensive survey on distance/similarity measures between probability density functions. Int. J. Math. Models Methods Appl. Sci., 1, 300-307.
5. Church, G.M. (2006) Genomes for all. Sci. Am., 294, 46-54.
6. Cock, P.A. et al. (2010) The Sanger FASTQ file format for sequences with quality scores, and the Solexa/Illumina FASTQ variants. Nucleic Acids Res., 38, 1767-1771.
7. Danecek, P. et al. (2011) The variant call format and VCFtools. Bioinformatics, 27, 2156-2158.
8. Deorowicz, S. and Grabowski, S. (2011) Compression of DNA sequence reads in FASTQ format. Bioinformatics, 27, 860-862.
9. Elias, P. (1975) Universal codeword sets and representations of the integers. IEEE Trans. Inf. Theory, 21, 194-203.
10. Ewing, B. and Green, P. (1998) Base-calling of automated sequencer traces using Phred.II. Error probabilities. Genome Res., 8, 186-194.
11. Fritz, M.H. et al. (2011) Efficient storage of high throughput DNA sequencing data using reference-based compression. Genome Res., 21, 734-740.
12. Giancarlo, R. et al. (2009) Textual data compression in computational biology: A synopsis. Bioinformatics, 25, 1575-1586.
13. Janin, L. et al. (2014) Adaptive reference-free compression of sequence quality scores. Bioinformatics, 30, 24-30.
14. Kozanitis, C. et al. (2010) Compressing genomic sequence fragments using SLIMGENE. In: Proceedings of the 14th Annual International Conference on Research in Computational Molecular Biology, RECOMB'10. pp. 310-324.
15. Lapidoth, A. (1997) On the role of mismatch in rate distortion theory. IEEE Tran. Inf. Theory, 43, 38-47.
16. Li, H. et al. (2009) The sequence alignment/map format and SAMtools. Bioinformatics, 25, 2078-2079.
17. Mardis, E.R. (2008) Next-generation DNA sequencing methods. Ann. Rev. Genomics Hum. Genet., 9, 387-402.
18. Moffat, A. and Turpin, A. (2002) Compression and Coding Algorithms. Kluwer Academic Publishers, Norwell, MA.
19. Myllykangas, S et al. (2012) Overview of sequencing technology platforms. In: Rodriguez-Ezpeleta, N. et al. (eds Bioinformatics for High Throughput Sequencing. Springer, New York, NY 11-25.
20. Nielsen, R. et al. (2011) Genotype and SNP calling from next-generation sequencing data. Nat. Rev. Genet., 12, 443-451.
21. Ochoa, I. et al. (2013) QualComp: A new lossy compressor for quality scores based on rate distortion theory. BMC Bioinformatics, 14, 187.
22. Tembe, W. et al. (2010) G-SQZ: Compact encoding of genomic sequence and quality data. Bioinformatics, 26, 2192-2194.
23. Wan, R. et al. (2012) Transformations for the compression of FASTQ quality scores of next-generation sequencing data. Bioinformatics, 28, 628-635.