Hybrid correction of highly noisy long reads using a variable‐order de Bruijn graph

Motivation: The recent rise of long read sequencing technologies such as Pacific Biosciences and Oxford Nanopore allows to solve assembly problems for larger and more complex genomes than what allowed short reads technologies. However, these long reads are very noisy, reaching an error rate of around 10‐15% for Pacific Biosciences, and up to 30% for Oxford Nanopore. The error correction problem has been tackled by either self‐correcting the long reads, or using complementary short reads in a hybrid approach. However, even though sequencing technologies promise to lower the error rate of the long reads below 10%, it is still higher in practice, and correcting such noisy long reads remains an issue. Results: We present HG‐CoLoR, a hybrid error correction method that focuses on a seed‐and‐extend approach based on the alignment of the short reads to the long reads, followed by the traversal of a variable‐order de Bruijn graph, built from the short reads. Our experiments show that HG‐CoLoR manages to efficiently correct highly noisy long reads that display an error rate as high as 44%. When compared to other state‐of‐the‐art long read error correction methods, our experiments also show that HG‐CoLoR provides the best trade‐off between runtime and quality of the results, and is the only method able to efficiently scale to eukaryotic genomes. Availability and implementation: HG‐CoLoR is implemented is C++, supported on Linux platforms and freely available at https://github.com/morispi/HG‐CoLoR. Supplementary information: Supplementary data are available at Bioinformatics online.

[1]  Esko Ukkonen,et al.  Accurate self-correction of errors in long reads using de Bruijn graphs , 2016, Bioinform..

[2]  J. Landolin,et al.  Assembling Large Genomes with Single-Molecule Sequencing and Locality Sensitive Hashing , 2014 .

[3]  Leena Salmela,et al.  LoRDEC: accurate and efficient long read error correction , 2014, Bioinform..

[4]  Sebastian Deorowicz,et al.  KMC 3: counting and manipulating k‐mer statistics , 2017, Bioinform..

[5]  Piet Demeester,et al.  Jabba: hybrid error correction for long sequencing reads , 2015, Algorithms for Molecular Biology.

[6]  Tomasz Marek Kowalski,et al.  Indexing Arbitrary-Length k-Mers in Sequencing Reads , 2015, PloS one.

[7]  Leping Li,et al.  ART: a next-generation sequencing read simulator , 2012, Bioinform..

[8]  Richard Durbin,et al.  Fast and accurate long-read alignment with Burrows–Wheeler transform , 2010, Bioinform..

[9]  Richard Durbin,et al.  Sequence analysis Fast and accurate short read alignment with Burrows – Wheeler transform , 2009 .

[10]  Glenn Tesler,et al.  Mapping single molecule sequencing reads using basic local alignment with successive refinement (BLASR): application and theory , 2012, BMC Bioinformatics.

[11]  Sara Goodwin,et al.  Oxford Nanopore sequencing, hybrid error correction, and de novo assembly of a eukaryotic genome , 2015, bioRxiv.

[12]  S. Koren,et al.  Canu: scalable and accurate long-read assembly via adaptive k-mer weighting and repeat separation , 2016, bioRxiv.

[13]  Christina Boucher,et al.  Variable-Order de Bruijn Graphs , 2014, 2015 Data Compression Conference.

[14]  Ergude Bao,et al.  HALC: High throughput algorithm for long read error correction , 2017, BMC Bioinformatics.

[15]  Esko Ukkonen,et al.  Accurate selfcorrection of errors in long reads using de Bruijn graphs , 2016 .

[16]  James A. Yorke,et al.  QuorUM: An Error Corrector for Illumina Reads , 2013, PloS one.

[17]  Aaron A. Klammer,et al.  Nonhybrid, finished microbial genome assemblies from long-read SMRT sequencing data , 2013, Nature Methods.

[18]  M. Frith,et al.  Adaptive seeds tame genomic sequence comparison. , 2011, Genome research.

[19]  Cédric Chauve,et al.  LRCstats, a tool for evaluating long reads correction methods , 2017, Bioinform..

[20]  Sven Rahmann,et al.  SimLoRD: Simulation of Long Read Data , 2016, Bioinform..

[21]  Faraz Hach,et al.  CoLoRMap: Correcting Long Reads by Mapping short reads , 2016, Bioinform..

[22]  Panos Kalnis,et al.  Karect: accurate correction of substitution, insertion and deletion errors for next-generation sequencing data , 2015, Bioinform..

[23]  Kunihiko Sadakane,et al.  Succinct de Bruijn Graphs , 2012, WABI.

[24]  S. Salzberg,et al.  Versatile and open software for comparing large genomes , 2004, Genome Biology.

[25]  Stefan Engelen,et al.  Genome assembly using Nanopore-guided Long and Error-free DNA reads , 2015 .

[26]  Yu Lin,et al.  Manifold de Bruijn Graphs , 2014, WABI.