Tackling the Challenges of FASTQ Referential Compression

ABSTRACT:The exponential growth of genomic data has recently motivated the development of compression algorithms to tackle the storage capacity limitations in bioinformatics centers. Referential compressors could theoretically achieve a much higher compression than their nonreferential counterparts; however, the latest tools have not been able to harness such potential yet. To reach such goal, an efficient encoding model to represent the differences between the input and the reference is needed. In this article, we introduce a novel approach for referential compression of FASTQ files. The core of our compression scheme consists of a referential compressor based on the combination of local alignments with binary encoding optimized for long reads. Here we present the algorithms and performance tests developed for our reads compression algorithm, named UdeACompress. Our compressor achieved the best results when compressing long reads and competitive compression ratios for shorter reads when compared to the best programs in the state of the art. As an added value, it also showed reasonable execution times and memory consumption, in comparison with similar tools.

• Autores: Guerra Soler, Aníbal José; Lotero García, Jaime Andrés; Aedo Cobo, José Édinson; Isaza Ramírez, Sebastián
• Tipo de recurso: Article of investigation
• Fecha de publicación: 2019
• Institución: Universidad de Antioquia
• Repositorio: Repositorio UdeA
• Idioma: eng
• OAI Identifier: oai:bibliotecadigital.udea.edu.co:10495/35246
• Acceso en línea: https://hdl.handle.net/10495/35246
• Palabra clave: Bioinformática; Bioinformatics; Compresión de datos (computadores); Data compression (computer science); Teoría de la codificación; Coding theory
• Rights: openAccess
• License: http://creativecommons.org/licenses/by-nc/2.5/co/