Cited by 304Genomics and Phylogenetic StudiesAlgorithms and Data CompressionGenomic variations and chromosomal abnormalities

DBG2OLC: Efficient Assembly of Large Genomes Using Long Erroneous Reads of the Third Generation Sequencing Technologies

Open access
Ye, Chengxi, Hill, Christopher M., Wu, Shigang, Ruan, Jue, Ma, Zhanshan·2016·Scientific Reports

Abstract

The highly anticipated transition from next generation sequencing (NGS) to third generation sequencing (3GS) has been difficult primarily due to high error rates and excessive sequencing cost. The high error rates make the assembly of long erroneous reads of large genomes challenging because existing software solutions are often overwhelmed by error correction tasks. Here we report a hybrid assembly approach that simultaneously utilizes NGS and 3GS data to address both issues. We gain advantages from three general and basic design principles: (i) Compact representation of the long reads leads to efficient alignments. (ii) Base-level errors can be skipped; structural errors need to be detected and corrected. (iii) Structurally correct 3GS reads are assembled and polished. In our implementation, preassembled NGS contigs are used to derive the compact representation of the long reads, motivating an algorithmic conversion from a de Bruijn graph to an overlap graph, the two major assembly paradigms. Moreover, since NGS and 3GS data can compensate for each other, our hybrid assembly approach reduces both of their sequencing requirements. Experiments show that our software is able to assemble mammalian-sized genomes orders of magnitude more quickly than existing methods without consuming a lot of memory, while saving about half of the sequencing cost.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/srep31900

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • As genome size increases, the time taken for alignment and the memory required for processing increase exponentially.

    “As the size of the genomes increases, the time taken for alignment and the memory required for processing also increase exponentially.”

    From Whole-Genome Alignment: Methods, Challenges, and Future Directions (2024) · cites this paper as [77]

    The Results (page unavailable) say that DBG2OLC’s overall computational time scales near linearly with data size, contrary to the claimed exponential increase in processing time. The Results report higher memory use for a larger genome, but do not describe an exponential increase in memory or alignment time. (LLM, conf=0.85)

    Checked by a reasoning model — may be wrong.

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 30

  1. Venter J. C. et al. The sequence of the human genome. Science 291, 1304– 1351, doi: 10.1126/science.1058040 (2001). 11181995 · DOI · Paper page
  2. Koren S. et al. Hybrid error correction and de novo assembly of single-molecule sequencing reads. Nature biotechnology 30, 693– 700, doi: 10.1038/nbt.2280 (2012). PMC3707490 22750884 · DOI
  3. Laver T. et al. Assessing the performance of the Oxford Nanopore Technologies MinION. Biomolecular Detection and Quantification 3, 1– 8 (2015). 26753127 PMC4691839
  4. Ye C., Ma Z. S., Cannon C. H., Pop M. & Yu D. W. Exploiting sparseness in de novo genome assembly. BMC Bioinformatics 13 Suppl 6, S1, doi: 10.1186/1471-2105-13-S6-S1 (2012). 22537038 PMC3369186 · DOI
  5. Koren S. & Phillippy A. M. One chromosome, one contig: complete microbial genomes from long-read sequencing and assembly. Current Opinion in Microbiology 23, 110– 120, doi: 10.1016/j.mib.2014.11.014 (2015). 25461581 · DOI
  6. Berlin K. et al. Assembling large genomes with single-molecule sequencing and locality-sensitive hashing. Nature biotechnology 33, 623– 630 (2015). 26006009
  7. Salmela L. & Rivals E. LoRDEC: accurate and efficient long read error correction. Bioinformatics doi: 10.1093/bioinformatics/btu538 (2014). PMC4253826 25165095 · DOI
  8. Lee H. et al. Error correction and assembly complexity of single molecule sequencing reads. BioRxiv. 006395, doi: 10.1101/006395 (2014). · DOI
  9. Hackl T., Hedrich R., Schultz J. & Forster F. proovread: large-scale high-accuracy PacBio correction through iterative short read consensus. Bioinformatics doi: 10.1093/bioinformatics/btu392 (2014). PMC4609002 25015988 · DOI
  10. Boetzer M. & Pirovano W. SSPACE-LongRead: scaffolding bacterial draft genomes using long read sequence information. BMC Bioinformatics 15, 211, doi: 10.1186/1471-2105-15-211 (2014). 24950923 PMC4076250 · DOI
  11. Deshpande V., Fung E. K., Pham S. & Bafna V. In Algorithms in Bioinformatics Vol. 8126 Lecture Notes in Computer Science (eds Aaron Darling & Jens Stoye) Ch. 27, 349– 363 (Springer: Berlin Heidelberg,, 2013).
  12. Chin C. S. et al. Nonhybrid, finished microbial genome assemblies from long-read SMRT sequencing data. Nature methods 10, 563– 569, doi: 10.1038/nmeth.2474 (2013). 23644548 · DOI
  13. Ribeiro F. J. et al. Finished bacterial genomes from shotgun sequence data. Genome research 22, 2270– 2277, doi: 10.1101/gr.141515.112 (2012). 22829535 PMC3483556 · DOI
  14. English A. C. et al. Mind the gap: upgrading genomes with Pacific Biosciences RS long-read sequencing technology. PloS one 7, e47768, doi: 10.1371/journal.pone.0047768 (2012). 23185243 PMC3504050 · DOI
  15. Bashir A. et al. A hybrid approach for the automated finishing of bacterial genomes. Nature biotechnology 30, 701– 707, doi: 10.1038/nbt.2288 (2012). PMC3731737 22750883 · DOI
  16. Au K. F., Underwood J. G., Lee L. & Wong W. H. Improving PacBio long read accuracy by short read alignment. PloS one 7, e46679, doi: 10.1371/journal.pone.0046679 (2012). 23056399 PMC3464235 · DOI · Paper page
  17. Nagarajan N. & Pop M. Sequence assembly demystified. Nature reviews. Genetics 14, 157– 167, doi: 10.1038/nrg3367 (2013). 23358380 · DOI · Paper page
  18. Myers E. W. The fragment assembly string graph. Bioinformatics 21 Suppl 2, ii79– 85, doi: 10.1093/bioinformatics/bti1114 (2005). 16204131 · DOI · Paper page
  19. Pevzner P. A., Tang H. & Waterman M. S. An Eulerian path approach to DNA fragment assembly. Proceedings of the National Academy of Sciences 98, 9748– 9753, doi: 10.1073/pnas.171285098 (2001). PMC55524 11504945 · DOI · Paper page
  20. Miller J. R. et al. Aggressive assembly of pyrosequencing reads with mates. Bioinformatics 24, 2818– 2824, doi: 10.1093/bioinformatics/btn548 (2008). 18952627 PMC2639302 · DOI
  21. Simpson J. T. & Durbin R. Efficient de novo assembly of large genomes using compressed data structures. Genome research 22, 549– 556, doi: 10.1101/gr.126953.111 (2012). 22156294 PMC3290790 · DOI
  22. Treangen T. J., Sommer D. D., Angly F. E., Koren S. & Pop M. Next generation sequence assembly with AMOS. Current Protocols in Bioinformatics, doi: 10.1002/0471250953.bi1108s33 (2011). PMC3072823 21400694 · DOI
  23. Batzoglou S. et al. ARACHNE: a whole-genome shotgun assembler. Genome research 12, 177– 189, doi: 10.1101/gr.208902 (2002). 11779843 PMC155255 · DOI
  24. Myers G. Efficient local alignment discovery amongst noisy long reads. Algorithms in Bioinformatics 52– 67, doi: 10.1007/978-3-662-44753-6 (2014). · DOI
  25. Chaisson M. J., Brinza D. & Pevzner P. A. De novo fragment assembly with short mate-paired reads: Does the read length matter? Genome research 19, 336– 346, doi: 10.1101/gr.079053.108 (2009). 19056694 PMC2652199 · DOI · Paper page
  26. Kurtz S. et al. Versatile and open software for comparing large genomes. Genome Biology 5, R12 (2004). 14759262 PMC395750
  27. Chaisson M. & Tesler G. Mapping single molecule sequencing reads using basic local alignment with successive refinement (BLASR): application and theory. BMC Bioinformatics 13, 238 (2012). 22988817 PMC3572422
  28. Smith T. F. & Waterman M. S. Identification of Common Molecular Subsequences. J Mol Biol 147, 195– 197, doi: 10.1016/0022-2836(81)90087-5 (1981). 7265238 · DOI
  29. Ye C. & Ma Z. S. Sparc: a sparsity-based consensus algorithm for long erroneous sequencing reads. PeerJ 4, e2016 (2016). 27330851 PMC4906657
  30. Chakraborty M., Baldwin-Brown J. G., Long A. D. & Emerson J. J. A practical guide to de novo genome assembly using long reads. bioRxiv. 029306 (2015).

