Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs - Archive ouverte HAL Access content directly
Journal Articles Bioinformatics Year : 2019

Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs

Vers des sequences parfaites: correction de donnée de sequencage de seconde generation via alignement sur graphe de De Bruijn

(1) , (2) , (3)
1
2
3

Abstract

Motivations Short-read accuracy is important for downstream analyses such as genome assembly and hybrid long-read correction. Despite much work on short-read correction, present-day correctors either do not scale well on large data sets or consider reads as mere suites of k-mers, without taking into account their full-length read information. Results We propose a new method to correct short reads using de Bruijn graphs, and implement it as a tool called Bcool. As a first step, Bcool constructs a compacted de Bruijn graph from the reads. This graph is filtered on the basis of k-mer abundance then of unitig abundance, thereby removing from most sequencing errors. The cleaned graph is then used as a reference on which the reads are mapped to correct them. We show that this approach yields more accurate reads than k-mer-spectrum correctors while being scalable to human-size genomic datasets and beyond. Availability and Implementation
Fichier principal
Vignette du fichier
main.pdf (518.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02407243 , version 1 (12-12-2019)

Identifiers

Cite

Antoine Limasset, Jean-François Flot, Pierre Peterlongo. Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs. Bioinformatics, 2019, ⟨10.1093/bioinformatics/btz102⟩. ⟨hal-02407243⟩
135 View
232 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More