Review of General Algorithmic Features for Genome Assemblers for Next Generation Sequencers

Genomics, Proteomics and Bioinformatics

Volumn 10, Issue 2, 2012, Pages 58-73

  Wajid, Bilal ^a,b   Serpedin, Erchin ^b  

^a UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Pakistan)

^b Department of Electrical and Computer Engineering   (United States)

Author keywords

Comparative assembly; De Bruijn graphs; De novo assembly; Genome assembly; Next generation sequencing

Indexed keywords

DNA;

BIOINFORMATICS; COMPARATIVE GENE MAPPING; COMPUTATIONAL FLUID DYNAMICS; DATA ANALYSIS SOFTWARE; DNA DETERMINATION; DNA SEQUENCE; GENETIC ALGORITHM; GENETIC ANALYSIS; GENOME; GENOME ASSEMBLY; GENOMICS; HUMAN; MUTANT; NEXT GENERATION SEQUENCING; NONHUMAN; PROBLEM SOLVING; PROTEIN ASSEMBLY; PROTEOMICS; QUALITATIVE ANALYSIS; QUANTITATIVE ANALYSIS; REVIEW; SEQUENCE ANALYSIS; WILD TYPE;

ALGORITHMS; COMPUTATIONAL BIOLOGY; CONTIG MAPPING; GENOME; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 84863444675     PISSN: 16720229     EISSN: 22103244     Source Type: Journal    
DOI: 10.1016/j.gpb.2012.05.006     Document Type: Review

References (90)

