Quarterly (spring, summer, fall, winter)
176 pp. per issue
7 x 10
ISSN
1063-6560
E-ISSN
1530-9304
2014 Impact factor:
2.37

Evolutionary Computation

Winter 1994, Vol. 2, No. 4, Pages 321-345
(doi: 10.1162/evco.1994.2.4.321)
© 1994 by the Massachusetts Institute of Technology
Multiniche Crowding in Genetic Algorithms and Its Application to the Assembly of DNA Restriction-Fragments
Article PDF (2.05 MB)
Abstract

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.