BLESS 2: accurate, memory-efficient and fast error correction method

• Published in: Bioinformatics (Oxford, England) Vol. 32; no. 15; pp. 2369 - 2371
• Main Authors: Heo, Yun, Ramachandran, Anand, Hwu, Wen-Mei, Ma, Jian, Chen, Deming
• Format: Journal Article
• Language: English
• Published: England Oxford University Press 01.08.2016
• Subjects: Algorithms; Applications Notes; Computers; High-Throughput Nucleotide Sequencing; Sequence Analysis, DNA; Software
• ISSN: 1367-4803; 1367-4811; 1367-4811
• DOI: 10.1093/bioinformatics/btw146

The most important features of error correction tools for sequencing data are accuracy, memory efficiency and fast runtime. The previous version of BLESS was highly memory-efficient and accurate, but it was too slow to handle reads from large genomes. We have developed a new version of BLESS to improve runtime and accuracy while maintaining a small memory usage. The new version, called BLESS 2, has an error correction algorithm that is more accurate than BLESS, and the algorithm has been parallelized using hybrid MPI and OpenMP programming. BLESS 2 was compared with five top-performing tools, and it was found to be the fastest when it was executed on two computing nodes using MPI, with each node containing twelve cores. Also, BLESS 2 showed at least 11% higher gain while retaining the memory efficiency of the previous version for large genomes. Availability and implementation: Freely available at https://sourceforge.net/projects/bless-ec Contact:  dchen@illinois.edu Supplementary information:  Supplementary data are available at Bioinformatics online.