Multiniche Crowding in Genetic Algorithms and Its Application to the Assembly of DNA Restriction-Fragments

The determination of the sequence of all nucleotide base-pairs in a DNA molecule, from restriction-fragment data, is a complex task and can be posed as the problem of finding the optima of a multimodal function. A genetic algorithm that uses multiniche crowding permits us to do this. Performance of this algorithm is first tested using a standard suite of test functions. The algorithm is next tested using two data sets obtained from the Human Genome Project at the Lawrence Livermore National Laboratory. The new method holds promise in automating the sequencing computations.

[1]  W. R. Pearson.  Automatic construction of restriction site maps , 1982, Nucleic Acids Res..

[2]  P. D. de Jong,et al.  A high-resolution, fluorescence-based, semiautomated method for DNA fingerprinting. , 1989, Genomics.

[3]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[4]  Samir W. Mahfoud.  Crowding and Preselection Revisited , 1992, PPSN.

[5]  Trevor I. Dix,et al.  Construction of restriction maps using a genetic algorithm , 1993, [1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences.

[6]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[7]  D. J. Cavicchio,et al.  Adaptive search using simulated evolution , 1970 .

[8]  James W. Fickett,et al.  A GENETIC ALGORITHM FOR ASSEMBLING CHROMOSOME PHYSICAL MAPS , 1993 .

[9]  M. Waterman,et al.  Optimizing restriction fragment fingerprinting methods for ordering large genomic libraries. , 1990, Genomics.

[10]  Kalyanmoy Deb,et al.  Massive Multimodality, Deception, and Genetic Algorithms , 1992, PPSN.

[11]  Kalyanmoy Deb,et al.  An Investigation of Niche and Species Formation in Genetic Function Optimization , 1989, ICGA.

[12]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[13]  Alan S. Perelson,et al.  Searching for Diverse, Cooperative Populations with Genetic Algorithms , 1993, Evolutionary Computation.

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

[15]  Walter Cedeño,et al.  An Investigation of DNA Mapping with Genetic Algorithms Preliminary Results , 1993 .

[16]  Jerrold R. Griggs,et al.  Interval graphs and maps of DNA. , 1986, Bulletin of mathematical biology.

[17]  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.

[18]  João Meidanis,et al.  Dynamic methods for fragment assembly in large scale genome sequencing projects , 1993, [1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences.

[19]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[20]  Jaroslav Opatrny,et al.  Total Ordering Problem , 1979, SIAM J. Comput..

[21]  Darrell Whitley,et al.  Genitor: a different genetic algorithm , 1988 .

[22]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[23]  J. David Schaffer,et al.  Proceedings of the third international conference on Genetic algorithms , 1989 .

[24]  Stephanie Forrest,et al.  Genetic Algorithms for DNA Sequence Assembly , 1993, ISMB.

[25]  V. Vemuri,et al.  Dynamic multimodal function optimization using genetic algorithms , 1992 .

[26]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[27]  Mark Stefik,et al.  Inferring DNA Structures from Segmentation Data , 1978, Artif. Intell..

[28]  J L Haines,et al.  A genetic linkage map of chromosome 17. , 1990, Genomics.

[29]  M Krawczak.  Algorithms for the restriction-site mapping of DNA molecules. , 1988, Proceedings of the National Academy of Sciences of the United States of America.

[30]  L. Darrell Whitley,et al.  Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.