Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Genetic algorithms genotypes

Fig. 3 An illustration of the genetic algorithm approach, where the states of the ligand (translation, orientation, and conformation relative to the protein) are interpreted as the ligand genotype and the atomic coordinates represent the phenotype. A plot of the change in the fitness function (f(x)) as the ligand population is allowed to mutate, crossover, and migrate. The genetic evolution of the ligand effectively samples conformational space where the best conformer is identified by a minimum in the fitness function (Reprinted with permission from [179], copyright 1998 by John Wiley and Sons)... Fig. 3 An illustration of the genetic algorithm approach, where the states of the ligand (translation, orientation, and conformation relative to the protein) are interpreted as the ligand genotype and the atomic coordinates represent the phenotype. A plot of the change in the fitness function (f(x)) as the ligand population is allowed to mutate, crossover, and migrate. The genetic evolution of the ligand effectively samples conformational space where the best conformer is identified by a minimum in the fitness function (Reprinted with permission from [179], copyright 1998 by John Wiley and Sons)...
Genetic algorithms are typically used on function optimization problems, where they are used to calculate which input yields the maximum (or minimum) value. However, they have also been put to use on a wide variety of problems. These range from game-playing, where the genotype encodes a series of moves, to compiler optimization, in which case each gene is an optimization to be applied to a piece of code. [Pg.129]

Evolutionary optimisation methods are stochastic methods. This means that the available information about the objective funetion is complemented by random influences. The term evolutionary refers to the fact that the way of incorporating random influences into the optimisation process has in those methods been inspired by biological evolution. The most frequently used and most highly elaborated representatives of evolutionary methods are genetic algorithms (GAs), explained below, in which the incorporated random influences attempt to mimic the evolution of a genotype. Basically, this method involves ... [Pg.26]

Fallin D, Schork NJ. Accuracy of haplotype frequency estimation for biallelic loci via the expectation-maximization algorithm for unphased diploid genotype data. Am J Hum Genet 2000 67 947-959. [Pg.57]

O Connell, J. R. and Weeks, D. E. (1995). The VITESSE algorithm for rapid exact multilocus linkage analysis via genotype set-recoding and fuzzy inheritance. Nat. Genet. 11(4), 402-408. [Pg.177]

Genotype The collective genetic makeup of an organism. Often in evolutionary algorithms, the genotype and the chromosome are identical, but this is not always the case. [Pg.124]


See other pages where Genetic algorithms genotypes is mentioned: [Pg.154]    [Pg.71]    [Pg.424]    [Pg.338]    [Pg.1119]    [Pg.71]    [Pg.383]    [Pg.213]    [Pg.75]    [Pg.599]    [Pg.604]    [Pg.295]    [Pg.203]    [Pg.1801]   
See also in sourсe #XX -- [ Pg.95 ]




SEARCH



Genetic algorithm

Genotype

Genotype / genotyping

Genotypic

Genotyping

© 2024 chempedia.info