Shotgun Sequence Assembly

Advances in Computers

Volumn 60, Issue C, 2004, Pages 193-248

  Pop, Mihai ^a  

^a J CRAIG VENTER INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34547312505     PISSN: 00652458     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0065-2458(03)60006-9     Document Type: Review

References (137)

1. Sanger F., et al. Nucleotide sequence of bacteriophage lambda DNA. J. Mol. Biol. 162 4 (1982) 729-773
2. Staden R. Automation of the computer handling of gel reading data produced by the shotgun method of DNA sequencing. Nucleic Acids Res. 10 (1982) 4731-4751
3. Gingeras T.R., et al. Computer programs for the assembly of DNA sequences. Nucleic Acids Res. 7 2 (1979) 529-545
4. Fleischmann R.D., et al. Whole-genome random sequencing and assembly of Haemophilus influenzae Rd. Science 269 5223 (1995) 496-512
5. Sutton G.G., et al. TIGR assembler: A new tool for assembling large shotgun sequencing projects. Genome Science and Technology 1 (1995) 9-19
6. Green P. Against a whole-genome shotgun. Genome Res. 7 5 (1997) 410-417
7. Adams M.D., et al. The genome sequence of Drosophila melanogaster. Science 287 5461 (2000) 2185-2195
8. Myers E.W., et al. A whole-genome assembly of Drosophila. Science 287 5461 (2000) 2196-2204
9. Venter J.C., et al. The sequence of the human genome. Science 291 5507 (2001) 1304-1351
10. Consortium I.H.G.S. Initial sequencing and analysis of the human genome. Nature 409 (2001) 860-921
11. Semple C.A., et al. Computational comparison of human genomic sequence assemblies for a region of chromosome 4. Genome Res. 12 3 (2002) 424-429
12. Aach J., et al. Computational comparison of two draft sequences of the human genome. Nature 409 6822 (2001) 856-859
13. Adams M.D., et al. The independence of our genome assemblies. Proc. Natl. Acad. Sci. USA 100 6 (2003) 3025-3026
14. Waterston R.H., Lander E.S., and Sulston J.E. More on the sequencing of the human genome. Proc. Natl. Acad. Sci. USA 100 6 (2003) 3022-3024 author reply 3025-3026
15. Waterston R.H., Lander E.S., and Sulston J.E. On the sequencing of the human genome. Proc. Natl. Acad. Sci. USA 99 6 (2002) 3712-3716
16. Green P. Whole-genome disassembly. Proc. Natl. Acad. Sci. USA 99 7 (2002) 4143-4144
17. Myers E.W., et al. On the sequencing and assembly of the human genome. Proc. Natl. Acad. Sci. USA 99 7 (2002) 4145-4146
18. Batzoglou S., et al. ARACHNE: a whole-genome shotgun assembler. Genome Res. 12 1 (2002) 177-189
19. Jaffe D.B., et al. Whole-genome sequence assembly for Mammalian genomes: arachne 2. Genome Res. 13 1 (2003) 91-96
20. Mullikin J.C., and Ning Z. The phusion assembler. Genome Res. 13 1 (2003) 81-90
21. Havlak P., et al. The Atlas whole-genome assembler. Currents in Computational Molecular Biology, Montreal, Canada (2001)
22. Aparicio S., et al. Whole-genome shotgun assembly and analysis of the genome of Fugu rubripes. Science 297 5585 (2002) 1301-1310
23. Waterston R.H., et al. Initial sequencing and comparative analysis of the mouse genome. Nature 420 6915 (2002) 520-562
24. Consortium R.g.s. Rat. Genome project. http://www.hgsc.bcm.tmc.edu/projects/rat
25. Kirkness E.F., et al. The dog genome: survey sequencing and comparative analysis. Science 301 5641 (2003) 1898-1903
26. Dehal P., et al. The draft genome of Ciona intestinalis: insights into chordate and vertebrate origins. Science 298 5601 (2002) 2157-2167
27. Green E.D. Strategies for the systematic sequencing of complex genomes. Nat. Rev. Genet. 2 8 (2001) 573-583
28. Cai W.W., et al. A clone-array pooled shotgun strategy for sequencing large genomes. Genome Res. 11 10 (2001) 1619-1623
29. Lander E.S., and Waterman M.S. Genomic mapping by fingerprinting random clones: A mathematical analysis. Genomics 2 3 (1988) 231-239
30. Czabarka E., et al. Algorithms for optimizing production DNA sequencing. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) (2000)
31. Batzoglou S., et al. Sequencing a genome by walking with clone-end sequences: A mathematical analysis. Genome Res. 9 (1999) 1163-1174
32. Li X., and Waterman M.S. Estimating the repeat structure and length of DNA sequences using ell-tuples. Genome Res. 13 8 (2003) 1916-1922
33. Arratia R., et al. Genomic mapping by anchoring random clones: A mathematical analysis. Genomics 11 4 (1991) 806-827
34. Roach J.C., et al. Pairwise end sequencing: A unified approach to genomic mapping and sequencing. Genomics 26 (1995) 345-353
35. Port E., et al. Genomic mapping by end-characterized random clones: A mathematical analysis. Genomics 26 1 (1995) 84-100
36. Yeh R.F., et al. Predicting Progress in Shotgun Sequencing with Paired Ends (2002)
37. Chissoe S.L., et al. Representation of cloned genomic sequences in two sequencing vectors: correlation of DNA sequence and subclone distribution. Nucleic Acids Res. 25 15 (1997) 2960-2966
38. Mullis K., et al. Specific enzymatic amplification of DNA in vitro: the polymerase chain reaction. Cold Spring Harb. Symp. Quant. Biol. 51 Pt 1 (1986) 263-273
39. Burgart L.J., et al. Multiplex polymerase chain reaction. Mod. Pathol. 5 3 (1992) 320-323
40. Tettelin H., et al. Optimized multiplex PCR: efficiently closing a whole-genome shotgun sequencing project. Genomics 62 3 (1999) 500-507
41. Beigel R., et al. An optimal procedure for gap closing in whole genome shotgun sequencing. Proceedings of the Fifth Annual International Conference on Computational Biology (RECOMB) (2001)
42. Alon N., et al. Learning a hidden matching. Proceedings of the IEEE symposium on Foundations of Computer Science (FOCS) (2002)
43. Staden R., Judge D.P., and Bonfield J.K. Sequence assembly and finishing methods. Methods Biochem. Anal. 43 (2001) 303-322
44. Gordon D., Desmarais C., and Green P. Automated finishing with autofinish. Genome Res. 11 4 (2001) 614-625
45. Gordon D., Abajian C., and Green P. Consed: A graphical tool for sequence finishing. Genome Res. 8 (1998) 195-202
46. Mulyukov Z., and Pevzner P.A. EULER-PCR: finishing experiments for repeat resolution. Pac. Symp. Biocomput. (2002) 199-210
47. Toth G., Gaspari Z., and Jurka J. Microsatellites in different eukaryotic genomes: survey and analysis. Genome Res. 10 7 (2000) 967-981
48. Myers E.W. Toward simplifying and accurately formulating fragment assembly. J. Comp. Bio. 2 2 (1995) 275-290
49. HUGO, Summary of the report of the second international strategy meeting on human genome sequencing. http://www.gene.ucl.ac.uk/hugo/bermuda2.html
50. Garey M.R., and Johnson D.S. Computers and Intractability (1979), W.H. Freeman, New York
51. Blum A., et al. Linear approximation of shortest superstrings. Proc. 23rd Annual Symposium on the Theory of Computing, New Orleans, LA (1991)
52. Peltola H., et al. Algorithms for some string matching problems arising in molecular genetics. Proc. Information Processing (1983)
53. Teng S., and Yao F.F. Approximating shortest superstrings. SIAM J. Computing 26 2 (1997) 410-417
54. Armen C., and Stein C. A 2 2/3-approximation algorithm for the shortest superstring problem. Proc. Combinatorial Pattern Matching (1996)
55. Kececioglu J.D. Exact and Approximation Algorithms for DNA Sequence Reconstruction (1991), University of Arizona
56. Smith T.F., and Waterman M.S. Identification of common molecular subsequences. J. Mol. Biol. 147 1 (1981) 195-197
57. Peltola H., Soderlund H., and Ukkonen E. SEQAID: a DNA sequence assembling program based on a mathematical model. Nucleic Acids Res. 12 1 (1984) 307-321
58. Kececioglu J.D., and Myers E.W. Combinatorial algorithms for DNA sequence assembly. Algorithmica 13 (1995) 7-51
59. Idury R.M., and Waterman M.S. A new algorithm for DNA sequence assembly. J. Comp. Bio. 2 2 (1995) 291-306
60. Pevzner P.A., Tang H., and Waterman M.S. An Eulerian path approach to DNA fragment assembly. Proc. Natl. Acad. Sci. USA 98 17 (2001) 9748-9753
61. Pevzner P.A., and Tang H. Fragment assembly with double-barreled data. Bioinformatics 17 Suppl 1 (2001) S225-S233
62. Pevzner P.A., Tang H., and Waterman M.S. A new approach to fragment assembly in DNA sequencing. Proceedings of the Fifth Annual International Conference on Computational Biology (RECOMB) (2001)
63. Pop M., Salzberg S.L., and Shumway M. Genome sequence assembly: algorithms and issues. IEEE Computer 35 7 (2002) 47-54
64. Huang X., and Madan A. CAP3: A DNA sequence assembly program. Genome Res. 9 (1999) 868-877
65. Bevan M., et al. Sequence and analysis of the Arabidopsis genome. Curr. Opin. Plant. Biol. 4 2 (2001) 105-110
66. Kent W.J., and Haussler D. Assembly of the working draft of the human genome with GigAssembler. Genome Res. 11 9 (2001) 1541-1548
67. Olson M., et al. A common language for physical mapping of the human genome. Science 245 4925 (1989) 1434-1435
68. Wang J., et al. RePS: a sequence assembler that masks exact repeats identified from the shotgun data. Genome Res. 12 5 (2002) 824-831
69. Huson D.H., et al. Design of a compartmentalized shotgun assembler for the human genome. Bioinformatics 17 Suppl 1 (2001) S132-S139
70. Csuros M., and Milosavljevic A. Pooled genomic indexing (PGI) mathematical analysis and experiment design. Proceedings of the 2nd International Workshop on Algorithms in Bioinformatics (WABI) (2002), Springer-Verlag
71. Parsons R.J., Forrest S., and Burks C. Genetic algorithms, operators, and DNA fragment assembly. Machine Learning 21 (1995) 11-33
72. Goldberg M.K., and Lim D.T. A learning algorithm for the shortest superstring problem. Proceedings of the Atlantic Symposium on Computational Biology and Genome Information Systems and Technology, Durham, NC (2001)
73. Goldberg M.K., and Lim D.T. Designing and testing a new DNA fragment assembler VEDA-2. http://www.cs.rpi.edu/~goldberg/publications/veda-2.pdf
74. Jiang T., and Li M. DNA sequencing and string learning. Math. Sys. Theory 29 (1996) 387-405
75. King L.M., and Cummings M.P. Satellite DNA repeat sequence variation is low in three species of burying beetles in the genus Nicrophorus (Coleoptera: Silphidae). Mol. Biol. Evol. 14 11 (1997) 1088-1095
76. Kosaraju S.R., and Delcher A. Large-scale assembly of DNA strings and space-efficient construction of suffix trees(Correction). Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC'96 (1996)
77. Kosaraju S.R., and Delcher A.L. Large-scale assembly of DNA strings and space-efficient construction of suffix trees. Proceedings of the ACM Symposium on the Theory of Computing, STOC'95 (1995)
78. Chen T., and Skiena S.S. Trie-based data structures for sequence assembly. Proceedings of the Eighth Symposium on Combinatorial Pattern Matching (1997)
79. Chen T., and Skiena S.S. A case study in genome-level fragment assembly. Bioinformatics 16 (2000) 494-500
80. Weiner P. Linear pattern matching algorithms. Proceedings of the 14th IEEE Symposium on Switching and Automata Theory (1973)
81. Manber U., and Myers E.W. Suffix arrays: A new method for on-line string searches. SIAM J. Computing 22 (1993) 935-948
82. Ukkonen E. On-line construction of suffix-trees. Algorithmica 14 (1995) 249-260
83. McCreight E.M. A space-economical suffix tree construction algorithm. J. ACM 23 (1976) 262-272
84. Needleman S.B., and Wunsch C.D. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48 (1970) 443-453
85. Myers E.W., and Miller W. Optimal alignments in linear space. CABIOS 4 (1988) 11-17
86. Myers E.W. An O(nd) difference algorithm and its variations. Algorithmica 1 (1986) 251-266
87. Gusfield D. Algorithms on Strings, Trees, and Sequences (1997), The Press Syndicate of the University of Cambridge
88. Altschul S.F., et al. Basic local alignment search tool. J. Mol. Biol. 215 (1990) 403-410
89. Pearson W.R., and Lipman D.J. Improved tools for biological sequence comparison. Proc. Natl. Acad. Sci. USA 85 (1988) 2444-2448
90. Kim S., and Segre A.M. AMASS: A structured pattern matching approach to shotgun sequence assembly. J. Comp. Bio. 6 2 (1999) 163-186
91. Green P. PHRAP documentation: ALGORITHMS (1994)
92. Huang X. An improved sequence assembly program. Genomics 33 (1996) 21-31
93. Tammi M.T., et al. Correcting errors in shotgun sequences. Nucleic Acids Res. 31 15 (2003) 4663-4672
94. Roberts M., Hunt B.R., Yorke J.A., Bolanos R., Delcher A., "A preprocessor for shotgun assembly of large genomes", J. Comp. Bio., submitted for publication
95. Huang X., et al. PCAP: A whole-genome assembly program. Genome Res. 13 9 (2003) 2164-2170
96. Ewing B., and Green P. Base-calling of automated sequencer traces using phred. II. Error probabilities. Genome Res. 8 3 (1998) 186-194
97. Ewing B., et al. Base-calling of automated sequencer traces using phred. I. Accuracy assessment. Genome Res. 8 3 (1998) 175-185
98. Chou H.H., and Holmes M.H. DNA sequence quality trimming and vector removal. Bioinformatics 17 12 (2001) 1093-1104
99. Kececioglu J., and Yu J. Separating repeats in DNA sequence assembly. Proceedings of the Fifth Annual International Conference on Computational Biology (RECOMB), Montreal, Canada (2001)
100. Myers E.W. Optimally separating sequences. Genome Informatics 12 (2001) 165-174
101. Tammi M.T., et al. Separation of nearly identical repeats in shotgun assemblies using defined nucleotide positions, DNPs. Bioinformatics 18 3 (2002) 379-388
102. Tammi M.T., Arner E., and Andersson B. TRAP: Tandem Repeat Assembly Program produces improved shotgun assemblies of repetitive sequences. Comput. Methods Programs Biomed. 70 1 (2003) 47-59
103. Pe'er I., and Shamir R. Spectrum alignment: Efficient resequencing by hybridization. Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology (ISMB) (2000)
104. Bailey J.A., et al. Segmental duplications: organization and impact within the current human genome project assembly. Genome Res. 11 (2001) 1005-1017
105. Pevzner P., and Tang H. Fragment assembly with double barreled data. ISMB'01 (2001)
106. Gribskov M., McLachlan A.D., and Eisenberg D. Profile analysis: Detection of distantly related proteins. Proc. Natl. Acad. Sci. USA 84 (1987) 4355-4358
107. Anson E.L., and Myers E.W. ReAligner: A program for refining DNA sequence multi-alignments. RECOMB'97 (1997)
108. Churchill G.A., and Waterman M.S. The accuracy of DNA sequences: estimating sequence quality. Genomics 14 1 (1992) 89-98
109. Bonfield J.K., and Staden R. The application of numerical estimates of base calling accuracy to DNA sequencing projects. Nucleic Acids Res. 23 8 (1995) 1406-1410
110. Zhou S., et al. Whole-genome shotgun optical mapping of rhodobacter sphaeroides strain 2.4.1 and its use for whole-genome shotgun sequence assembly. Genome Res. 13 9 (2003) 2142-2151
111. Huson D.H., Reinert K., and Myers E. The greedy path-merging algorithm for sequence assembly. Proceedings of the Fifth Annual International Conference on Computational Biology (RECOMB) (2001)
112. Thayer E.C., Olson M.V., and Karp R.M. Error checking and graphical representation of multiple-complete-digest (MCD) restriction-fragment maps. Genome Res. 9 1 (1999) 79-90
113. Pop M., Kosack D., and Salzberg S.L. Hierarchical scaffolding with bambus. Genome Res. 14 1 (2004) 149-159
114. Kim S., Liao L., and Tomb J.F. A probabilistic approach to sequence assembly validation. Workshop on Data Mining in Bioinformatics (2001)
115. Seto D., Koop B.F., and Hood L. An experimentally derived data set constructed for testing large-scale DNA sequence assembly algorithms. Genomics 15 (1993) 673-676
116. Miller M.J., and Powell J.I. A quantitative comparison of DNA sequence assembly programs. J. Comp. Bio. 1 (1994) 257-269
117. Huson D.H., et al. Comparing assemblies using fragments and mate-pairs. Workshop on Algorithms in Bioinformatics (2001), Springer-Verlag
118. Engle M.L., and Burks C. Artificially generated data sets for testing DNA sequence assembly algorithms. Genomics 16 (1993) 286-288
119. Myers G. A dataset generator for whole genome shotgun sequencing. Proc. Int. Conf. Intell. Syst. Mol. Biol. (1999) 202-210
120. Lander E.S., et al. Initial sequencing and analysis of the human genome. Nature 409 6822 (2001) 860-921
121. Volik S., et al. End-sequence profiling: Sequence-based analysis of aberrant genomes. Proc. Natl. Acad. Sci. USA (2003)
122. Taillon-Miller P., et al. Overlapping genomic sequences: a treasure trove of single-nucleotide polymorphisms. Genome Res. 8 7 (1998) 748-754
123. Altshuler D., et al. An SNP map of the human genome generated by reduced representation shotgun sequencing. Nature 407 6803 (2000) 513-516
124. Mullikin J.C., et al. An SNP map of human chromosome 22. Nature 407 6803 (2000) 516-520
125. Dawson E., et al. A SNP resource for human chromosome 22: extracting dense clusters of SNPs from the genomic sequence. Genome Res. 11 1 (2001) 170-178
126. Read T.D., et al. Comparative genome sequencing for discovery of novel polymorphisms in Bacillus anthracis. Science 296 5575 (2002) 2028-2033
127. Lancia G., et al. SNPs problems, complexity and algorithms. 9th Annual European Symposium on Algorithms (BRICS), University of Aarhus, Denmark (2001)
128. Lippert R., et al. Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem. Briefings in Bioinformatics 3 1 (2002) 23-31
129. Fasulo D., et al. Efficiently detecting polymorphisms during the fragment assembly process. Bioinformatics 18 Suppl.1 (2002) S294-S302
130. Casjens S., et al. A bacterial genome in flux: the twelve linear and nine circular extrachromosomal DNAs in an infectious isolate of the Lyme disease spirochete Borrelia burgdorferi. Mol. Microbiol. 35 3 (2000) 490-516
131. Beja O., et al. Unsuspected diversity among marine aerobic anoxygenic phototrophs. Nature 415 6872 (2002) 630-633
132. Randazzo C.L., et al. Diversity, dynamics, and activity of bacterial communities during production of an artisanal Sicilian cheese as evaluated by 16S rRNA analysis. Appl. Environ. Microbiol. 68 4 (2002) 1882-1892
133. Pearson H. Body's bugs to be sequenced. Nature Science Update (2003)
134. Whitfield J. Genome pioneer sets sights on Sargasso Sea. Nature Science Update (2003)
135. Kececioglu J.D., Li M., and Tromp J. Inferring a DNA sequence from erroneous copies. Theoretical Computer Science 185 1 (1997) 3-13
136. Liang F., et al. An optimized protocol for analysis of EST sequences. Nucleic Acids Res. 28 18 (2000) 3657-3665
137. Kent W.J., and Haussler D. GigAssembler: An Algorithm for the Initial Assembly of the Human Genome Draft (2000), University of California Santa Cruz