WENGAN: Efficient and high quality hybrid de novo assembly of human genomes

The continuous improvement of long-read sequencing technologies along with the development of ad-doc algorithms has launched a new de novo assembly era that promises high-quality genomes. However, it has proven difficult to use only long reads to generate accurate genome assemblies of large, repeat-rich human genomes. To date, most of the human genomes assembled from long error-prone reads add accurate short reads to further polish the consensus quality. Here, we report the development of a novel algorithm for hybrid assembly, WENGAN, and the de novo assembly of four human genomes using a combination of sequencing data generated on ONT PromethION, PacBio Sequel, Illumina and MGI technology. WENGAN implements efficient algorithms that exploit the sequence information of short and long reads to tackle assembly contiguity as well as consensus quality. The resulting genome assemblies have high contiguity (contig NG50:16.67-62.06 Mb), few assembly errors (contig NGA50:10.9-45.91 Mb), good consensus quality (QV:27.79-33.61), and high gene completeness (BUSCO complete: 94.6-95.1%), while consuming low computational resources (CPU hours:153-1027). In particular, the WENGAN assembly of the haploid CHM13 sample achieved a contig NG50 of 62.06 Mb (NGA50:45.91 Mb), which surpasses the contiguity of the current human reference genome (GRCh38 contig NG50:57.88 Mb). Providing highest quality at low computational cost, WENGAN is an important step towards the democratization of the de novo assembly of human genomes. The WENGAN assembler is available at https://github.com/adigenova/wengan

• Publication year

  2019

• Venue

  bioRxiv

• Publication date

  2019-11-25

• Fields of study

  Biology, Computer Science

• Identifiers
  DOI 10.1101/840447
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Accurate circular consensus long-read sequencing improves variant detection and assembly of a human genome

  2019influential reference
• Errors in long-read assemblies can critically affect protein prediction

  2019cited by this paper
• Fast and accurate long-read assembly with wtdbg2

  2019influential reference
• ntEdit: scalable genome sequence polishing

  2019influential reference
• Telomere-to-telomere assembly of a complete human X chromosome

  2019influential reference
• Efficient de novo assembly of eleven human genomes using PromethION sequencing and a novel nanopore toolkit

  2019influential reference
• Versatile genome assembly evaluation with QUAST-LG

  2018cited by this paper
• Piercing the dark matter: bioinformatics of long-range sequencing and mapping

  2018cited by this paper
• Assembly of long, error-prone reads using repeat graphs

  2018influential reference
• Long-read sequence and assembly of segmental duplications

  2018cited by this paper
• KMC 3: counting and manipulating k‐mer statistics

  2017cited by this paper
• Nanopore sequencing and assembly of a human genome with ultra-long reads

  2017influential reference
• Fast-SG: an alignment-free algorithm for hybrid assembly

  2017cited by this paper
• Estimating the total number of phosphoproteins and phosphorylation sites in eukaryotic proteomes

  2017cited by this paper
• Hybrid assembly of the large and highly repetitive genome of Aegilops tauschii, a progenitor of bread wheat, with the MaSuRCA mega-reads algorithm.

  2017cited by this paper
• Minimap2: pairwise alignment for nucleotide sequences

  2017cited by this paper
• A reference human genome dataset of the BGISEQ-500 sequencer

  2017influential reference
• Phased diploid genome assembly with single-molecule real-time sequencing

  2016cited by this paper
• Compacting de Bruijn graphs from sequencing data quickly and in low memory

  2016cited by this paper
• Edlib: a C/C ++ library for fast, exact sequence alignment using edit distance

  2016influential reference
• Fast and accurate de novo genome assembly from long uncorrected reads

  2016influential reference
• ABySS 2.0: resource-efficient assembly of large genomes using a Bloom filter

  2016influential reference
• trio-sga: facilitating de novo assembly of highly heterozygous genomes with parent-child trios

  2016cited by this paper
• Canu: scalable and accurate long-read assembly via adaptive k-mer weighting and repeat separation

  2016cited by this paper
• Erratum to: The Oxford Nanopore MinION: delivery of nanopore sequencing to the genomics community

  2016influential reference
• The Oxford Nanopore MinION: delivery of nanopore sequencing to the genomics community

  2016cited by this paper
• BUSCO: Assessing Genome Assembly and Annotation Completeness with Single-Copy Orthologs

  2016cited by this paper
• A complete bacterial genome assembled de novo using only nanopore sequencing data

  2015cited by this paper
• One chromosome, one contig: complete microbial genomes from long-read sequencing and assembly.

  2015cited by this paper
• BUSCO: assessing genome assembly and annotation completeness with single-copy orthologs

  2015cited by this paper
• Pilon: An Integrated Tool for Comprehensive Microbial Variant Detection and Genome Assembly Improvement

  2014cited by this paper
• Comprehensive variation discovery in single human genomes

  2014cited by this paper
• Nonhybrid, finished microbial genome assemblies from long-read SMRT sequencing data

  2013cited by this paper
• Space-efficient and exact de Bruijn graph representation based on a Bloom filter

  2012cited by this paper
• LEMON - an Open Source C++ Graph Template Library

  2011cited by this paper
• Paired de Bruijn Graphs: A Novel Approach for Incorporating Mate Pair Information into Genome Assemblers

  2011cited by this paper
• Real-Time DNA Sequencing from Single Polymerase Molecules

  2009cited by this paper
• Accurate Whole Human Genome Sequencing using Reversible Terminator Chemistry

  2008cited by this paper
• The fragment assembly string graph

  2005influential reference
• Reducing storage requirements for biological sequence comparison

  2004cited by this paper
• Generating Consensus Sequences from Partial Order Multiple Sequence Alignment Graphs

  2003cited by this paper
• The greedy path-merging algorithm for contig scaffolding

  2002cited by this paper
• An Eulerian path approach to DNA fragment assembly

  2001cited by this paper
• Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight

  1990cited by this paper
• An O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs

  1986cited by this paper

• ALPHA: A Novel Algorithm-Hardware Co-Design for Accelerating DNA Seed Location Filtering

  2022cites this paper
• Music of metagenomics—a review of its applications, analysis pipeline, and associated tools

  2021cites this paper
• Ancient Migrations - The first complete genome assembly, annotation and variants of the Zoroastrian-Parsi community of India

  2021cites this paper
• Long-read sequence assembly: a technical evaluation in barley

  2021influential citation
• Halomonas salipaludis sp. nov., isolated from a saline-alkali wetland soil

  2021cites this paper
• GABOLA: A Reliable Gap-Filling Strategy for de novo Chromosome-Level Assembly

  2021cites this paper
• Computational methods for analysis of single molecule sequencing data

  2020influential citation
• 20th International Workshop on Algorithms in Bioinformatics, WABI 2020, Pisa, Italy (Virtual Conference), September 7-9, 2020

  2020cites this paper
• Economic Genome Assembly from Low Coverage Illumina and Nanopore Data

  2020cites this paper
• HASLR: Fast Hybrid Assembly of Long Reads

  2020cites this paper