The Theory and Practice of Genome Sequence Assembly

Annual Review of Genomics and Human Genetics

Volumn 16, Issue , 2015, Pages 153-172

  Simpson, Jared T ^a   Pop, Mihai ^b  

^a ONTARIO INSTITUTE FOR CANCER RESEARCH   (Canada)

^b University of Maryland   (United States)

Author keywords

Algorithm; Bioinformatics; Genome sequencing; Sequence assembly; Shotgun sequencing

Indexed keywords

ARTICLE; BACTERIAL ARTIFICIAL CHROMOSOME; BACTERIAL GENOME; CONSENSUS SEQUENCE; DIPLOIDY; DNA SEQUENCE; EXPERIMENTAL DESIGN; GENE SEQUENCE; GENETIC ALGORITHM; GENOME; HAPLOTYPE; HIGH THROUGHPUT SEQUENCING; HUMAN; HUMAN GENOME; HUMAN GENOME PROJECT; INDEL MUTATION; METAGENOME; METAGENOMICS; NEXT GENERATION SEQUENCING; NONHUMAN; POLYPLOIDY; RESTRICTION FRAGMENT; RESTRICTION SITE; SAMPLING BIAS; SEQUENCE ASSEMBLY; SINGLE NUCLEOTIDE POLYMORPHISM; SYSTEM ANALYSIS; THEORETICAL STUDY; ALGORITHM; COMPUTER GRAPHICS; GENOMICS; MOLECULAR CLONING; PROCEDURES;

ALGORITHMS; CHROMOSOMES, ARTIFICIAL, BACTERIAL; CLONING, MOLECULAR; COMPUTER GRAPHICS; GENOME; GENOMICS; HUMANS; SEQUENCE ANALYSIS, DNA;

EID: 84940645811     PISSN: 15278204     EISSN: 1545293X     Source Type: Book Series    
DOI: 10.1146/annurev-genom-090314-050032     Document Type: Article

References (118)

