{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T22:45:30Z","timestamp":1774997130646,"version":"3.50.1"},"reference-count":10,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T00:00:00Z","timestamp":1774310400000},"content-version":"vor","delay-in-days":24,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Lodz University of Technology, Faculty of EECCE"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,2,28]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:sec>\n                    <jats:title>Summary<\/jats:title>\n                    <jats:p>FASTA is a widely used text-based format for storing nucleotide and protein sequences. The existing FASTA compressors usually focus on (slightly) improving the compression ratio, not on practical performance. We present FFC, a scalable FASTA compressor that achieves average compression speeds 4.7\u00d7 and 11.4\u00d7 higher than two high-performance compressors, zstd and NAF, respectively, across a benchmark set of seven single genomes. It also delivers average decompression speeds 3.5\u00d7 and 2.7\u00d7 higher than zstd and NAF, respectively. Although a chunk-based zstd variant with parallel decompression, pzstd, almost matches FFC speed, its compression ratio is on average by 23% worse than FFC\u2019s. For the experiment, a 14-core workstation and a RAM disk (to reduce the impact of I\/O) were used.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Availability and implementation<\/jats:title>\n                    <jats:p>FFC is freely available at github.com\/kowallus\/ffc and also as a Zenodo repository at 10.5281\/zenodo.18892353, and the used datasets at 10.5281\/zenodo.18873744.<\/jats:p>\n                  <\/jats:sec>","DOI":"10.1093\/bioinformatics\/btag132","type":"journal-article","created":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T12:43:13Z","timestamp":1773924193000},"source":"Crossref","is-referenced-by-count":0,"title":["FFC: a scalable FASTA compressor"],"prefix":"10.1093","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1714-1224","authenticated-orcid":false,"given":"Szymon","family":"Grabowski","sequence":"first","affiliation":[{"name":"Institute of Applied Computer Science, Lodz University of Technology , \u0141\u00f3d\u017a, 90-537,","place":["Poland"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0953-3762","authenticated-orcid":false,"given":"Tomasz M","family":"Kowalski","sequence":"additional","affiliation":[{"name":"Institute of Applied Computer Science, Lodz University of Technology , \u0141\u00f3d\u017a, 90-537,","place":["Poland"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0653-433X","authenticated-orcid":false,"given":"Robert","family":"Susik","sequence":"additional","affiliation":[{"name":"Institute of Applied Computer Science, Lodz University of Technology , \u0141\u00f3d\u017a, 90-537,","place":["Poland"]}]}],"member":"286","published-online":{"date-parts":[[2026,3,23]]},"reference":[{"key":"2026033117463324800_btag132-B1","first-page":"43","author":"Cao","year":"2007"},{"key":"2026033117463324800_btag132-B2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1186\/1748-7188-8-25","article-title":"Data compression for sequencing data","volume":"8","author":"Deorowicz","year":"2013","journal-title":"Algorithms Mol Biol"},{"key":"2026033117463324800_btag132-B3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.3390\/info7040056","article-title":"A survey on data compression methods for biological sequences","volume":"7","author":"Hosseini","year":"2016","journal-title":"Information"},{"key":"2026033117463324800_btag132-B4","doi-asserted-by":"crossref","first-page":"giag008","DOI":"10.1093\/gigascience\/giag008","article-title":"MBGC2: boosting compression via efficient encoding of approximate matches in genome collections","volume":"15","author":"Kowalski","year":"2026","journal-title":"GigaScience"},{"key":"2026033117463324800_btag132-B5","doi-asserted-by":"crossref","first-page":"3826","DOI":"10.1093\/bioinformatics\/btz144","article-title":"Nucleotide archival format (NAF) enables efficient lossless reference-free compression of DNA sequences","volume":"35","author":"Kryukov","year":"2019","journal-title":"Bioinformatics"},{"key":"2026033117463324800_btag132-B6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/gigascience\/giaa072","article-title":"Sequence compression benchmark (SCB) database\u2014a comprehensive evaluation of reference-free compressors for FASTA-formatted sequences","volume":"9","author":"Kryukov","year":"2020","journal-title":"Gigascience"},{"key":"2026033117463324800_btag132-B7","doi-asserted-by":"crossref","first-page":"2225","DOI":"10.1093\/bioinformatics\/btab102","article-title":"Genozip: a universal extensible genomic data compressor","volume":"37","author":"Lan","year":"2021","journal-title":"Bioinformatics"},{"key":"2026033117463324800_btag132-B8","first-page":"137","author":"Pratas","year":"2019"},{"key":"2026033117463324800_btag132-B9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/gigascience\/giaa119","article-title":"Efficient DNA sequence compression with neural networks","volume":"9","author":"Silva","year":"2020","journal-title":"Gigascience"},{"key":"2026033117463324800_btag132-B10","doi-asserted-by":"crossref","first-page":"btae725","DOI":"10.1093\/bioinformatics\/btae725","article-title":"JARVIS3: an efficient encoder for genomic data","volume":"40","author":"Sousa","year":"2024","journal-title":"Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/advance-article-pdf\/doi\/10.1093\/bioinformatics\/btag132\/67486014\/btag132.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/advance-article-pdf\/doi\/10.1093\/bioinformatics\/btag132\/67486014\/btag132.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/advance-article-pdf\/doi\/10.1093\/bioinformatics\/btag132\/67486014\/btag132.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:46:39Z","timestamp":1774993599000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/doi\/10.1093\/bioinformatics\/btag132\/8538003"}},"subtitle":[],"editor":[{"given":": Macha","family":"Nikolski","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2026,2,28]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,2,28]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btag132","relation":{},"ISSN":["1367-4803","1367-4811"],"issn-type":[{"value":"1367-4803","type":"print"},{"value":"1367-4811","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2026,3]]},"published":{"date-parts":[[2026,2,28]]},"article-number":"btag132"}}