Multiniche crowding in genetic algorithms and its application to the assembly of dna restriction-fragments

Authors:
Walter Cedeòo;V. Rao Vemuri;Tom Slezak
Affiliations:
Department of Applied Science University of California, Davis and Lawrence Livermore National Laboratory Livermore, CA 94550 wcedeno@llnl.gov;Department of Applied Science University of California, Davis and Lawrence Livermore National Laboratory Livermore, CA 94550 vemurl@llnl.gov;Human Genome Center Lawrence Livermore National Laboratory Livermore, CA 94550 slezakl@llnl.gov
Venue:
Evolutionary Computation
Year:
1994

Citing 10
Cited 10

Genetic algorithms with sharing for multimodal function optimization

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Genetic Algorithms, Operators, and DNA Fragment Assembly

Machine Learning - Special issue on applications in molecular biology
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence

Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
An Investigation of Niche and Species Formation in Genetic Function Optimization

Proceedings of the 3rd International Conference on Genetic Algorithms
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator

Proceedings of the 3rd International Conference on Genetic Algorithms
Uniform Crossover in Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms
Genetic Algorithms for DNA Sequence Assembly

Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology
An analysis of the behavior of a class of genetic adaptive systems.

An analysis of the behavior of a class of genetic adaptive systems.
Searching for diverse, cooperative populations with genetic algorithms

Evolutionary Computation

Least Committment Graph Matching by Evolutionary Optimisation

ECCV '00 Proceedings of the 6th European Conference on Computer Vision-Part I
Selection Strategies for Ambiguous Graph Matching by Evolutionary Optimisation

Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Replacement strategies to preserve useful diversity in steady-state genetic algorithms

Information Sciences: an International Journal
The Double Digest Problem: finding all solutions

International Journal of Bioinformatics Research and Applications
Ensemble of niching algorithms

Information Sciences: an International Journal
Modeling the performance of evolutionary algorithms on the root identification problem: A case study with pbil and chc algorithms

Evolutionary Computation
Genetic algorithm for double digest problem

PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
Stamping line optimization using genetic algorithms and virtual 3D line simulation

HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part I
Finding good affinity patterns for matchmaking parties assignment through evolutionary computation

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
A Review of Niching Genetic Algorithms for Multimodal Function Optimization

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

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.