Research index
FFC: A Scalable FASTA Compressor - Source code
Grabowski, Kowalski, Susik
Zenodo (CERN European Organization for Nuclear Research)24 Feb 2026Open access
NobleIDark:/48914/w1/20261006/8D2D165FDOI10.5281/zenodo.18892353
FFC: A Scalable FASTA Compressor - Source code
Grabowski, Kowalski, Susik · Zenodo (CERN European Organization for Nuclear Research) · 2026
NobleIDark:/48914/w1/20261006/8D2D165FDOI10.5281/zenodo.18892353
Free to read at the publisher
You can read the abstract here, or the full text at the publisher.
Abstract
Fast FASTA Compressor (FFC) is a tool designed for compressing FASTA files. It is focused on speed and for non-redundant (or mildly redundant) DNA sequences it basically packs fours of nucleotides into bytes. If, however, data seem compressible, like for e.g. virus strains, it makes use of a fast zstd mode. We point, however, that FFC accepts any input, and for example its performance on a tar genomic archive is essentially not worse than on its raw (FASTA) contents (and if the genomes within the tar are similar, and small enough to fit a block, may even be better due to exploited repetitions). FFC compression and decompression speed is often around 1500-2000 MB/s on an SSD, and above 3000 MB/s in RAM memory. Major features and properties: supports FASTA files as input and output, allows for ambiguous IUPAC codes, masked sequences, and has no limit on sequence length or the number of sequences, is fully lossless (even for input with irregular EOL locations), supports standard input and output during (de)compression, which makes it easy to integrate into pipelines, applies zstd backend compression for selected streams, allows to set the number of (de)compression threads; the output archive is the same no matter the number of chosen compression worker threads, works on moderately-sized blocks of data (4 MB per thread by default), keeping thus the memory usage low, regardless of the input/output size, supports higher memory usage in order to (hopefully) boost compression ratios.