A history of DNA sequence assembly

IT - Information Technology

Volumn 58, Issue 3, 2016, Pages 126-132

  Myers, Eugene W ^a  

^a MAX PLANCK INSTITUTE OF MOLECULAR CELL BIOLOGY AND GENETICS   (Germany)

Author keywords

De Bruijn graph; Shortest common superstring; Shotgun sequencing; String graph

Indexed keywords

DNA; DNA SEQUENCES; GENE ENCODING;

ALGORITHMIC IDEAS; COMBINATORIAL PROBLEM; DNA SEQUENCE ASSEMBLY; DNA SEQUENCING; SHORT HISTORY; SUB-STRINGS;

INVERSE PROBLEMS;

EID: 85113357568     PISSN: 16112776     EISSN: 21967032     Source Type: Journal    
DOI: 10.1515/itit-2015-0047     Document Type: Review

References (23)

1. F. Sanger, A.R. Coulson, G.F. Hong, D.F. Hill, and G.B. Petersen. Nucleotide sequence of bacteriophage lambda DNA. J. Mol. Biol., 162(4):729-773 1982.
2. E.S. Lander and M.S. Waterman. Genomic mapping by fingerprinting random clones: a mathematical analysis. Genomics, 2(3):231-239 1988.
3. J.L. Weber and E.W. Myers. Human Whole-Genome Shotgun Sequencing. Genome Research, 7:401-409 1997.
4. R.D. Fleischmann, M.D. Adams, O. White, Clayton,... C.M. Fraser, H.O. Smith, and J.C. Venter. Whole-genome Random Sequencing and Assembly of Haemophilus influenzae Rd. Science, 269(5223):496-512 1995.
5. J.C. Venter, M.D. Adams, E.W. Myers,..., and X. Zhu. The Sequence of the Humane Genome. Science, 291:1304-1351 2001.
6. H. Peltola, H. Saderlund, and E. Ukkonen. SEQAID: A DNA sequence assembling program based on a mathematical model. Nucleic Acids Research, 12:307-321 1984.
7. J. Kececioglu and E.W. Myers. Combinatorial algorithms for DNA sequence assembly. Algorithmica, 13(1/2):7-51 1995.
8. Green, P. Phrap, version 1.090518. http://phrap.org. 2009.
9. B. Ewing and P. Green. Basecalling of automated sequencer traces using phred. II. Error probabilities. Genome Research, 8:186-194 1998.
10. E. Ukkonen. Algorithms for approximate string matching. Information and Control, 64:100-118 1985.
11. E.W. Myers. An O(ND) Difference Algorithm and Its Variations. Algorithmica, 1(2):251-266 1986.
12. E.W. Myers. Efficient Alignment Discovery amongst Noisy Long Reads. Proc. Workshop on Algorithms for BioInformatics (WABI), pp. 52-67, Wroclaw, Poland, Sept. 2014.
13. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons 1985.
14. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press: p. 351 1997.
15. DIMACS Workshop on Combinatorial Methods for DNA Mapping and Sequencing. October, 1994. http://dimacs.rutgers.edu/Workshops/DNAMapping/program.html
16. E.W. Myers. Toward Simplifying and Accurately Formulating Fragment Assembly. J. Comput. Biology, 2(2):275-290 1995.
17. R.M. Idury and M.S. Waterman. A new algorithm for DNA sequence assembly. J. Comput. Biology, 2(2):291-306 1995.
18. E.W. Myers, G.G. Sutton,... G.M. Rubin, M.D. Adams, and J.C. Venter. A Whole-Genome Assembly of Drosophila. Science, 287:2196-2204 2000.
19. E.W. Myers. The Fragment Assembly String Graph. Bioinformatics, 21,Supp. 2:79-85 2005.
20. P.A. Pevzner, H. Tang, and M.S. Waterman. An Eulerian path approach to DNA fragment assembly. Proc. Natil. Acad. Sci. USA, 98(17):9748-9753 2001.
21. P.E.C. Compeau, P.A. Pevzner, and G. Tesler. How to apply de Bruijn graphs to genome assembly. Nature Biotechnology, 29:987-991 2011.
22. C.S. Chin, D.H. Alexander, P. Marks, A.A. Klammer, J. Drake, C. Heiner, A. Clum, A. Copeland, J. Huddleston, E.E. Eichler, S.W. Turner, and J. Korlach. Nonhybrid, finished microbial genome assemblies from long-read SMRT sequencing data. Nature Methods, 10:563-569 2013.
23. I.Y. Zhbannikov, S.S. Hunter, M.L. Settles, and J.A. Foster. SlopMap: A software application for quick and flexible identification of similar sequences using exact k-mer matching. J. Data Mining, Genomics, and Proteomics, 4(3) doi:10.4172/2153-0602.1000133 2013.