Next-Generation Sequence Assembly: Four Stages of Data Processing and Computational Challenges

PLoS Computational Biology

Volumn 9, Issue 12, 2013, Pages

  El Metwally, Sara ^a   Hamza, Taher ^a   Zakaria, Magdi ^a   Helmy, Mohamed ^b,c  

^a MANSOURA UNIVERSITY   (Egypt)

^b AL AZHAR UNIVERSITY   (Egypt)

^c UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA HANDLING;

'CURRENT; COMPUTATIONAL CHALLENGES; GENOME SEQUENCES; GENOMIC RESEARCH; GRAPH CONSTRUCTION; HIGH-THROUGHPUT SEQUENCING; LOW-COSTS; NEXT GENERATION SEQUENCERS; PRE-PROCESSING FILTERING; SEQUENCE ASSEMBLIES;

GENES;

ALGORITHM; BIOLOGY; COMPUTER PROGRAM; CONTIG MAPPING; DATA ANALYSIS SOFTWARE; DATA PROCESSING; GENE EXPRESSION; GENE SEQUENCE; HIGH THROUGHPUT SEQUENCING; NEXT GENERATION SEQUENCE; PROTEIN ASSEMBLY; REVIEW; SEQUENCE ALIGNMENT;

ALGORITHMS; BASE SEQUENCE; DNA; GENOME; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 84892698555     PISSN: 1553734X     EISSN: 15537358     Source Type: Journal    
DOI: 10.1371/journal.pcbi.1003345     Document Type: Review

References (111)