1. 1000 Genomes Proj. Consort. 2010. A map of human genome variation from population-scale sequencing. Nature 467:1061-73
2. Adams MD, Celniker SE, Holt RA, Evans CA, Gocayne JD, et al. 2000. The genome sequence of Drosophila melanogaster. Science 287:2185-95
3. Ammiraju JS, Yu Y, Luo M, Kudrna D, Kim H, et al. 2005. Random sheared fosmid library as a new genomic tool to accelerate complete finishing of rice (Oryza sativa spp. Nipponbare) genome sequence: sequencing of gap-specific fosmid clones uncovers new euchromatic portions of the genome. Theor. Appl. Genet. 111:1596-607
4. Bankevich A, Nurk S, Antipov D, Gurevich AA, DvorkinM, et al. 2012. SPAdes: a new genome assembly algorithm and its applications to single-cell sequencing. J. Comput. Biol. 19:455-77
5. Ben-Bassat I,Chor B. 2014. String graph construction using incremental hashing. Bioinformatics 30:3515-23
6. Berlin K, Koren S, Chin C-S, Drake JP, Landolin JM, Phillippy AM. 2015. Assembling large genomes with single-molecule sequencing and locality-sensitive hashing. Nat. Biotechnol. 33:623-30
7. Bloom BH. 1970. Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13:422-26
8. Boetzer M, Henkel CV, Jansen HJ, Butler D, Pirovano W. 2011. Scaffolding pre-assembled contigs using SSPACE. Bioinformatics 27:578-79
9. Bowe A, Onodera T, Sadakane K, Shibuya T. 2012. Succinct de Bruijn graphs. In Algorithms in Bioinformatics, ed. B Raphael, J Tang, pp. 225-35. Lect. Notes Bioinform. 7534. Berlin: Springer
10. Boža V, Brejová B, Vinař T. 2014. GAML: genome assembly by maximum likelihood. In Algorithms in Bioinformatics, ed. D Brown, B Morgenstern, pp. 122-34. Lect.Notes Bioinform. 8701. Berlin: Springer
11. Bradnam KR, Fass JN, Alexandrov A, Baranay P, BechnerM, et al. 2013. Assemblathon 2: evaluating de novo methods of genome assembly in three vertebrate species. GigaScience 2:10
12. Brenchley R, Spannagl M, Pfeifer M, Barker GL, D'Amore R, et al. 2012. Analysis of the bread wheat genome using whole-genome shotgun sequencing. Nature 491:705-10
13. 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-20
14. Carnevali P, Baccash J, Halpern AL, Nazarenko I, Nilsen GB, et al. 2012. Computational techniques for human genome resequencing using mated gapped reads. J. Comput. Biol. 19:279-92
15. ChaissonMJ, Pevzner PA. 2008. Short read fragment assembly of bacterial genomes. Genome Res. 18:324-30
16. Chikhi R, Rizk G. 2012. Space-efficient and exact de Bruijn graph representation based on a bloom filter. In Algorithms in Bioinformatics, ed. B Raphael, J Tang, pp. 236-48. Lect. Notes Bioinform. 7534. Berlin: Springer
17. Chin CS, Alexander DH, Marks P, Klammer AA, Drake J, et al. 2013. Nonhybrid, finished microbial genome assemblies from long-read SMRT sequencing data. Nat. Methods 10:563-69
18. Clark SC, Egan R, Frazier PI, Wang Z. 2013. ALE: a generic assembly likelihood evaluation framework for assessing the accuracy of genome and metagenome assemblies. Bioinformatics 29:435-43
19. Conway TC, Bromage AJ. 2011. Succinct data structures for assembling large genomes. Bioinformatics 27:479-86
20. Csurös M, Milosavljevic A. 2002. Pooled genomic indexing (PGI):mathematical analysis and experiment design. In Algorithms in Bioinformatics, ed. R Guigó, D Gusfield, pp. 10-28. Lect. Notes Comput. Sci. 2452. Berlin: Springer
21. Dayarian A, Michael TP, Sengupta AM. 2010. SOPRA: scaffolding algorithm for paired reads via statistical optimization. BMC Bioinform. 11:345
22. Dew IM, Walenz B, Sutton G. 2005. A tool for analyzing mate pairs in assemblies (TAMPA). J. Comput. Biol. 12:497-513
23. Dinh H, Rajasekaran S. 2011.Amemory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly. Bioinformatics 27:1901-7
24. Donmez N, Brudno M. 2013. SCARPA: scaffolding reads with practical algorithms. Bioinformatics 29:428-34
25. 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-41
26. Eid J, Fehr A, Gray J, Luong K, Lyle J, et al. 2009. Real-time DNA sequencing from single polymerase molecules. Science 323:133-38
27. Eppley JM, Tyson GW, Getz WM, Banfield JF. 2007. Strainer: software for analysis of population variation in community genomic datasets. BMC Bioinform. 8:398
28. Ferragina P, Manzini G. 2000. Opportunistic data structures with applications. Presented at Annu. Symp. Found. Comput. Sci., 41st, Redondo Beach, CA, Nov. 12-14
29. Fleischmann RD, Adams MD, White O, Clayton RA, Kirkness EF, et al. 1995. Whole-genome random sequencing and assembly of Haemophilus influenzae Rd. Science 269:496-512
30. Gao S, Sung WK, Nagarajan N. 2011. Opera: reconstructing optimal genomic scaffolds with highthroughput paired-end sequences. J. Comput. Biol. 18:1681-91
31. GhodsiM,Hill CM, Astrovskaya I, LinH, Sommer DD, et al. 2013. De novo likelihood-basedmeasures for comparing genome assemblies. BMC Res. Notes 6:334
32. 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. PNAS 108:1513-18
33. Gonnella G, Kurtz S. 2012. Readjoiner: a fast and memory efficient string graph-based sequence assembler. BMC Bioinform. 13:82
34. Green P. 1994. Appendix: algorithms. In Documentation for Phrap and Cross-Match (Version 0.990319). http://www.phrap.org/phredphrap/phrap.html
35. Green P. 1997. Against a whole-genome shotgun. Genome Res. 7:410-17
36. HernandezD, 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-9
37. Huang X, Madan A. 1999. CAP3: a DNA sequence assembly program. Genome Res. 9:868-77
38. Hunt M, Kikuchi T, Sanders M, Newbold C, BerrimanM, Otto TD. 2013. REAPR: a universal tool for genome assembly evaluation. Genome Biol. 14:R47
39. Huson DH, Reinert K, Myers E. 2001. The greedy path-merging algorithm for sequence assembly. In Proceedings of the Fifth Annual International Conference on Computational Biology, pp. 157-63. New York: ACM
40. Idury RM, Waterman MS. 1995. A new algorithm for DNA sequence assembly. J. Comput. Biol. 2:291-306
41. Int. Hum. Genome Seq. Consort. 2001. Initial sequencing and analysis of the human genome. Nature 409:860-921
42. Iqbal Z, CaccamoM, Turner I, Flicek P,McVean G. 2012. De novo assembly and genotyping of variants using colored de Bruijn graphs. Nat. Genet. 44:226-32
43. JaffeDB, Butler J, Gnerre S, Mauceli E, Lindblad-Toh K, et al. 2003. Whole-genome sequence assembly for mammalian genomes: Arachne 2 Genome Res. 13:91-96
44. Jeck WR, Reinhardt JA, Baltrus DA, HickenbothamMT, Magrini V, et al. 2007. Extending assembly of short DNA sequences to handle error. Bioinformatics 23:2942-44
45. Kececioglu JD, Myers EW. 1995. Combinatorial algorithms for DNA sequence assembly. Algorithmica 13:7-51
46. Kent WJ, Haussler D. 2001. Assembly of the working draft of the human genome with GigAssembler. Genome Res. 11:1541-48
47. Kingsford C, SchatzMC, PopM. 2010. Assembly complexity of prokaryotic genomes using short reads. BMC Bioinform. 11:21
48. Koren S, Harhay GP, Smith TP, Bono JL, Harhay DM, et al. 2013. Reducing assembly complexity of microbial genomes with single-molecule sequencing. Genome Biol. 14:R101
49. 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
50. Koren S, Treangen TJ, Hill C, PopM, Phillippy A. 2014. Automated ensemble assembly and validation of microbial genomes. BMC Bioinform. 15:126
51. Koren S, Treangen TJ, Pop M. 2011. Bambus 2: scaffolding metagenomes. Bioinformatics 27:2964-71
52. Lander ES, Waterman MS. 1988. Genomic mapping by fingerprinting random clones: a mathematical analysis. Genomics 2:231-39
53. Langmead B, Trapnell C, PopM, Salzberg SL. 2009. Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol. 10:R25
54. Li H. 2012. Exploring single-sample SNP and INDEL calling with whole-genome de novo assembly. Bioinformatics 28:1838-44
55. Li H, Durbin R. 2009. Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics 25:1754-60
56. Li R, FanW, Tian G, Zhu H, He L, et al. 2010. The sequence and de novo assembly of the giant panda genome. Nature 463:311-17
57. Li R, Yu C, Li Y, Lam TW, Yiu SM, et al. 2009. SOAP2: an improved ultrafast tool for short read alignment. Bioinformatics 25:1966-67
58. Lippert RA. 2005. Space-efficient whole genome comparisons with Burrows-Wheeler transforms. J. Comput. Biol. 12:407-15
59. Lonardi S, Duma D, Alpert M, Cordero F, Beccuti M, et al. 2013. Combinatorial pooling enables selective sequencing of the barley gene space. PLOS Comput. Biol. 9:e1003010
60. Luo R, Liu B, Xie Y, Li Z, Huang W, et al. 2012. SOAPdenovo2: an empirically improved memoryefficient short-read de novo assembler. GigaScience 1:18
61. MaierD. 1978. The complexity of some problems on subsequences and supersequences. J. ACM25:322-36
62. Medvedev P, Brudno M. 2009. Maximum likelihood genome assembly. J. Comput. Biol. 16:1101-16
63. Medvedev P, Georgiou K, Myers G, Brudno M. 2007. Computability of models for sequence assembly. In Algorithms in Bioinformatics, ed. R Giancarlo, S Hannenhalli, pp. 289-301. Lect. Notes. Bioinform. 4645. Berlin: Springer
64. Medvedev P, Pham S, ChaissonM,TeslerG, Pevzner P. 2011. Paired de Bruijn graphs: a novel approach for incorporating mate pair information into genome assemblers. J. Comput. Biol. 18:1625-34
65. Melsted P, Pritchard JK. 2011. Efficient counting of k-mers in DNA sequences using a bloom filter. BMC Bioinform. 12:333
66. Moncunill V, Gonzalez S, Bea S, Andrieux LO, Salaverria I, et al. 2014. Comprehensive characterization of complex structural variations in cancer by directly comparing genome sequence reads. Nat. Biotechnol. 32:1106-12
67. Morowitz MJ, Denef VJ, Costello EK, Thomas BC, Poroyko V, et al. 2011. Strain-resolved community genomic analysis of gut microbial colonization in a premature infant. PNAS 108:1128-33
68. Myers EW. 1995. Toward simplifying and accurately formulating fragment assembly. J. Comput. Biol. 2:275-90
69. Myers EW. 2005. The fragment assembly string graph. Bioinformatics 21(Suppl. 2):ii79-85
70. Myers EW, Sutton GG, Delcher AL, Dew IM, Fasulo DP, et al. 2000. A whole-genome assembly of Drosophila. Science 287:2196-204
71. Myers EW, Weber JL. 1997. Is whole human genome sequencing feasible? In Theoretical and Computational Methods in Genomic Research, ed. S Suhai, pp. 73-89. New York: Springer
72. Myers G. 2014. Efficient local alignment discovery amongst noisy long reads. In Algorithms in Bioinformatics, ed. D Brown, B Morgenstern, pp. 52-67. Lect. Notes Bioinform. 8701. Berlin: Springer
73. Nagarajan N, Pop M. 2009. Parametric complexity of sequence assembly: theory and applications to next generation sequencing. J. Comput. Biol. 16:897-908
74. Nagarajan N, Read TD, Pop M. 2008. Scaffolding and validation of bacterial genome assemblies using optical restriction maps. Bioinformatics 24:1229-35
75. Namiki T, Hachiya T, Tanaka H, Sakakibara Y. 2011. MetaVelvet: an extension of Velvet assembler to de novo metagenome assembly from short sequence reads. In Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine, pp. 116-24. New York: ACM
76. Narzisi G, O'Rawe JA, Iossifov I, Fang H, Lee YH, et al. 2014. Accurate de novo and transmitted indel detection in exome-capture data using microassembly. Nat. Methods 11:1033-36
77. Nijkamp JF, Pop M, Reinders MJ, de Ridder D. 2013. Exploring variation-aware contig graphs for (comparative) metagenomics using MaryGold. Bioinformatics 29:2826-34
78. Ning Z, Cox AJ, Mullikin JC. 2001. SSAHA: a fast search method for large DNA databases. Genome Res. 11:1725-29
79. Okanohara D, Sadakane K. 2007. Practical entropy-compressed rank/select dictionary. In Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX), ed. D Applegate, GS Brodal, pp. 60-70. Philadelphia: Soc. Ind. Appl. Math
80. Pell J, Hintze A, Canino-KoningR,HoweA,Tiedje JM, BrownCT. 2012. Scalingmetagenome sequence assembly with probabilistic de Bruijn graphs. PNAS 109:13272-77
81. Peng Y, Leung HC, Yiu SM, Chin FY. 2011. Meta-IDBA: a de Novo assembler for metagenomic data. Bioinformatics 27:i94-101
82. Peng Y, Leung HC, Yiu SM, Chin FY. 2012. IDBA-UD: a de novo assembler for single-cell and metagenomic sequencing data with highly uneven depth. Bioinformatics 28:1420-28
83. Peterlongo P, Schnel N, Pisanti N, Sagot M-F, Lacroix V. 2010. Identifying SNPs without a reference genome by comparing raw reads. In String Processing and Information Retrieval, ed. E Chavez, S Lonardi, pp. 147-58. Lect. Notes. Comput. Sci. 6393. Berlin: Springer
84. Pevzner PA. 1989. 1-Tuple DNA sequencing: computer analysis. J. Biomol. Struct. Dyn. 7:63-73
85. Pevzner PA, Tang H. 2001. Fragment assembly with double-barreled data. Bioinformatics 17(Suppl. 1):S225-33
86. Pevzner PA, Tang H, Waterman MS. 2001. An Eulerian path approach to DNA fragment assembly. PNAS 98:9748-53
87. Pham SK, Antipov D, Sirotkin A, Tesler G, Pevzner PA, Alekseyev MA. 2013. Pathset graphs: a novel approach for comprehensive utilization of paired reads in genome assembly. J. Comput. Biol. 20:359-71
88. Phillippy AM, SchatzMC, PopM. 2008. Genome assembly forensics: finding the elusive mis-assembly. Genome Biol. 9:R55
89. Pop M, Kosack DS, Salzberg SL. 2004. Hierarchical scaffolding with Bambus. Genome Res. 14:149-59
90. Price J, Ward J, Udall J, Snell Q, Clement M. 2013. Identification and correction of substitution errors in Moleculo long reads. Presented at IEEE Int. Conf. Bioinform. Bioeng., 13th, Chania, Greece, Nov. 10-13
91. Rahman A, Pachter L. 2013. CGAL: computing genome assembly likelihoods. Genome Biol. 14:R8
92. Räihä K-J, Ukkonen E. 1981. The shortest common supersequence problem over binary alphabet is NP-complete. Theor. Comput. Sci. 16:187-98
93. Rimmer A, Phan H, Mathieson I, Iqbal Z, Twigg SR, et al. 2014. Integrating mapping-, assembly-and haplotype-based approaches for calling variants in clinical sequencing applications. Nat. Genet. 46:912-18
94. Rodland EA. 2013. Compact representation of k-mer de Bruijn graphs for genome read assembly. BMC Bioinform. 14:313
95. Salmela L,Makinen V, ValimakiN, Ylinen J, Ukkonen E. 2011. Fast scaffolding with small independent mixed integer programs. Bioinformatics 27:3259-65
96. Salzberg SL, Phillippy AM, Zimin AV, Puiu D, Magoc T, et al. 2012. GAGE: a critical evaluation of genome assemblies and assembly algorithms. Genome Res. 22:557-67
97. Sanger F. 1975. The Croonian Lecture, 1975: Nucleotide sequences in DNA. Proc. R. Soc. Lond. B 191:317-33
98. Schwartz DC, Li X, Hernandez LI, Ramnarain SP, Huff EJ, Wang YK. 1993. Ordered restriction maps of Saccharomyces cerevisiae chromosomes constructed by optical mapping. Science 262:110-14
99. Simpson JT. 2014. Exploring genome characteristics and sequence quality without a reference. Bioinformatics 30:1228-35
100. Simpson JT, Durbin R. 2010. Efficient construction of an assembly string graph using the FM-index. Bioinformatics 26:i367-73
101. Simpson JT, Durbin R. 2012. Efficient de novo assembly of large genomes using compressed data structures. Genome Res. 22:549-56
102. Simpson JT, Wong K, Jackman SD, Schein JE, Jones SJ, Birol I. 2009. ABySS: a parallel assembler for short read sequence data. Genome Res. 19:1117-23
103. Sindi S, Helman E, Bashir A, Raphael BJ. 2009. A geometric approach for classification and comparison of structural variants. Bioinformatics 25:i222-30
104. Staden R. 1979. A strategy ofDNAsequencing employing computer programs. Nucleic Acids Res. 6:2601-10
105. Star B, Nederbragt AJ, Jentoft S, Grimholt U, Malmstrom M, et al. 2011. The genome sequence of Atlantic cod reveals a unique immune system. Nature 477:207-10
106. Sutton GG, White O, Adams MD, Kerlavage AR. 1995. TIGR Assembler: a new tool for assembling large shotgun sequencing projects. Genome Sci. Technol. 1:9-19
107. Tarhio J, Ukkonen E. 1988. A greedy approximation algorithm for constructing shortest common superstrings. Theor. Comput. Sci. 57:131-45
108. Tomato Genome Consort. 2012. The tomato genome sequence provides insights into fleshy fruit evolution. Nature 485:635-41
109. Venter JC, Adams MD, Myers EW, Li PW, Mural RJ, et al. 2001. The sequence of the human genome. Science 291:1304-51
110. Voskoboynik A, Neff NF, Sahoo D, Newman AM, Pushkarev D, et al. 2013. The genome sequence of the colonial chordate, Botryllus schlosseri. eLife 2:e00569
111. Warren RL, Sutton GG, Jones SJ, Holt RA. 2007. Assembling millions of short DNA sequences using SSAKE. Bioinformatics 23:500-1
112. Weisenfeld NI, Yin S, Sharpe T, Lau B, Hegarty R, et al. 2014. Comprehensive variation discovery in single human genomes. Nat. Genet. 46:1350-55
113. Ye C, Ma ZS, Cannon CH, Pop M, Yu DW. 2012. Exploiting sparseness in de novo genome assembly. BMC Bioinform. 13(Suppl. 6):S1
114. Zerbino DR, Birney E. 2008. Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Res. 18:821-29
115. Zhou S, Wei F, Nguyen J, Bechner M, Potamousis K, et al. 2009. A single molecule scaffold for the maize genome. PLOS Genet. 5:e1000711
116. Zimin AV, Marcais G, Puiu D, Roberts M, Salzberg SL, Yorke JA. 2013. The MaSuRCA genome assembler. Bioinformatics 29:2669-77
117. Zimin AV, Smith DR, Sutton G, Yorke JA. 2008. Assembly reconciliation. Bioinformatics 24:42-45
118. Zimin AV, Stevens KA, Crepeau MW, Holtz-Morris A, Koriabine M, et al. 2014. Sequencing and assembly of the 22-Gb loblolly pine genome. Genetics 196:875-90