Cited by

Sorted by citations

Authors
Ye, C., Hill, C. M., Wu, S., Ruan, J., & Ma, Z.
Affiliations
  • Kunming Institute of Zoology (CN)
  • University of Maryland, College Park (US)
  • Agricultural Genomics Institute at Shenzhen (CN)
Corresponding author
  • Ye, Chengxi
  • Ma, Zhanshan
Venue
Scientific Reports
Published
2016-08-30
Volume
6
Issue
1
Pages
31900-31900
ISSN
2045-2322 (ISSN-L)
OpenAlex
W2397469828
Cited by
304
References
2
Citations by year
2026: 4 · 2025: 6 · 2024: 25 · 2023: 41 · 2022: 31 · 2021: 38 · 2020: 43 · 2019: 49 · 2018: 32 · 2017: 25 · 2016: 9 · 2015: 1
FWCI
16.37
Type
journal article
Language
en
Open access
Locations
  • Scientific Reports (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
National Natural Science Foundation of China (61175071, 71473243)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
  • Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Genetics › Genomic variations and chromosomal abnormalities
Keywords
genome assembly, long-read sequencing, de Bruijn graph, overlap graphs, hybrid assembly, error correction, structural errors, sequencing cost reduction, mammalian genomes
MeSH terms
Sequence Analysis, DNA, Computational Biology, Genomics, High-Throughput Nucleotide Sequencing

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review