1. Niedringhaus TP, Milanova D, Kerby MB, Snyder MP, Barron AE, (2011) Landscape of next-generation sequencing technologies. Anal Chem 83: 4327-4341.
2. Voelkerding KV, Dames SA, Durtschi JD, (2009) Next-generation sequencing: from basic research to diagnostics. Clin Chem 55: 641-658.
3. Helmy M, Sugiyama N, Tomita M, Ishihama Y, (2012) Mass spectrum sequential subtraction speeds up searching large peptide MS/MS spectra datasets against large nucleotide databases for proteogenomics. Genes Cells 17: 633-644.
4. Helmy M, Tomita M, Ishihama Y, (2011) Peptide identification by searching large-scale tandem mass spectra against large databases: bioinformatics methods in proteogenomics. Genes, Genomes and Genomics 6: 76-85.
5. Zhou X, Ren L, Meng Q, Li Y, Yu Y, et al. (2010) The next-generation sequencing technology and application. Protein Cell 1: 520-536.
6. Liu L, Li Y, Li S, Hu N, He Y, et al. (2012) Comparison of next-generation sequencing systems. J Biomed Biotechnol 2012: 251364.
7. Butler J, MacCallum I, Kleber M, Shlyakhter IA, Belmonte MK, et al. (2008) ALLPATHS: de novo assembly of whole-genome shotgun microreads. Genome Res 18: 810-820.
8. Chaisson M, Pevzner P, Tang H, (2004) Fragment assembly with short reads. Bioinformatics 20: 2067-2074.
9. Chaisson MJ, Brinza D, Pevzner PA, (2009) De novo fragment assembly with short mate-paired reads: does the read length matter? Genome Res 19: 336-346.
10. Chaisson MJ, Pevzner PA, (2008) Short read fragment assembly of bacterial genomes. Genome Res 18: 324-330.
11. DiGuistini S, Liao NY, Platt D, Robertson G, Seidel M, et al. (2009) De novo genome sequence assembly of a filamentous fungus using Sanger, 454 and Illumina sequence data. Genome Biol 10: R94.
12. Dohm JC, Lottaz C, Borodina T, Himmelbauer H, (2007) SHARCGS, a fast and highly accurate short-read assembly algorithm for de novo genomic sequencing. Genome Res 17: 1697-1706.
13. Gonnella G, Kurtz S, (2012) Readjoiner: a fast and memory efficient string graph-based sequence assembler. BMC Bioinformatics 13: 82.
14. Hernandez D, Francois P, Farinelli L, Osteras M, Schrenzel J, (2008) De novo bacterial genome sequencing: millions of very short reads assembled on a desktop computer. Genome Res 18: 802-809.
15. Hossain M, Azimi N, Skiena S, (2009) Crystallizing short-read assemblies around seeds. BMC Bioinformatics 10: S16.
16. Koren S, Schatz MC, Walenz BP, Martin J, Howard JT, et al. (2012) Hybrid error correction and de novo assembly of single-molecule sequencing reads. Nat Biotechnol 30: 693-700.
17. Li R, Zhu H, Ruan J, Qian W, Fang X, et al. (2010) De novo assembly of human genomes with massively parallel short read sequencing. Genome Res 20: 265-272.
18. Maccallum I, Przybylski D, Gnerre S, Burton J, Shlyakhter I, et al. (2009) ALLPATHS 2: small genomes assembled accurately and with high continuity from short paired reads. Genome Biol 10: R103.
19. Margulies M, Egholm M, Altman WE, Attiya S, Bader JS, et al. (2005) Genome sequencing in microfabricated high-density picolitre reactors. Nature 437: 376-380.
20. Martin JA, Wang Z, (2011) Next-generation transcriptome assembly. Nat Rev Genet 12: 671-682.
21. Miller JR, Delcher AL, Koren S, Venter E, Walenz BP, et al. (2008) Aggressive assembly of pyrosequencing reads with mates. Bioinformatics 24: 2818-2824.
22. Miller JR, Koren S, Sutton G, (2010) Assembly algorithms for next-generation sequencing data. Genomics 95: 315-327.
23. Myers EW, Sutton GG, Delcher AL, Dew IM, Fasulo DP, et al. (2000) A whole-genome assembly of Drosophila. Science 287: 2196-2204.
24. Nagarajan N, Pop M, (2013) Sequence assembly demystified. Nat Rev Genet 14: 157-167.
25. Paszkiewicz K, Studholme DJ, (2010) De novo assembly of short sequence reads. Brief Bioinform 11: 457-472.
26. Pevzner PA, Tang H, (2001) Fragment assembly with double-barreled data. Bioinformatics 17 (Suppl 1) (): S225-233.
27. Pevzner PA, Tang H, Waterman MS, (2001) An Eulerian path approach to DNA fragment assembly. Proc Natl Acad Sci U S A 98: 9748-9753.
28. Reinhardt JA, Baltrus DA, Nishimura MT, Jeck WR, Jones CD, et al. (2009) De novo assembly using low-coverage short read sequence data from the rice pathogen Pseudomonas syringae pv. oryzae. Genome Res 19: 294-305.
29. Schmidt B, Sinha R, Beresford-Smith B, Puglisi SJ, (2009) A fast hybrid short read fragment assembly algorithm. Bioinformatics 25: 2279-2280.
30. Simpson JT, Durbin R, (2012) Efficient de novo assembly of large genomes using compressed data structures. Genome Res 22: 549-556.
31. Simpson JT, Wong K, Jackman SD, Schein JE, Jones SJ, et al. (2009) ABySS: a parallel assembler for short read sequence data. Genome Res 19: 1117-1123.
32. Wang Y, Yu Y, Pan B, Hao P, Li Y, et al. (2012) Optimizing hybrid assembly of next-generation sequence data from Enterococcus faecium: a microbe with highly divergent genome. BMC Syst Biol 6: 1-13.
33. Warren RL, Sutton GG, Jones SJM, Holt RA, (2006) Assembling millions of short DNA sequences using SSAKE. Bioinformatics 23: 500-501.
34. Ye C, Ma ZS, Cannon CH, Pop M, Yu DW, (2012) Exploiting sparseness in de novo genome assembly. BMC Bioinformatics 13 (Suppl 6) (): S1.
35. Zerbino DR, Birney E, (2008) Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Res 18: 821-829.
36. Quail MA, Smith M, Coupland P, Otto TD, Harris SR, et al. (2012) A tale of three next generation sequencing platforms: comparison of Ion Torrent, Pacific Biosciences and Illumina MiSeq sequencers. BMC Genomics 13: 341.
37. Miller JM, Malenfant RM, Moore SS, Coltman DW, (2012) Short reads, circular genome: skimming solid sequence to construct the bighorn sheep mitochondrial genome. J Hered 103: 140-146.
38. Loman NJ, Misra RV, Dallman TJ, Constantinidou C, Gharbia SE, et al. (2012) Performance comparison of benchtop high-throughput sequencing platforms. Nat Biotechnol 30: 434-439.
39. Yang X, Chockalingam SP, Aluru S, (2013) A survey of error-correction methods for next-generation sequencing. Brief Bioinform 14: 56-66.
40. Sequence Read Archive. Available: http://www.ncbi.nlm.nih.gov/sra. Accessed 4 February 2013.
41. Assembly Archive. Available: http://www.ncbi.nlm.nih.gov/Traces/assembly/. Accessed 4 February 2013.
42. AGP file. Available: http://www.ncbi.nlm.nih.gov/projects/genome/assembly/agp/. Accessed 4 February 2013.
43. Pop M, Phillippy A, Delcher AL, Salzberg SL, (2004) Comparative genome assembly. Brief Bioinform 5: 237-248.
44. Zhang W, Chen J, Yang Y, Tang Y, Shang J, et al. (2011) A practical comparison of de novo genome assembly software tools for next-generation sequencing technologies. PLoS ONE 6: e17915 doi:10.1371/journal.pone.0017915.
45. Ilie L, Fazayeli F, Ilie S, (2011) HiTEC: accurate error correction in high-throughput sequencing data. Bioinformatics 27: 295-302.
46. Kao WC, Chan AH, Song YS, (2011) ECHO: a reference-free short-read error correction algorithm. Genome Res 21: 1181-1192.
47. Kelley DR, Schatz MC, Salzberg SL, (2010) Quake: quality-aware detection and correction of sequencing errors. Genome Biol 11: R116.
48. Medvedev P, Scott E, Kakaradov B, Pevzner P, (2011) Error correction of high-throughput sequencing datasets with non-uniform coverage. Bioinformatics 27: i137-i141.
49. Salmela L, Schroder J, (2011) Correcting errors in short reads by multiple alignments. Bioinformatics 27: 1455-1461.
50. Schroder J, Schroder H, Puglisi SJ, Sinha R, Schmidt B, (2009) SHREC: a short-read error correction method. Bioinformatics 25: 2157-2163.
51. Yang X, Dorman KS, Aluru S, (2010) Reptile: representative tiling for short read error correction. Bioinformatics 26: 2526-2533.
52. Boetzer M, Henkel CV, Jansen HJ, Butler D, Pirovano W, (2011) Scaffolding pre-assembled contigs using SSPACE. Bioinformatics 24: 578-579.
53. Dayarian A, Michael TP, Sengupta AM, (2010) SOPRA: scaffolding algorithm for paired reads via statistical optimization. BMC Bioinformatics 11: 345.
54. Donmez N, Brudno M, (2013) SCARPA: scaffolding reads with practical algorithms. Bioinformatics 29: 428-434.
55. Gao S, Sung WK, Nagarajan N, (2011) Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. J Comput Biol 18: 1681-1691.
56. Koren S, Treangen TJ, Pop M, (2011) Bambus 2: scaffolding metagenomes. Bioinformatics 27: 2964-2971.
57. Salmela L, Makinen V, Valimaki N, Ylinen J, Ukkonen E, (2011) Fast scaffolding with small independent mixed integer programs. Bioinformatics 27: 3259-3265.
58. Li Z, Chen Y, Mu D, Yuan J, Shi Y, et al. (2012) Comparison of the two major classes of assembly algorithms: overlap-layout-consensus and de-bruijn-graph. Brief Funct Genomics 11: 25-37.
59. Gnerre S, Maccallum I, Przybylski D, Ribeiro FJ, Burton JN, et al. (2011) High-quality draft assemblies of mammalian genomes from massively parallel sequence data. Proc Natl Acad Sci U S A 108: 1513-1518.
60. Li H, (2012) Exploring single-sample SNP and INDEL calling with whole-genome de novo assembly. Bioinformatics 28: 1838-1844.
61. Nagarajan N, Pop M (2010) Sequencing and genome assembly using next-generation technologies. In: Fenyö D, editor. Computational biology. Humana Press. pp. 1-17.
62. Salmela L, (2010) Correction of sequencing errors in a mixed set of reads. Bioinformatics 26: 1284-1290.
63. Salzberg SL, Phillippy AM, Zimin A, Puiu D, Magoc T, et al. (2012) GAGE: a critical evaluation of genome assemblies and assembly algorithms. Genome Res 22: 557-567.
64. Medvedev P, Brudno M, (2009) Maximum likelihood genome assembly. J Comput Biol 16: 1101-1116.
65. Medvedev P, Georgiou K, Myers G, Brudno M (2007) Computability of models for sequence assembly. In: Giancarlo R, Hannenhalli S, editors. Algorithms in bioinformatics. Springer Berlin Heidelberg. pp. 289-301.
66. Peltola H, Soderlund H, Ukkonen E, (1984) SEQAID: a DNA sequence assembling program based on a mathematical model. Nucleic Acids Res 12: 307-321.
67. Myers EW, (2005) The fragment assembly string graph. Bioinformatics 21 (Suppl 2) (): ii79-85.
68. Simpson JT, Durbin R, (2010) Efficient construction of an assembly string graph using the FM-index. Bioinformatics 26: i367-373.
69. Idury RM, Waterman MS, (1995) A new algorithm for DNA sequence assembly. J Comput Biol 2: 291-306.
70. Charuvaka A, Rangwala H, (2011) Evaluation of short read metagenomic assembly. BMC Genomics 12 (Suppl 2) (): S8.
71. Melsted P, Pritchard J, (2011) Efficient counting of k-mers in DNA sequences using a bloom filter. BMC Bioinformatics 12: 1-7.
72. Conway TC, Bromage AJ, (2011) Succinct data structures for assembling large genomes. Bioinformatics 27: 479-486.
73. Bowe A, Onodera T, Sadakane K, Shibuya T (2012) Succinct de Bruijn Graphs. In: Raphael B, Tang J, editors. Algorithms in bioinformatics. Springer Berlin Heidelberg. pp. 225-235.
74. Jeck WR, Reinhardt JA, Baltrus DA, Hickenbotham MT, Magrini V, et al. (2007) Extending assembly of short DNA sequences to handle error. Bioinformatics 23: 2942-2944.
75. Bryant DW Jr, Wong WK, Mockler TC, (2009) QSRA: a quality-value guided de novo short read assembler. BMC Bioinformatics 10: 69.
76. Aury J-M, Cruaud C, Barbe V, Rogier O, Mangenot S, et al. (2008) High quality draft sequences for prokaryotic genomes using a mix of new sequencing technologies. BMC Genomics 9: 1-11.
77. Cerdeira LT, Carneiro AR, Ramos RTJ, de Almeida SS, D'Afonseca V, et al. (2011) Rapid hybrid de novo assembly of a microbial genome using only short reads: Corynebacterium pseudotuberculosis I19 as a case study. J Microbiol Methods 86: 218-223.
78. Nijkamp J, Winterbach W, van den Broek M, Daran JM, Reinders M, et al. (2010) Integrating genome assemblies with MAIA. Bioinformatics 26: i433-439.
79. Zerbino DR, McEwen GK, Margulies EH, Birney E, (2009) Pebble and Rock Band: heuristic resolution of repeats and scaffolding in the velvet short-read de novo assembler. PLoS ONE 4: e8407 doi:10.1371/journal.pone.0008407.
80. Pop M, Kosack DS, Salzberg SL, (2004) Hierarchical scaffolding with Bambus. Genome Res 14: 149-159.
81. Huson DH, Reinert K, Myers EW, (2002) The greedy path-merging algorithm for contig scaffolding. Journal of the ACM 49: 603-615.
82. Medvedev P, Pham S, Chaisson M, Tesler G, Pevzner P, (2011) Paired de bruijn graphs: a novel approach for incorporating mate pair information into genome assemblers. J Comput Biol 18: 1625-1634.
83. Medvedev P, Brudno M (2008) Ab initio whole genome shotgun assembly with mated short reads. Proceedings of the 12th annual international conference on research in computational molecular biology. Singapore: Springer-Verlag. pp. 50-64.
84. Alkan C, Sajjadian S, Eichler EE, (2011) Limitations of next-generation genome sequence assembly. Nat Methods 8: 61-65.
85. Golovko G, Khanipov K, Rojas M, Martinez-Alcantara A, Howard JJ, et al. (2012) Slim-Filter: an interactive windows-based application for illumina genome analyzer data assessment and manipulation. BMC Bioinformatics 13: 166.
86. Powell DR, Seemann T, (2013) VAGUE: a graphical user interface for the Velvet assembler. Bioinformatics 29: 264-265.
87. Church DM, Goodstadt L, Hillier LW, Zody MC, Goldstein S, et al. (2009) Lineage-specific biology revealed by a finished genome assembly of the mouse. PLoS Biol 7: e1000112 doi:10.1371/journal.pbio.1000112.
88. Colbourne JK, Pfrender ME, Gilbert D, Thomas WK, Tucker A, et al. (2011) The ecoresponsive genome of Daphnia pulex. Science 331: 555-561.
89. Li R, Fan W, Tian G, Zhu H, He L, et al. (2010) The sequence and de novo assembly of the giant panda genome. Nature 463: 311-317.
90. Lindblad-Toh K, Wade CM, Mikkelsen TS, Karlsson EK, Jaffe DB, et al. (2005) Genome sequence, comparative analysis and haplotype structure of the domestic dog. Nature 438: 803-819.
91. Liu Y, Qin X, Song XZ, Jiang H, Shen Y, et al. (2009) Bos taurus genome assembly. BMC Genomics 10: 180.
92. Locke DP, Hillier LW, Warren WC, Worley KC, Nazareth LV, et al. (2011) Comparative and demographic analysis of orang-utan genomes. Nature 469: 529-533.
93. Ming R, Hou S, Feng Y, Yu Q, Dionne-Laporte A, et al. (2008) The draft genome of the transgenic tropical fruit tree papaya (Carica papaya Linnaeus). Nature 452: 991-996.
94. Lin Y, Li J, Shen H, Zhang L, Papasian CJ, et al. (2011) Comparative studies of de novo assembly tools for next-generation sequencing technologies. Bioinformatics 27: 2031-2037.
95. Huson DH, Halpern AL, Lai Z, Myers EW, Reinert K, et al. (2001) Comparing assemblies using fragments and mate-pairs. Århus, Denmark: Springer Berlin Heidelberg. pp. 294-306.
96. Phillippy AM, Schatz MC, Pop M, (2008) Genome assembly forensics: finding the elusive mis-assembly. Genome Biol 9: R55.
97. Zhou S, Bechner MC, Place M, Churas CP, Pape L, et al. (2007) Validation of rice genome sequence by optical mapping. BMC Genomics 8: 278.
98. Parra G, Bradnam K, Ning Z, Keane T, Korf I, (2009) Assessing the gene space in draft genomes. Nucleic Acids Res 37: 289-297.
99. Hubisz MJ, Lin MF, Kellis M, Siepel A, (2011) Error and error mitigation in low-coverage genome assemblies. PLoS ONE 6: e17034 doi:10.1371/journal.pone.0017034.
100. Meader S, Hillier LW, Locke D, Ponting CP, Lunter G, (2010) Genome assembly quality: assessment and improvement using the neutral indel model. Genome Res 20: 675-684.
101. Earl D, Bradnam K, St John J, Darling A, Lin D, et al. (2011) Assemblathon 1: a competitive assessment of de novo short read assembly methods. Genome Res 21: 2224-2241.
102. Haiminen N, Kuhn DN, Parida L, Rigoutsos I, (2011) Evaluation of methods for de novo genome assembly from high-throughput sequencing reads reveals dependencies that affect the quality of the results. PLoS ONE 6: e24182 doi:10.1371/journal.pone.0024182.
103. Narzisi G, Mishra B, (2011) Comparing de novo genome assembly: the long and short of it. PLoS ONE 6: e19175 doi:10.1371/journal.pone.0019175.
104. Vezzi F, Narzisi G, Mishra B, (2012) Feature-by-feature - evaluating de novo sequence assembly. PLoS ONE 7: e31002 doi:10.1371/journal.pone.0031002.
105. Pop M, (2009) Genome assembly reborn: recent computational challenges. Brief Bioinform 10: 354-366.
106. Bradnam KR, Fass JN, Alexandrov A, Baranay P, Bechner M, et al. (2013) Assemblathon 2: evaluating de novo methods of genome assembly in three vertebrate species. Gigascience 2: 10.
107. Sommerville I (1995) Software engineering (5th ed.). Addison Wesley Longman Publishing Co., Inc. 742 p.
108. Goecks J, Coraor N, Team TG, Nekrutenko A, Taylor J, (2012) NGS analyses by visualization with Trackster. Nat Biotech 30: 1036-1039.
109. Li H, Handsaker B, Wysoker A, Fennell T, Ruan J, et al. (2009) The Sequence Alignment/Map format and SAMtools. Bioinformatics 25: 2078-2079.
110. SAM (Sequence Alignment/Map) format. Available: http://samtools.sourceforge.net/. Accessed 16 August 2013.
111. FASTG- An expressive representation for genome assemblies. Available: http://fastg.sourceforge.net/. Accessed 27 May 2013.