{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:09:44Z","timestamp":1773274184187,"version":"3.50.1"},"reference-count":23,"publisher":"Oxford University Press (OUP)","issue":"15","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,8,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>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.<\/jats:p>\n               <jats:p>Results: We present existing compression options for quality score data, and then introduce two new lossy techniques. Experiments measuring the trade-off between compression ratio and information loss are reported, including quantifying the effect of lossy representations on a downstream application that carries out single nucleotide polymorphism and insert\/deletion detection. The new methods are demonstrably superior to other techniques when assessed against the spectrum of possible trade-offs between storage required and fidelity of representation.<\/jats:p>\n               <jats:p>Availability and implementation: An implementation of the methods described here is available at https:\/\/github.com\/rcanovas\/libCSAM .<\/jats:p>\n               <jats:p>Contact: \u00a0rcanovas@student.unimelb.edu.au<\/jats:p>\n               <jats:p>Supplementary information: \u00a0Supplementary data are available at Bioinformatics online.<\/jats:p>","DOI":"10.1093\/bioinformatics\/btu183","type":"journal-article","created":{"date-parts":[[2014,4,12]],"date-time":"2014-04-12T02:34:30Z","timestamp":1397270070000},"page":"2130-2136","source":"Crossref","is-referenced-by-count":57,"title":["Lossy compression of quality scores in genomic data"],"prefix":"10.1093","volume":"30","author":[{"given":"Rodrigo","family":"C\u00e1novas","sequence":"first","affiliation":[{"name":"NICTA Victoria Research Laboratory, Department of Computing and Information Systems, The University of Melbourne, Victoria 3010, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alistair","family":"Moffat","sequence":"additional","affiliation":[{"name":"NICTA Victoria Research Laboratory, Department of Computing and Information Systems, The University of Melbourne, Victoria 3010, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Turpin","sequence":"additional","affiliation":[{"name":"NICTA Victoria Research Laboratory, Department of Computing and Information Systems, The University of Melbourne, Victoria 3010, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2014,5,2]]},"reference":[{"key":"2023012711323485700_btu183-B1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.nbt.2008.12.009","article-title":"Next-generation DNA sequencing techniques","volume":"25","author":"Ansorge","year":"2009","journal-title":"N. Biotechnol."},{"key":"2023012711323485700_btu183-B2","article-title":"A block-sorting lossless data compression algorithm","volume-title":"Technical report SRC-RR 124","author":"Burrows","year":"1994"},{"key":"2023012711323485700_btu183-B3","first-page":"51","article-title":"Practical compression for multi-alignment genomic files","volume-title":"Proceedings of 36th Australasian Computer Science Conference","author":"C\u00e1novas","year":"2013"},{"key":"2023012711323485700_btu183-B4","first-page":"300","article-title":"Comprehensive survey on distance\/similarity measures between probability density functions","volume":"1","author":"Cha","year":"2007","journal-title":"Int. J. Math. Models Methods Appl. Sci."},{"key":"2023012711323485700_btu183-B5","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1038\/scientificamerican0106-46","article-title":"Genomes for all","volume":"294","author":"Church","year":"2006","journal-title":"Sci. Am."},{"key":"2023012711323485700_btu183-B6","doi-asserted-by":"crossref","first-page":"1767","DOI":"10.1093\/nar\/gkp1137","article-title":"The Sanger FASTQ file format for sequences with quality scores, and the Solexa\/Illumina FASTQ variants","volume":"38","author":"Cock","year":"2010","journal-title":"Nucleic Acids Res."},{"key":"2023012711323485700_btu183-B7","doi-asserted-by":"crossref","first-page":"2156","DOI":"10.1093\/bioinformatics\/btr330","article-title":"The variant call format and VCFtools","volume":"27","author":"Danecek","year":"2011","journal-title":"Bioinformatics"},{"key":"2023012711323485700_btu183-B8","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1093\/bioinformatics\/btr014","article-title":"Compression of DNA sequence reads in FASTQ format","volume":"27","author":"Deorowicz","year":"2011","journal-title":"Bioinformatics"},{"key":"2023012711323485700_btu183-B9","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","article-title":"Universal codeword sets and representations of the integers","volume":"21","author":"Elias","year":"1975","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2023012711323485700_btu183-B10","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1101\/gr.8.3.186","article-title":"Base-calling of automated sequencer traces using Phred.II. Error probabilities","volume":"8","author":"Ewing","year":"1998","journal-title":"Genome Res."},{"key":"2023012711323485700_btu183-B11","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1101\/gr.114819.110","article-title":"Efficient storage of high throughput DNA sequencing data using reference-based compression","volume":"21","author":"Fritz","year":"2011","journal-title":"Genome Res."},{"key":"2023012711323485700_btu183-B12","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.1093\/bioinformatics\/btp117","article-title":"Textual data compression in computational biology: a synopsis","volume":"25","author":"Giancarlo","year":"2009","journal-title":"Bioinformatics"},{"key":"2023012711323485700_btu183-B13","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1093\/bioinformatics\/btt257","article-title":"Adaptive reference-free compression of sequence quality scores","volume":"30","author":"Janin","year":"2014","journal-title":"Bioinformatics"},{"key":"2023012711323485700_btu183-B14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-12683-3_20","article-title":"Compressing genomic sequence fragments using SLIMGENE","volume-title":"Proceedings of the 14th Annual International Conference on Research in Computational Molecular Biology","author":"Kozanitis","year":"2010"},{"key":"2023012711323485700_btu183-B15","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/18.567644","article-title":"On the role of mismatch in rate distortion theory","volume":"43","author":"Lapidoth","year":"1997","journal-title":"IEEE Tran. Inf. Theory"},{"key":"2023012711323485700_btu183-B16","doi-asserted-by":"crossref","first-page":"2078","DOI":"10.1093\/bioinformatics\/btp352","article-title":"The sequence alignment\/map format and SAMtools","volume":"25","author":"Li","year":"2009","journal-title":"Bioinformatics"},{"key":"2023012711323485700_btu183-B17","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1146\/annurev.genom.9.081307.164359","article-title":"Next-generation DNA sequencing methods","volume":"9","author":"Mardis","year":"2008","journal-title":"Ann. Rev. Genomics Hum. Genet."},{"key":"2023012711323485700_btu183-B18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0935-6","volume-title":"Compression and Coding Algorithms","author":"Moffat","year":"2002"},{"key":"2023012711323485700_btu183-B19","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-1-4614-0782-9_2","article-title":"Overview of sequencing technology platforms","volume-title":"Bioinformatics for High Throughput Sequencing","author":"Myllykangas","year":"2012"},{"key":"2023012711323485700_btu183-B20","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1038\/nrg2986","article-title":"Genotype and SNP calling from next-generation sequencing data","volume":"12","author":"Nielsen","year":"2011","journal-title":"Nat. Rev. Genet."},{"key":"2023012711323485700_btu183-B21","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1186\/1471-2105-14-187","article-title":"QualComp: a new lossy compressor for quality scores based on rate distortion theory","volume":"14","author":"Ochoa","year":"2013","journal-title":"BMC Bioinformatics"},{"key":"2023012711323485700_btu183-B22","doi-asserted-by":"crossref","first-page":"2192","DOI":"10.1093\/bioinformatics\/btq346","article-title":"G-SQZ: compact encoding of genomic sequence and quality data","volume":"26","author":"Tembe","year":"2010","journal-title":"Bioinformatics"},{"key":"2023012711323485700_btu183-B23","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1093\/bioinformatics\/btr689","article-title":"Transformations for the compression of FASTQ quality scores of next-generation sequencing data","volume":"28","author":"Wan","year":"2012","journal-title":"Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/30\/15\/2130\/48925956\/bioinformatics_30_15_2130.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/30\/15\/2130\/48925956\/bioinformatics_30_15_2130.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T11:57:33Z","timestamp":1674820653000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/30\/15\/2130\/2390795"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,2]]},"references-count":23,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2014,8,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btu183","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2014,8,1]]},"published":{"date-parts":[[2014,5,2]]}}}