Sage Journals: Discover world-class research

Abstract

Previous studies on quality score compression can be classified into two main lines: lossy schemes and lossless schemes. Lossy schemes enable a better management of computational resources. Thus, in practice, and for preliminary analyses, bioinformaticians may prefer to work with a lossy quality score representation. However, the original quality scores might be required for a deeper analysis of the data. Hence, it might be necessary to keep them; in addition to lossy compression this requires lossless compression as well. We developed a space-efficient hierarchical representation of quality scores, QScomp, which allows the users to work with lossy quality scores in routine analysis, without sacrificing the capability of reaching the original quality scores when further investigations are required. Each quality score is represented by a tuple through a novel decomposition. The first and second dimensions of these tuples are separately compressed such that the first-level compression is a lossy scheme. The compressed information of the second dimension allows the users to extract the original quality scores. Experiments on real data reveal that the downstream analysis with the lossy part—spending only 0.49 bits per quality score on average—shows a competitive performance, and that the total space usage with the inclusion of the compressed second dimension is comparable to the performance of competing lossless schemes.

Get full access to this article

View all access options for this article.

References

Alberti

, Daniels

, Hernaez

, et al. 2016. An evaluation framework for lossy compression of genome sequencing quality values. 2016 Data Compression Conference (DCC), Snowbird, UT, pp. 221–230.

Berger

, Daniels

N.M.

, and Yu

Y.W.

2016. Computational biology in the 21st century: Scaling with compressive algorithms. Commun. ACM., 59, 72–80.

Bonfield

J.K.

, and Mahoney

M.V.

2013. Compression of FASTQ and SAM format sequencing data. PLoS One. 8, e59190.

Cánovas

, Moffat

, and Turpin

2014. Lossy compression of quality scores in genomic data. Bioinformatics. 30, 2130–2136.

Cock

P.J.A.

, Fields

C.J.

, Goto

, 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.

Deorowicz

, and Grabowski

2011. Compression of DNA sequence reads in FASTQ format. Bioinformatics. 27, 860–862.

Elias

1975. Universal codeword sets and representations of the integers. IEEE Trans. Inf. Theory., 21, 194–203.

Ewing

, and Green

1998. Base-calling of automated sequencer traces using phred. II. Error probabilities. Genome Res. 8, 186–194.

Hach

, Numanagić

, Alkan

, et al. 2012. Scalce: Boosting sequence compression algorithms using locally consistent encoding. Bioinformatics. 28, 3051–3057.

10.

Hernaez

, Ochoa

, and Weissman

2016. A cluster-based approach to compression of quality scores. 2016 Data Compression Conference (DCC), Snowbird, UT, pp. 261–270.

11.

Janin

, Rosone

, and Cox

A.J.

2014. Adaptive reference-free compression of sequence quality scores. Bioinformatics. 30, 24–30.

12.

Jones

D.C.

, Ruzzo

W.L.

, Peng

, et al. 2012. Compression of next-generation sequencing reads aided by highly efficient de novo assembly. Nucleic Acids Res. 40, e171.

13.

Loh

P.-R.

, Baym

, and Berger

2012. Compressive genomics. Nat. Biotechnol., 30, 627–630.

14.

Malysa

, Mikel

, Ochoa

, et al. 2015. Qvz: Lossy compression of quality values. Bioinformatics. 31, 3122–3129.

15.

Numanagić

, Bonfield

J.K.

, Hach

, et al. 2016. Comparison of high-throughput sequencing data compression tools. Nat. Methods., 13, 1005–1008.

16.

Ochoa

, Asnani

, Bharadia

, et al. 2013. Qualcomp: A new lossy compressor for quality scores based on rate distortion theory. BMC Bioinformatics. 14, 187.

17.

Ochoa

, Hernaez

, Goldfeder

, et al. 2016. Effect of lossy compression of quality scores on variant calling. Brief. Bioinform., 18, 183–194.

18.

Ostermann

, Bormans

, List

, et al. 2004. Video coding with H.264/AVC: Tools, performance, and complexity. IEEE Circuits Syst. Mag., 4, 7–28.

19.

Rimmer

, Phan

, Mathieson

, et al. 2014. Integrating mapping-, assembly- and haplotype-based approaches for calling variants in clinical sequencing applications. Nat. Genet., 46, 912–918.

20.

Van der Auwera

G.A.

, Carneiro

M.O.

, Hartl

, et al. 2013. From FASTQ data to high-confidence variant calls: The genome analysis toolkit best practices pipeline. Curr. Protoc. Bioinformatics., 43, 11.10.1–11.10.33.

21.

Voges

, Ostermann

, and Hernaez

2017. CALQ: Compression of quality values of aligned sequencing data. Bioinformatics. 34, 1650–1658.

22.

Wan

, Anh

V.N.

, and Asai

2012. Transformations for the compression of FASTQ quality scores of next-generation sequencing data. Bioinformatics. 28, 628–635.

23.

Y.W.

, Yorukoglu

, Peng

, et al. 2015. Quality score compression improves genotyping accuracy. Nat. Biotechnol. 33, 240–243.

24.

Zook

J.M.

, Catoe

, McDaniel

, et al. 2016. Extensive sequencing of seven human genomes to characterize benchmark reference materials. Sci. Data. 3, 160025.

Supplementary Material

Please find the following supplemental material available below.

For Open Access articles published under a Creative Commons License, all supplemental material carries the same license as the article it is associated with.

For non-Open Access articles published, all supplemental material carries a non-exclusive license, and permission requests for re-use of supplemental material or any part of supplemental material shall be sent directly to the copyright owner as specified in the copyright notice associated with the article.

0.00 MB

1.16 MB

A Two-Level Scheme for Quality Score Compression

Abstract

Abstract

Get full access to this article

References

Supplementary Material