Multiniche Crowding in Genetic Algorithms and Its Application to the Assembly of DNA Restriction-Fragments
- 1 December 1994
- journal article
- research article
- Published by MIT Press in Evolutionary Computation
- Vol. 2 (4) , 321-345
- https://doi.org/10.1162/evco.1994.2.4.321
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.Keywords
This publication has 7 references indexed in Scilit:
- Searching for Diverse, Cooperative Populations with Genetic AlgorithmsEvolutionary Computation, 1993
- Optimizing restriction fragment fingerprinting methods for ordering large genomic librariesGenomics, 1990
- A high-resolution, fluorescence-based, semiautomated method for DNA fingerprintingGenomics, 1989
- Algorithms for the restriction-site mapping of DNA molecules.Proceedings of the National Academy of Sciences, 1988
- Random-clone strategy for genomic restriction mapping in yeast.Proceedings of the National Academy of Sciences, 1986
- Automatic construction of restriction site mapsNucleic Acids Research, 1982