Toward Simplifying and Accurately Formulating Fragment Assembly

Journal of Computational Biology

Volumn 2, Issue 2, 1995, Pages 275-290

  Myers, Eugene W ^a  

^a UNIVERSITY OF ARIZONA   (United States)

Author keywords

fragment assembly; sequence rconstruction; shotgun DNA sequencing

Indexed keywords

DNA; OLIGODEOXYRIBONUCLEOTIDE;

ARTICLE; CHEMISTRY; MATHEMATICS; NUCLEOTIDE SEQUENCE; PROBABILITY; REPRODUCIBILITY; STATISTICAL MODEL;

BASE SEQUENCE; DNA; MATHEMATICS; MODELS, STATISTICAL; OLIGODEOXYRIBONUCLEOTIDES; PROBABILITY; REPRODUCIBILITY OF RESULTS;

EID: 0029312158     PISSN: 10665277     EISSN: 15578666     Source Type: Journal    
DOI: 10.1089/cmb.1995.2.275     Document Type: Article

References (19)

1. Bell, G.I. 1992. Roles of repetitive sequences. Computers Chim. 16, 135-143.
2. Bimbaum, Z.W. 1952. Numerical tabulation of the distribution of Kolmogorov's statistic for finite sample size.
3. J. Am. Statist. Assoc. 47, 425-441.
4. Church, A., and Rosser, J.B. 1936. Some properties of Conversion. Trans. Amen Math. Sac. 39, 472-482.
5. Huang, X. 1992. A contig assembly program based on sensitive detection of fragment overlaps. Genomics 14, 18-25. Iris, F.J.M. 1994. Optimized methods for large-scale shotgun sequencing in Alu-rich genomic regions, 199-210. In Adams, M.D., Fields, C., and Venter, J.C., eds. Automated DNA Sequencing and Analysis, Academic Press, London.
6. Kececioglu, J. 1991. “Exact and approximation algorithms for DNA sequence reconstruction.” Ph.D. thesis. Technical Report 91-26, Department of Computer Science, The University of Arizona, Tucson, AZ.
7. Kececioglu, J., and Myers, E. 1995. Exact and approximate algorithms for the sequence reconstruction problem.
8. Algorithmica 13, (1-2), 7-51.
9. Kolmogorov, A. 1933. Sulla determinazione empirica di una legge di distribuzione. Giom. 1st. Ital Attuari. 4, 83-91. Landau, G.M., Myers, E.W., and Schmidt, J.P. 1995. Incremental string comparison. SIAM J. Computing (submitted). Lander, E.S., and Waterman, M.S. 1988. Genomic mapping by fingerprinting random clones: A mathematical analysis. Genomics 2, 231-239.
10. Li, M. 1990. Towards a DNA sequencing theory. Proc. 31st IEEE Symp. on Found, of Computer Science 125-134. Maxam, A.M., and Gilbert, W. 1977. A new method for sequencing DNA. Proc. Natl Acad, Set USA 74, 560-564. Myers, E. 1986. Incremental alignment algorithms and their applications. Tech. Rep. 86-22, Dept, of Computer Science, U. of Arizona, Tucson, AZ.
11. Peltola, H., Soderlund, H., and Ukkonen, E. 1984. SEQAID: A DNA sequence assembly program based on a mathematical model. Nucleic Acids Res. 12, 307-321.
12. Sellers, P.H. 1980. The theory and computation of evolutionary distances: Pattern recognition. J. Algorithms 1, 359-373.
13. Smirnov, N.V. 1941. Approximate laws of distribution of random variables from empirical data. Uspekhi Mat. Nauk 10, 179-206 (in Russian).
14. Tarhio, J., and Ukkonen, E. 1988. A greedy approximation algorithm for constructing shortest common superstrings.
15. Theoret. Computer Sci. 57, 131-145.
16. Turner, J. 1989. Approximation algorithms for the shortest conmion superstring problem. Information and Computation 83, 1-20.
17. Sanger, F., Nicklen, S., and Coulson, A.R. 1977. DNA sequencing with chain-terminating inhibitors. Proc. Natl.
18. Acad. Sci. USA 74, 5463-5467.
19. Sanger, F. Coulson, A.R., Hong, G.F., Hill, D.F., and Petersen, G.B. 1982, Nucleotide sequence of bacteriophage k DNA. J. Mol. Biol. 162, 729-773.