A graph theoretic approach to the analysis of DNA sequencing data

Genome Research

Volumn 6, Issue 2, 1996, Pages 80-91

  Berno, Anthony J ^a  

^a STANFORD UNIVERSITY SCHOOL OF MEDICINE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OLIGOMER;

ALGORITHM; ARTICLE; DATA ANALYSIS; DNA DETERMINATION; DNA SEQUENCE; PRIORITY JOURNAL;

EID: 0029971394     PISSN: 10549803     EISSN: None     Source Type: Journal    
DOI: 10.1101/gr.6.2.80     Document Type: Article

References (8)

1. Cormen, T.H., C.E. Leiserson and R.L. Rivest. 1992. Single-source shortest paths. In Introduction to algorithms, pp. 514-550. The MIT Press, Cambridge, MA.
2. Giddings, M.C., R.L. Brumley Jr., M. Haker, and L. Smith. 1993. An adaptive, object oriented strategy for base calling in DNA sequence analysis. Nucleic Acids Res. 21: 4530-4540.
3. Golden, J.B. III, D. Torgersen, and C. Tibbetts. 1993. Pattern recognition for automated DNA sequencing I: On-line signal conditioning and feature extraction for basecalling. In First International Conference on Intelligent Systems for Molecular Biology (ed. Hunter, Searls, and Shavlik). AAAI Press, Washington, D.C.
4. Hunkapiller, T., R.J. Kaiser, B.F. Koop, and L. Hood. 1991. Large-scale and automated DNA sequence determination. Science 254: 59-67.
5. Masters, T. 1993. Practical neural network recipes in C++. Academic Press, San Diego, CA.
6. Needleman, S.B. and C.D. Wunsch. 1970. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48: 443-453.
7. Press, W.H., S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery. 1992. Gauss-Jordan elimination. In Numerical recipes in C, pp. 36-41. Cambridge University Press, Cambridge, MA.
8. Tibbetts, C., J.M. Bowling, and J.B. Golden III. 1993. Neural networks for automated base calling of gel-based DNA sequencing ladders. In Automated DNA sequencing and analysis techniques (ed. J. Craig Venter). Academic Press, San Diego, CA.