CHAPTER THIRTY-FOUR – Stochastic Optimization Tools for Genomic Sequence Assembly

[1]  A. Cuticchia,et al.  The use of simulated annealing in chromosome reconstruction experiments based on binary scoring. , 1992, Genetics.

[2]  Jonathan S. Turner,et al.  Approximation Algorithms for the Shortest Common Superstring Problem , 1989, Inf. Comput..

[3]  C Burks,et al.  Electronic data publishing and GenBank. , 1991, Science.

[4]  R. Staden.  A strategy of DNA sequencing employing computer programs. , 1979, Nucleic acids research.

[5]  C. Burks,et al.  Artificially generated data sets for testing DNA sequence assembly algorithms. , 1993, Genomics.

[6]  E. Lander,et al.  Genomic mapping by fingerprinting random clones: a mathematical analysis. , 1988, Genomics.

[7]  L. Hood,et al.  Large-scale DNA sequencing. , 1991, Current opinion in biotechnology.

[8]  D. Balding,et al.  Statistical analysis of DNA fingerprint data for ordered clone physical mapping of human chromosomes. , 1991, Bulletin of mathematical biology.

[9]  Carol Soderlund,et al.  Calculating shared fragments for the single digest problem , 1993, [1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences.

[10]  C. E. Hildebrand,et al.  Physical mapping of human chromosomes by repetitive sequence fingerprinting. , 1990, Proceedings of the National Academy of Sciences of the United States of America.

[11]  David Maier,et al.  On Finding Minimal Length Superstrings , 1980, J. Comput. Syst. Sci..

[12]  S Brunak,et al.  Multiple alignment using simulated annealing: branch point definition in human mRNA splicing. , 1992, Nucleic acids research.

[13]  M. Waterman,et al.  The accuracy of DNA sequences: estimating sequence quality. , 1992, Genomics.

[14]  M. Waterman,et al.  Mapping DNA by stochastic relaxation , 1987 .

[15]  R. Staden.  A new computer method for the storage and manipulation of DNA gel reading data. , 1980, Nucleic acids research.

[16]  Esko Ukkonen,et al.  A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings , 1988, Theor. Comput. Sci..

[17]  R. Staden,et al.  A sequence assembly and editing program for efficient management of large projects. , 1991, Nucleic acids research.

[18]  L. Hood,et al.  Large-scale and automated DNA sequence determination. , 1991, Science.

[19]  X. Huang,et al.  A contig assembly program based on sensitive detection of fragment overlaps. , 1992, Genomics.

[20]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[21]  Hans Söderlund,et al.  SEQAID: a DNA sequence assembling program based on a mathematical model , 1984, Nucleic Acids Res..

[22]  J. Gallant.  The complexity of the overlap method for sequencing biopolymers. , 1983, Journal of theoretical biology.