Genetic algorithms in molecular recognition and design
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A genetic algorithm takes an initial set of possible starting solutions, and iteratively improves them by means of crossover and mutation operators that are related to those involved in Darwinian evolution.
Abstract
Genetic algorithms provide a novel tool for the investigation of combinatorial optimization problems. A genetic algorithm takes an initial set of possible starting solutions, and iteratively improves them by means of crossover and mutation operators that are related to those involved in Darwinian evolution. This approach is illustrated by reference to applications in molecular modelling, the docking of flexible ligands into protein active sites and de novo ligand design.