1. Oxford Molecular Group PLC. AssemblyLIGN 1.0. 9. Oxford, United Kingdom: Oxford Molecular Group PLC; 1998.
2. Broveak T. Geneworks. Biotechnol Software Internet J 1996, 13:1114.
3. Parker S. Autoassembler sequence assembly software. Methods Mol Biol 1997, 70:107-118.
4. Swindell S.R., Plasterer T.N. SEQMAN. Contig assembly. Methods Mol Biol 1997, 70:75-89.
5. Bromberg C., et al. Sequencher 1995, Gene Codes Corporation.
6. Miller S, Myers E. A fragment assembly project environment. University of Arizona, Dept. of Computer Science; 1991.
7. Gleeson T., Staden R. An x windows and unix implementation of our sequence analysis package. Comput Appl Biosci 1991, 7:398.
8. Miller M.J., Powell J.I. A quantitative comparison of DNA sequence assembly programs. J Comput Biol 1994, 1:257-269.
9. Sanger F., et al. Nucleotide sequence of bacteriophage lambda DNA. J Mol Biol 1982, 162:729-773.
10. Bastide M, McCombie WR. Assembling genomic DNA sequences with PHRAP. Curr Protoc Bioinformatics; 2007.
11. Sutton G., et al. Tigr assembler: a new tool for assembling large shotgun sequencing projects. Genome Sci Technol 1995, 1:919.
12. Myers E., et al. A whole-genome assembly of drosophila. Science 2000, 287:2196-2204.
13. Batzoglou S., et al. Arachne: a whole-genome shotgun assembler. Genome Res 2002, 12:177-189.
14. Huang X., Madan A. Cap3: a DNA sequence assembly program. Genome Res 1999, 9:868-877.
15. Pop M. Genome sequence assembly: algorithms and issues. Computer 2002, 4754.
16. Streicher E.M., et al. Spoligotype signatures in the mycobacterium tuberculosis complex. J Clin Microbiol 2007, 45:237-240.
17. Haddad N., et al. Spoligotype diversity of mycobacterium bovis strains isolated in france from 1979 to 2000. J Clin Microbiol 2001, 39:3623-3632.
18. Sola C., et al. Spoligotype database of mycobacterium tuberculosis: biogeographic distribution of shared types and epidemiologic and phylogenetic perspectives. Emerg Infect Dis 2001, 7:390-396.
19. Duarte E.L., et al. Spoligotype diversity of mycobacterium bovis and mycobacterium caprae animal isolates. Vet Microbiol 2008, 130:415-421.
20. Nivin B., et al. Use of spoligotype analysis to detect laboratory cross-contamination. Infect Control Hosp Epidemiol 2000, 21:525-527.
21. Voelkerding K. Next-generation sequencing: from basic research to diagnostics. Clin Chem 2009, 55:641-658.
22. Mardis E. Next-generation dna sequencing methods. Annu Rev Genomics Hum Genet 2008, 9:387-402.
23. Shendure J., Ji H. Next-generation DNA sequencing. Nat Biotechnol 2008, 26:1135-1145.
24. Schatz M., et al. Assembly of large genomes using second-generation sequencing. Genome Res 2010, 20:1165-1173.
25. Pop M. Genome assembly reborn: recent computational challenges. Brief Bioinform 2009, 10:354-366.
26. Gormen TH et al. Introduction to algorithms, vol. 7. Chennai: MIT Press and McGraw-Hill Book Company; 1976. p. 1162-71.
27. Wajid B, Serpedin E. Supplementary information section: review of general algorithmic features for genome assemblers for next generation sequencers. 2011. http://www.dl.dropbox.com/u/57205928/Appendix_Review_Paper_Bilal_Erchin.pdf.
28. Nemhauser G.L., Wolsey L.A. Integer and combinatorial optimization 1998, vol. 18. Wiley, New York.
29. Papadimitriou C.H., Steiglitz K. Combinatorial optimization: algorithms and complexity 1998, Dover.
30. Hromkovic J. Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics 2010, Springer-Verlag.
31. Korte B.H., Vygen J. Combinatorial optimization: theory and algorithms 2006, vol. 21. Springer Verlag.
32. Brouwer A.E., Haemers W.H. Spectra of graphs 2012, Springer Verlag.
33. Stillman B. The genome of homo sapiens 2003, vol. 68. CSHL Press.
34. Rodriguez-Ezpeleta N., et al. Bioinformatics for high throughput sequencing 2011, Springer Verlag.
35. Padua D. Encyclopedia of parallel computing 2011, Springer-Verlag, New York Inc.
36. Fleischner H. Eulerian graphs and related topics 1990, North-Holland.
37. Myers E. Toward simplifying and accurately formulating fragment assembly. J Comput Biol 1995, 2:275-290.
38. Miller J., et al. Assembly algorithms for next-generation sequencing data. Genomics 2010, 95:315-327.
39. Meader S., et al. Genome assembly quality: assessment and improvement using the neutral indel model. Genome Res 2010, 20:675-684.
40. Alkan C., et al. Limitations of next-generation genome sequence assembly. Nat Methods 2010, 8:61-65.
41. Koller D., Friedman N. Probabilistic graphical models: principles and techniques 2009, The MIT Press.
42. Marcais G. Genome assembly, techniques; 2011.
43. Wendl M.C., et al. Genome assembly. Encyclopedia of genetics, genomics, proteomics and bioinformatics 2005, Wiley.
44. Koren S., et al. An algorithm for automated closure during assembly. BMC bioinformatics 2010, 11:457.
45. Miller J.R., et al. Aggressive assembly of pyrosequencing reads with mates. Bioinformatics 2008, 24:2818-2824.
46. Si J. Handbook of learning and approximate dynamic programming 2004, vol. 2. Wiley-IEEE Press, Berlin.
47. Lew A., Mauch H. Dynamic programming: a computational tool 2007, vol. 38. Springer-Verlag, New York Inc.
48. Denardo E.V. Dynamic programming: models and applications 2003, Dover Pubns.
49. Sniedovich M. Dynamic programming: foundations and principles 2009, vol. 273. CRC.
50. Pevzner P., et al. An Eulerian path approach to DNA fragment assembly. Proc Natl Acad Sci USA 2001, 98:9748-9753.
51. Pevzner P., et al. De novo repeat classification and fragment assembly. Genome Res 2004, 14:1786-1796.
52. Chaisson M., Pevzner P. Short read fragment assembly of bacterial genomes. Genome Res 2008, 18:324-330.
53. Chaisson M.J., et al. De novo fragment assembly with short mate paired reads: does the read length matter?. Genome Res 2009, 19:336-346.
54. Raphael B., et al. A novel method for multiple alignment of sequences with repeated and shuffled elements. Genome Res 2004, 14:2336-2346.
55. Medvedev P., et al. Computability of models for sequence assembly. Algorithms in bioinformatics. Lecture Notes in Computer Science 2007, Springer, p. 289-301.
56. Zhi D., et al. Identifying repeat domains in large genomes. Genome Biol 2006, 7:R7.
57. McHugh JA. Algorithmic graph theory. Prentice Hall; 1990.
58. Kasianov V.N., Evstignee V.A. Graph theory for programmers: algorithms for processing trees 2000, vol. 515. Springer.
59. Cormen T.H. Introduction to algorithms 2001, The MIT Press.
60. Gallier JH. Discrete mathematics, some notes. Technical reports (CIS); 2009. p. 897.
61. Zerbino D.R., Birney E. Velvet: algorithms for de novo short read assembly using de-bruijn graphs. Genome Res 2008, 18:821-829.
62. Koffman E.B., Wolfgang P.A.T. Data structures: abstraction and design using Java 2010, Wiley.
63. Dale N.B., Lewis J. Computer science illuminated 2007, Jones & Bartlett Learning.
64. Neapolitan R.E., Naimipour K. Foundations of algorithms 2009, Jones & Bartlett Learning.
65. Varghese G. Network algorithmics 2010, Chapman & Hall/CRC.
66. Skiena S.S. The algorithm design manual 1998, vol. 1. Springer.
67. Butler J., et al. Allpaths: de novo assembly of whole-genome shotgun microreads. Genome Res 2008, 18:810-820.
68. Gnerre S., et al. High-quality draft assemblies of mammalian genomes from massively parallel sequence data. Proc Natl Acad Sci USA 2011, 108:1513-1518.
69. Hernandez D., et al. De novo bacterial genome sequencing: millions of very short reads assembled on a desktop computer. Genome Res 2008, 18:802-809.
70. Manber U., Myers G. Suffix arrays a new method for online string searches. SIAM J Sci Comput 1993, 22:935-948.
71. Myers E.W. The fragment assembly string graph. Bioinformatics 2005, 21(Suppl 2):ii79-ii85.
72. Schmidt B., et al. A fast hybrid short read fragment assembly algorithm. Bioinformatics 2009, 25:2279-2280.
73. Zhang W., et al. A practical comparison of de novo genome assembly software tools for next-generation sequencing technologies. PLoS One 2011, 6:e17915.
74. Warren R.L., et al. Assembling millions of short dna sequences using ssake. Bioinformatics 2007, 23:500-501.
75. Jeck W.R., et al. Extending assembly of short dna sequences to handle error. Bioinformatics 2007, 23:2942-2944.
76. Bryant D.W., et al. Qsra-a quality-value guided de novo short read assembler. BMC Bioinformatics 2009, 10:69.
77. Gnerre S., et al. Assisted assembly: how to improve a de novo genome assembly by using related species. Genome Biol 2009, 10:R88.
78. Pop M., et al. Comparative genome assembly. Brief Bioinform 2004, 5:237-248.
79. Kurtz S., et al. Versatile and open software for comparing large genomes. Genome Biol 2004, 5:R12.
80. Pop M., et al. Hierarchical scaffolding with bambus. Genome Res 2004, 14:149-159.
81. Salzberg S.L., et al. Gene-boosted assembly of a novel bacterial genome from very short reads. PLoS Comput Biol 2008, 4:e1000186.
82. Delcher A.L., et al. Identifying bacterial genes and endosymbiont dna with glimmer. Bioinformatics 2007, 23:673-679.
83. Altschul S.F., et al. Gapped blast and psi-blast: a new generation of protein database search programs. Nucleic Acids Res 1997, 25:3389-3402.
84. Gertz E.M., et al. Composition-based statistics and translated nucleotide searches: improving the tblastn module of blast. BMC Biol 2006, 4:41.
85. Dohm J.C., et al. Sharcgs, a fast and highly accurate short-read assembly algorithm for de novo genomic sequencing. Genome Res 2007, 17:1697-1706.
86. Laserson J., Jojic V., Koller D. Genovo: de novo assembly for metagenomes. J Comput Biol 2011, 18:429-443.
87. Goecks J., et al. Galaxy: a comprehensive approach for supporting accessible, reproducible, and transparent computational research in the life sciences. Genome Biol 2010, 11:R86.
88. Lin J, Schatz M. Design patterns for efficient graph algorithms in mapreduce. In: Proceedings of the 8th workshop on mining and learning with graphs. ACM. p. 78-85.
89. McKenna A., et al. The Genome Analysis Toolkit: a MapReduce framework for analyzing next-generation DNA sequencing data. Genome Res 2010, 20:1297-1303.
90. Schatz M.C., et al. Cloud computing and the DNA data race. Nat Biotechnol 2010, 28:691-693.