{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T02:42:01Z","timestamp":1769827321954,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T00:00:00Z","timestamp":1658534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T00:00:00Z","timestamp":1658534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61861045"],"award-info":[{"award-number":["61861045"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:sec><jats:title>Background<\/jats:title><jats:p>Over the past few decades, the emergence and maturation of new technologies have substantially reduced the cost of genome sequencing. As a result, the amount of genomic data that needs to be stored and transmitted has grown exponentially. For the standard sequencing data format, FASTQ, compression of the quality score is a key and difficult aspect of FASTQ file compression. Throughout the literature, we found that the majority of the current quality score compression methods do not support random access. Based on the above consideration, it is reasonable to investigate a lossless quality score compressor with a high compression rate, a fast compression and decompression speed, and support for random access.<\/jats:p><\/jats:sec><jats:sec><jats:title>Results<\/jats:title><jats:p>In this paper, we propose CMIC, an adaptive and random access supported compressor for lossless compression of quality score sequences. CMIC is an acronym of the four steps (classification, mapping, indexing and compression) in the paper. Its framework consists of the following four parts: classification, mapping, indexing, and compression. The experimental results show that our compressor has good performance in terms of compression rates on all the tested datasets. The file sizes are reduced by up to 21.91% when compared with LCQS. In terms of compression speed, CMIC is better than all other compressors on most of the tested cases. In terms of random access speed, the CMIC is faster than the LCQS, which provides a random access function for compressed quality scores.<\/jats:p><\/jats:sec><jats:sec><jats:title>Conclusions<\/jats:title><jats:p>CMIC is a compressor that is especially designed for quality score sequences, which has good performance in terms of compression rate, compression speed, decompression speed, and random access speed. The CMIC can be obtained in the following way:<jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/Humonex\/Cmic\">https:\/\/github.com\/Humonex\/Cmic<\/jats:ext-link>.<\/jats:p><\/jats:sec>","DOI":"10.1186\/s12859-022-04837-1","type":"journal-article","created":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T11:02:43Z","timestamp":1658574163000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["CMIC: an efficient quality score compressor with random access functionality"],"prefix":"10.1186","volume":"23","author":[{"given":"Hansen","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3637-2565","authenticated-orcid":false,"given":"Jianhua","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiwen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rongshu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,23]]},"reference":[{"key":"4837_CR1","unstructured":"https:\/\/www.illumina.com\/systems\/hiseq-x-sequencing-system.html."},{"key":"4837_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1146\/annurev-biodatasci-072018-021229","volume":"2","author":"H Mikel","year":"2019","unstructured":"Mikel H, Dmitri P, et al. Genomic data compression. Annu Rev Biomed Data Sci. 2019;2:19\u201337.","journal-title":"Annu Rev Biomed Data Sci"},{"issue":"1","key":"4837_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/nrg2626","volume":"11","author":"ML Metzker","year":"2010","unstructured":"Metzker ML. Sequencing technologies the next generation. Nat Rev Genet. 2010;11(1):1\u201313.","journal-title":"Nat Rev Genet"},{"issue":"3","key":"4837_CR4","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0059190","volume":"8","author":"JK Bonfield","year":"2013","unstructured":"Bonfield JK, Mahoney MV. Compression of FASTQ and SAM format sequencing data. PLoS ONE. 2013;8(3): e59190.","journal-title":"PLoS ONE"},{"key":"4837_CR5","unstructured":"Mount DW. Bioinformatics: sequence and genome analysis. Cold Spring Harbor Laboratory Press;2001."},{"key":"4837_CR6","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1038\/nbt.4079","volume":"36","author":"L Organick","year":"2018","unstructured":"Organick L, Ang SD, Chen YJ, et al. Random access in large-scale DNA data storage. Nat Biotechnol. 2018;36:242\u20138.","journal-title":"Nat Biotechnol"},{"key":"4837_CR7","first-page":"390","volume":"3","author":"G Raffaele","year":"2014","unstructured":"Raffaele G, Rombo SE, Filippo U. Compressive biological sequence analysis and archival in the era of high-throughput sequencing technologies. Brief Bioinform. 2014;3:390\u2013406.","journal-title":"Brief Bioinform"},{"issue":"3","key":"4837_CR8","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1093\/bioinformatics\/btx607","volume":"34","author":"T Paridaens","year":"2018","unstructured":"Paridaens T, Van Wallendael G, De Neve W, Lambert P. AQUa: an adaptive framework for compression of sequencing quality scores with random access functionality. Bioinformatics (Oxford, England). 2018;34(3):425\u201333.","journal-title":"Bioinformatics (Oxford, England)"},{"key":"4837_CR9","doi-asserted-by":"crossref","unstructured":"Alberti C, Daniels N, Hernaez M, et al. An evaluation framework for lossy compression of genome sequencing quality values. Data Compression Conference. Proc Data Compress Conf, 2016; 221\u2013230.","DOI":"10.1109\/DCC.2016.39"},{"issue":"19","key":"4837_CR10","doi-asserted-by":"publisher","first-page":"3122","DOI":"10.1093\/bioinformatics\/btv330","volume":"31","author":"M Hernaez","year":"2015","unstructured":"Hernaez M, Ochoa I, Rao M, Ganesan K, Weissmans T. Qvz: lossy compression of quality values. Bioinformatics. 2015;31(19):3122\u20139.","journal-title":"Bioinformatics"},{"issue":"15","key":"4837_CR11","doi-asserted-by":"publisher","first-page":"2130","DOI":"10.1093\/bioinformatics\/btu183","volume":"30","author":"C Rodrigo","year":"2014","unstructured":"Rodrigo C, Alistair M, Andrew T. Lossy compression of quality scores in genomic data. Bioinformatics. 2014;30(15):2130\u20136.","journal-title":"Bioinformatics"},{"issue":"15","key":"4837_CR12","doi-asserted-by":"publisher","first-page":"2213","DOI":"10.1093\/bioinformatics\/btu208","volume":"30","author":"R Lukasz","year":"2014","unstructured":"Lukasz R, Sebastian D. DSRC2\u2013Industry-oriented compression of FASTQ files. Bioinformatics (Oxford, England). 2014;30(15):2213\u20135.","journal-title":"Bioinformatics (Oxford, England)"},{"key":"4837_CR13","doi-asserted-by":"crossref","unstructured":"Huang ZA, Wen Z, Deng Q, et al. LW-FQZip 2: a parallelized reference-based compression of FASTQ files. BMC Bioinf 2017;18(1).","DOI":"10.1186\/s12859-017-1588-x"},{"issue":"20","key":"4837_CR14","doi-asserted-by":"publisher","first-page":"3276","DOI":"10.1093\/bioinformatics\/btv384","volume":"31","author":"M Nicolae","year":"2015","unstructured":"Nicolae M, Pathak S, Rajasekaran S. LFQC: a lossless compression algorithm for fastq files. Bioinformatics. 2015;31(20):3276\u201381.","journal-title":"Bioinformatics"},{"key":"4837_CR15","unstructured":"http:\/\/www.gzip.org."},{"key":"4837_CR16","unstructured":"http:\/\/www.7-zip.org\/sdk.html."},{"issue":"23","key":"4837_CR17","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1093\/bioinformatics\/bts593","volume":"28","author":"H Faraz","year":"2012","unstructured":"Faraz H, et al. SCALCE: boosting sequence compression algorithms using locally consistent encoding. Bioinformatics (Oxford, England). 2012;28(23):3051\u20137.","journal-title":"Bioinformatics (Oxford, England)"},{"key":"4837_CR18","unstructured":"Sahinalp SC, Vishkin U. Efficient approximate and dynamic matching of patterns using a labeling paradigm. Symposium on Foundations of Computer Science. IEEE, 1996."},{"key":"4837_CR19","unstructured":"Graham Cormode et al. Communication complexity of document exchange, 2000."},{"key":"4837_CR20","unstructured":"Tu\u011fkan B, Funda E, Cenk S. Oblivious string embeddings and edit distance approximations. Discrete algorithm 2006."},{"issue":"24","key":"4837_CR21","doi-asserted-by":"publisher","first-page":"3709","DOI":"10.1093\/bioinformatics\/btw543","volume":"32","author":"C Rodrigo","year":"2016","unstructured":"Rodrigo C, Alistair M, Andrew T. CSAM: compressed SAM format. Bioinformatics (Oxford, England). 2016;32(24):3709\u201316.","journal-title":"Bioinformatics (Oxford, England)"},{"key":"4837_CR22","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1093\/bioinformatics\/btx001","volume":"33","author":"T Paridaens","year":"2017","unstructured":"Paridaens T, et al. AFRESh: an adaptive framework for compression of reads and assembled sequences with random access functionality. Bioinformatics. 2017;33:1464\u201372.","journal-title":"Bioinformatics"},{"key":"4837_CR23","doi-asserted-by":"crossref","unstructured":"Marpe D, Schwarz H, Wiegand T. Context-based adaptive binary arithmetic coding in the H.264\/AVC video compression standard. IEEE Trans Circuits Syst Video Technol 2003;13(7):620\u2013636.","DOI":"10.1109\/TCSVT.2003.815173"},{"key":"4837_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06895-4","volume-title":"High efficiency video coding (HEVC): algorithms and architectures","author":"V Sze","year":"2014","unstructured":"Sze V, Budagavi M, Sullivan GJ, et al. High efficiency video coding (HEVC): algorithms and architectures. Berlin: Springer Publishing Company; 2014."},{"key":"4837_CR25","doi-asserted-by":"crossref","unstructured":"Fu J, Ke B, Dong S. LCQS: an efficient lossless compression tool of quality scores with random access functionality. BMC Bioinf 2020;21(1).","DOI":"10.1186\/s12859-020-3428-7"},{"key":"4837_CR26","unstructured":"http:\/\/mattmahoney.net\/dc\/zpaq.html."},{"issue":"1","key":"4837_CR27","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1186\/s12859-021-04516-7","volume":"22","author":"M Cho","year":"2021","unstructured":"Cho M, No A. FCLQC: fast and concurrent lossless quality scores compressor. BMC Bioinf. 2021;22(1):606.","journal-title":"BMC Bioinf"},{"key":"4837_CR28","unstructured":"\u0141ukasz R, Paolo R. CARGO: effective format-free compressed storage of genomic information. Nucleic Acids Research, 201612:e114\u2013e114."}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-022-04837-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s12859-022-04837-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-022-04837-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,12]],"date-time":"2023-02-12T12:15:30Z","timestamp":1676204130000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-022-04837-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,23]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["4837"],"URL":"https:\/\/doi.org\/10.1186\/s12859-022-04837-1","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,23]]},"assertion":[{"value":"17 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The ethic approval is not required since we used publicly available datasets.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"294"}}