{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T05:23:50Z","timestamp":1744089830328,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,12,20]],"date-time":"2021-12-20T00:00:00Z","timestamp":1639958400000},"content-version":"vor","delay-in-days":19,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003708","name":"korea institute of science and technology information","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003708","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:sec>\n                <jats:title>Background<\/jats:title>\n                <jats:p>Advances in sequencing technology have drastically reduced sequencing costs. As a result, the amount of sequencing data increases explosively. Since FASTQ files (standard sequencing data formats) are huge, there is a need for efficient compression of FASTQ files, especially quality scores. Several quality scores compression algorithms are recently proposed, mainly focused on lossy compression to boost the compression rate further. However, for clinical applications and archiving purposes, lossy compression cannot replace lossless compression. One of the main challenges for lossless compression is time complexity, where it takes thousands of seconds to compress a 1\u00a0GB file. Also, there are desired features for compression algorithms, such as random access. Therefore, there is a need for a fast lossless compressor with a reasonable compression rate and random access functionality.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Results<\/jats:title>\n                <jats:p>This paper proposes a Fast and Concurrent Lossless Quality scores Compressor (FCLQC) that supports random access and achieves a lower running time based on concurrent programming. Experimental results reveal that FCLQC is significantly faster than the baseline compressors on compression and decompression at the expense of compression ratio. Compared to LCQS (baseline quality score compression algorithm), FCLQC shows at least 31x compression speed improvement in all settings, where a performance degradation in compression ratio is up to 13.58% (8.26% on average). Compared to general-purpose compressors (such as 7-zip), FCLQC shows 3x faster compression speed while having better compression ratios, at least 2.08% (4.69% on average). Moreover, the speed of random access decompression also outperforms the others. The concurrency of FCLQC is implemented using Rust; the performance gain increases near-linearly with the number of threads.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Conclusion<\/jats:title>\n                <jats:p>The superiority of compression and decompression speed makes FCLQC a practical lossless quality score compressor candidate for speed-sensitive applications of DNA sequencing data. FCLQC is available at <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/Minhyeok01\/FCLQC\">https:\/\/github.com\/Minhyeok01\/FCLQC<\/jats:ext-link> and is freely available for non-commercial usage.<\/jats:p>\n              <\/jats:sec>","DOI":"10.1186\/s12859-021-04516-7","type":"journal-article","created":{"date-parts":[[2021,12,20]],"date-time":"2021-12-20T10:03:12Z","timestamp":1639994592000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["FCLQC: fast and concurrent lossless quality scores compressor"],"prefix":"10.1186","volume":"22","author":[{"given":"Minhyeok","family":"Cho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6346-4182","authenticated-orcid":false,"given":"Albert","family":"No","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,20]]},"reference":[{"issue":"7333","key":"4516_CR1","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1038\/nature09796","volume":"470","author":"ER Mardis","year":"2011","unstructured":"Mardis ER. A decade\u2019s perspective on DNA sequencing technology. Nature. 2011;470(7333):198\u2013203.","journal-title":"Nature"},{"issue":"7","key":"4516_CR2","doi-asserted-by":"publisher","first-page":"1002195","DOI":"10.1371\/journal.pbio.1002195","volume":"13","author":"ZD Stephens","year":"2015","unstructured":"Stephens ZD, Lee SY, Faghri F, Campbell RH, Zhai C, Efron MJ, Iyer R, Schatz MC, Sinha S, Robinson GE. Big data: astronomical or genomical? PLoS Biol. 2015;13(7):1002195.","journal-title":"PLoS Biol"},{"issue":"15","key":"4516_CR3","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1093\/bioinformatics\/bty1015","volume":"35","author":"S Chandak","year":"2019","unstructured":"Chandak S, Tatwawadi K, Ochoa I, Hernaez M, Weissman T. Spring: a next-generation compressor for FASTQ data. Bioinformatics. 2019;35(15):2674\u20136.","journal-title":"Bioinformatics"},{"issue":"11","key":"4516_CR4","doi-asserted-by":"publisher","first-page":"0224806","DOI":"10.1371\/journal.pone.0224806","volume":"14","author":"S Al Yami","year":"2019","unstructured":"Al Yami S, Huang C-H. LFastqC: a lossless non-reference-based FASTQ compressor. PLoS ONE. 2019;14(11):0224806.","journal-title":"PLoS ONE"},{"issue":"1","key":"4516_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-019-56847-4","volume":"10","author":"S Deorowicz","year":"2020","unstructured":"Deorowicz S. FQSqueezer: k-mer-based compression of sequencing data. Sci Rep. 2020;10(1):1\u20139.","journal-title":"Sci Rep"},{"issue":"3","key":"4516_CR6","doi-asserted-by":"publisher","first-page":"59190","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):59190.","journal-title":"PLoS ONE"},{"key":"4516_CR7","doi-asserted-by":"crossref","unstructured":"Hernaez M, Ochoa I, Weissman T. A cluster-based approach to compression of quality scores. In: 2016 data compression conference (DCC). IEEE; 2016. p. 261\u201370.","DOI":"10.1109\/DCC.2016.49"},{"issue":"19","key":"4516_CR8","doi-asserted-by":"publisher","first-page":"3122","DOI":"10.1093\/bioinformatics\/btv330","volume":"31","author":"G Malysa","year":"2015","unstructured":"Malysa G, Hernaez M, Ochoa I, Rao M, Ganesan K, Weissman T. QVZ: lossy compression of quality values. Bioinformatics. 2015;31(19):3122\u20139.","journal-title":"Bioinformatics"},{"issue":"2","key":"4516_CR9","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1093\/bioinformatics\/bty608","volume":"35","author":"JK Bonfield","year":"2019","unstructured":"Bonfield JK, McCarthy SA, Durbin R. Crumble: reference free lossy compression of sequence quality values. Bioinformatics. 2019;35(2):337\u20139.","journal-title":"Bioinformatics"},{"key":"4516_CR10","doi-asserted-by":"crossref","unstructured":"Voges J, Hernaez M, Mattavelli M, Ostermann J. An introduction to MPEG-G: The first open ISO\/IEC standard for the compression and exchange of genomic sequencing data. In: Proceedings of the IEEE; 2021.","DOI":"10.1109\/JPROC.2021.3082027"},{"issue":"20","key":"4516_CR11","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"},{"issue":"1","key":"4516_CR12","doi-asserted-by":"publisher","first-page":"2047","DOI":"10.1186\/2047-217X-1-2","volume":"1","author":"G Cochrane","year":"2012","unstructured":"Cochrane G, Cook CE, Birney E. The future of DNA sequence archiving. GigaScience. 2012;1(1):2047\u2013217.","journal-title":"GigaScience"},{"issue":"3","key":"4516_CR13","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. 2018;34(3):425\u201333.","journal-title":"Bioinformatics"},{"issue":"1","key":"4516_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-019-3325-0","volume":"21","author":"J Fu","year":"2020","unstructured":"Fu J, Ke B, Dong S. LCQS: an efficient lossless compression tool of quality scores with random access functionality. BMC Bioinform. 2020;21(1):1\u201312.","journal-title":"BMC Bioinform"},{"key":"4516_CR15","unstructured":"Klabnik S, Nichols C. The rust programming language; 2018. https:\/\/doc.rust-lang.org\/book\/ch16-00-concurrency.html."},{"key":"4516_CR16","unstructured":"Research M. Rust; 2010. https:\/\/www.rust-lang.org\/."},{"key":"4516_CR17","unstructured":"Fulton KR, Chan A, Votipka D, Hicks M, Mazurek ML. Benefits and drawbacks of adopting a secure programming language: rust as a case study. In: Seventeenth symposium on usable privacy and security ($$\\{$$SOUPS$$\\}$$ 2021); 2021. p. 597\u2013616."},{"issue":"7836","key":"4516_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1038\/d41586-020-03382-2","volume":"588","author":"JM Perkel","year":"2020","unstructured":"Perkel JM. Why scientists are turning to rust. Nature. 2020;588(7836):185\u20136.","journal-title":"Nature"},{"key":"4516_CR19","unstructured":"Stack Overflow Developer Survey 2020. https:\/\/insights.stackoverflow.com\/survey\/2020."},{"issue":"3","key":"4516_CR20","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1093\/bioinformatics\/btv573","volume":"32","author":"J K\u00f6ster","year":"2016","unstructured":"K\u00f6ster J. Rust-bio: a fast and safe bioinformatics library. Bioinformatics. 2016;32(3):444\u20136.","journal-title":"Bioinformatics"},{"issue":"1","key":"4516_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1038\/nrg2626","volume":"11","author":"ML Metzker","year":"2010","unstructured":"Metzker ML. Sequencing technologies\u2014the next generation. Nat Rev Genet. 2010;11(1):31\u201346.","journal-title":"Nat Rev Genet"},{"issue":"4","key":"4516_CR22","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1373\/clinchem.2008.112789","volume":"55","author":"KV Voelkerding","year":"2009","unstructured":"Voelkerding KV, Dames SA, Durtschi JD. Next-generation sequencing: from basic research to diagnostics. Clin Chem. 2009;55(4):641\u201358.","journal-title":"Clin Chem"},{"issue":"1","key":"4516_CR23","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.nantod.2012.12.008","volume":"8","author":"F Haque","year":"2013","unstructured":"Haque F, Li J, Wu H-C, Liang X-J, Guo P. Solid-state and biological nanopore for real-time sensing of single chemical and sequencing of DNA. Nano Today. 2013;8(1):56\u201374.","journal-title":"Nano Today"},{"issue":"7","key":"4516_CR24","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1016\/j.chembiol.2010.07.004","volume":"17","author":"A McCarthy","year":"2010","unstructured":"McCarthy A. Third generation DNA sequencing: pacific biosciences\u2019 single molecule real time technology. Chem Biol. 2010;17(7):675\u20136.","journal-title":"Chem Biol"},{"issue":"1","key":"4516_CR25","first-page":"44","volume":"8","author":"N Rusk","year":"2011","unstructured":"Rusk N. Torrents of sequence. Nat Methods. 2011;8(1):44\u201344.","journal-title":"Nat Methods"},{"key":"4516_CR26","unstructured":"Massingham T. simNGS\u2014software for simulating next generation sequencing data; 2012. https:\/\/www.ebi.ac.uk\/goldman-srv\/simNGS\/."},{"issue":"19","key":"4516_CR27","doi-asserted-by":"publisher","first-page":"2787","DOI":"10.1093\/bioinformatics\/btu345","volume":"30","author":"A Talwalkar","year":"2014","unstructured":"Talwalkar A, Liptrap J, Newcomb J, Hartl C, Terhorst J, Curtis K, Bresler M, Song YS, Jordan MI, Patterson D. SM a SH: a benchmarking toolkit for human genome variant calling. Bioinformatics. 2014;30(19):2787\u201395.","journal-title":"Bioinformatics"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-021-04516-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s12859-021-04516-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-021-04516-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,20]],"date-time":"2021-12-20T10:03:52Z","timestamp":1639994632000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-021-04516-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["4516"],"URL":"https:\/\/doi.org\/10.1186\/s12859-021-04516-7","relation":{},"ISSN":["1471-2105"],"issn-type":[{"type":"electronic","value":"1471-2105"}],"subject":[],"published":{"date-parts":[[2021,12]]},"assertion":[{"value":"20 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2021","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":"606"}}