Slot Machine: A Compression Transform for Multi-FASTA Files
The large size of genome files and their current widespread use in many fields makes compression of these files very important for their efficient storage. However, many compression tools, e.g. gzip, require the entire file to be decompressed before any part can be accessed. With this problem in mind, we introduce a reference-free compression transform for genome files that support compressed pattern matching - namely, the capacity to search the compressed file for information contained in the original file. Our transform, Slot Machine, leverages the distribution of characters in multi-FASTA files to decrease their size by approximately 66% while allowing a user to search and decompress only the parts of the file needed at any given time. As an added bonus, the output of Slot Machine can be further compressed by pairing with existing compressors. In our experiments, we achieved compression-ratios of up to 5.25, or a compression rate of 80.96%. In that measure, our results improved upon NAF in every experiment and are comparable to MFCompress.
Authors
- Gaetan Delavignette (ORCID: https://orcid.org/0000-0002-3242-1454)
- Hanes Barbosa Marques de Oliveira (ORCID: https://orcid.org/0000-0002-7728-4844)
- Luke Harmon (ORCID: https://orcid.org/0000-0003-2564-9394)
- Bhagiradh Kantheti
Publication Details
- Published
- 2024-10-16
- DOI
- https://doi.org/10.1109/ictc62082.2024.10826889
- Primary Topic
- Embedded Systems Design Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00