Skip Nav Destination
Close Modal
Update search
NARROW
Format
Journal
TocHeadingTitle
Date
Availability
1-1 of 1
Walter Cedeño
Close
Follow your search
Access your saved searches in your account
Would you like to receive an alert when new items match your search?
Sort by
Journal Articles
Publisher: Journals Gateway
Evolutionary Computation (1994) 2 (4): 321–345.
Published: 01 December 1994
Abstract
View articletitled, Multiniche Crowding in Genetic Algorithms and Its Application to the Assembly of DNA Restriction-Fragments
View
PDF
for article titled, 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.