DBG2OLC: Efficient assembly of large genomes using long erroneous reads of the third generation sequencing technologies

Scientific Reports

Volumn 6, Issue , 2016, Pages

  Ye, Chengxi ^a,b   Hill, Christopher M ^a   Wu, Shigang ^c   Ruan, Jue ^c   Ma, Zhanshan ^b  

^a Institute of Advanced Computer Science   (United States)

^b KUNMING INSTITUTE OF ZOOLOGY   (China)

^c INSTITUTE OF PLANT PROTECTION   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGY; DNA SEQUENCE; GENOMICS; HIGH THROUGHPUT SEQUENCING; PROCEDURES;

COMPUTATIONAL BIOLOGY; GENOMICS; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; SEQUENCE ANALYSIS, DNA;

EID: 84984824728     PISSN: None     EISSN: 20452322     Source Type: Journal    
DOI: 10.1038/srep31900     Document Type: Article

References (32)

1. Venter J. C, et al. The sequence of the human genome. Science 291, 1304-1351, doi: 10.1126/science.1058040 (2001).
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).
3. Laver T, et al. Assessing the performance of the Oxford Nanopore Technologies MinION. Biomolecular Detection and Quantification 3, 1-8 (2015).
4. Pacific Biosciences of California I. Data Release: ~54x Long-Read Coverage for PacBio-only De Novo Human Genome Assembly, http://www.pacb.com/blog/data-release-54x-long-read-coverage-for (Published: 2014, Date of access: 17/03/2016).
5. 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).
6. 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).
7. Berlin K, et al. Assembling large genomes with single-molecule sequencing and locality-sensitive hashing. Nature biotechnology 33, 623-630 (2015).
8. Salmela L, & Rivals E. LoRDEC: accurate and efficient long read error correction. Bioinformatics doi: 10.1093/bioinformatics/.btu538 (2014).
9. Lee H, et al. Error correction and assembly complexity of single molecule sequencing reads. BioRxiv. 006395, doi: 10.1101/006395 (2014).
10. 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).
11. 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).
12. 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).
13. 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).
14. Ribeiro F. J, et al. Finished bacterial genomes from shotgun sequence data. Genome research 22, 2270-2277, doi: 10.1101/.gr.141515.112 (2012).
15. 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).
16. 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).
17. 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).
18. Nagarajan N, & Pop M. Sequence assembly demystified. Nature reviews. Genetics 14, 157-167, doi: 10.1038/nrg3367 (2013).
19. Myers E. W. The fragment assembly string graph. Bioinformatics 21 Suppl 2, ii79-85, doi: 10.1093/bioinformatics/bti1114 (2005).
20. 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).
21. Miller J. R, et al. Aggressive assembly of pyrosequencing reads with mates. Bioinformatics 24, 2818-2824, doi: 10.1093/.bioinformatics/btn548 (2008).
22. 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).
23. 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).
24. Batzoglou S, et al. ARACHNE: a whole-genome shotgun assembler. Genome research 12, 177-189, doi: 10.1101/gr.208902 (2002).
25. Myers G. Efficient local alignment discovery amongst noisy long reads. Algorithms in Bioinformatics 52-67, doi: 10.1007/978-3-662-44753-6 (2014).
26. 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).
27. Kurtz S, et al. Versatile and open software for comparing large genomes. Genome Biology 5, R12 (2004).
28. 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).
29. 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).
30. Ye C, & Ma Z. S. Sparc: a sparsity-based consensus algorithm for long erroneous sequencing reads. PeerJ 4, e2016 (2016).
31. 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).
32. Gurevich A, Saveliev V, Vyahhi N, & Tesler G. QUAST: quality assessment tool for genome assemblies. Bioinformatics 29, 1072-1075, doi: 10.1093/bioinformatics/btt086 (2013).