henhaobio
Sign in

BioinformaticsBioinformaticsPeer-reviewed journal article

RENANO: a REference-based compressor for NANOpore FASTQ files

Guillermo Dufort y ÁlvareziD, G. SeroussiiD, Pablo SmircichiD, José Roberto Sotelo-SilveiraiD, Idoia OchoaiD, Álvaro MartíniD

PDFDOIPreprintCode

Abstract

Nanopore sequencing technologies are rapidly gaining popularity, in part, due to the massive amounts of genomic data they produce in short periods of time (up to 8.5 TB of data in less than 72 hours). In order to reduce the costs of transmission and storage, efficient compression methods for this type of data are needed. Unlike short-read technologies, nanopore sequencing generates long noisy reads of variable length. In this note we introduce RENANO, a reference-based lossless FASTQ data compressor, specifically tailored to compress FASTQ files generated with nanopore sequencing technologies. RENANO builds on the recent compressor ENANO, which is the current state of the art. RENANO focuses on improving the compression of the base call sequence portion of the FASTQ file, leaving the other parts of ENANO intact. Two novel reference-based compression algorithms are introduced, contemplating different scenarios: in the first scenario, a reference genome is available without cost to both the compressor and the decompressor; in the second, the reference genome is available only on the compressor side, and a compacted version of the reference is transmitted to the decompressor as part of the compressed file. To evaluate the proposed algorithms, we compare RENANO against ENANO on several publicly available nanopore datasets. In the first scenario considered, RENANO improves the base call sequences compression of ENANO by 39.8%, on average, over all the datasets. As for total compression (including the other parts of the FASTQ file), the average improvement is 12.7%. In the second scenario considered, the base call compression improvements of RENANO over ENANO range from 15.2% to 49.0%, depending on the coverage of the compressed dataset, while in terms of total size, the improvements range from 5.1% to 16.5%. Implementations of the proposed algorithms are freely available for download at https://github.com/guilledufort/RENANO.

Citations
17
FWCI
1.14
Field percentile
top 21%

Reproducibility ledger

Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.

Sign in to file a reproducibility report.

Similarity Map
SelectedSame fieldCross-field
THISMeng '23Chandak '20Jayasooriya '25Rivara-Espa '22Nazari '24Roguski '18
88% semantic matchBioinformatics
Qingxi Meng, Shubham Chandak, Yifan Zhu+1 more·Scientific Reports·Feb 6, 2023· 12 citations