Genetic algorithm,

Doll R and Van Hove M A 1996 Global optimization in LEED structure determination using genetic algorithms Surf. Sc 355 L393-8... 

Figure B3.2.1. The band structure of hexagonal GaN, calculated using EHT-TB parameters detemiined by a genetic algorithm [23]. The target energies are indicated by crosses. The target band structure has been calculated with an ab initio pseudopotential method using a quasiparticle approach to include many-particle corrections [194].

J. Holland, Genetic algorithms and the optimal allocation of trials, SIAM J. Gomputing 2 (1973), 88-105. 

S. Sun, Reduced representation model of protein structure prediction statistical potential and genetic algorithms. Protein Sci. 2 (1993), 762-785. 

Other methods which are applied to conformational analysis and to generating multiple conformations and which can be regarded as random or stochastic techniques, since they explore the conformational space in a non-deterministic fashion, arc genetic algorithms (GA) [137, 1381 simulation methods, such as molecular dynamics (MD) and Monte Carlo (MC) simulations 1139], as well as simulated annealing [140], All of those approaches and their application to generate ensembles of conformations arc discussed in Chapter II, Section 7.2 in the Handbook. 

D.E. Goldberg, Genetic Algorithms in Search, Optimi2ation and Machine Learning, Addison-Wesley, New York, 1989. 

Simulated Annealing-based solutions [19] are conceptually the same as Genetic Algorithm-based approaches. However, the SA-based techniques, in our experience, are more sensitive to the initial settings of the parameters. Nevertheless, once the correct ones are found, the method can achieve the efficiency of GA-based solutions. We must point out that SA-based solutions have never outperformed the GA-based ones in our studies. Much of what has been mentioned regarding the GA-based solutions is also relevant for the SA technique, particularly, with respect to the cost functions. 

Variable and pattern selection in a dataset can be done by genetic algorithm, simulated annealing or PCA... 

A molecular dynamics simulation samples the phase space of a molecule (defined by the position of the atoms and their velocities) by integrating Newton s equations of motion. Because MD accounts for thermal motion, the molecules simulated may possess enough thermal energy to overcome potential barriers, which makes the technique suitable in principle for conformational analysis of especially large molecules. In the case of small molecules, other techniques such as systematic, random. Genetic Algorithm-based, or Monte Carlo searches may be better suited for effectively sampling conformational space. 

To become familiar with genetic algorithms and their application to descriptor selection... 

Kohonen network Conceptual clustering Principal Component Analysis (PCA) Decision trees Partial Least Squares (PLS) Multiple Linear Regression (MLR) Counter-propagation networks Back-propagation networks Genetic algorithms (GA)... 

The concept of genetic algorithms was developed in the 1970s by John Holland [17]. 

The evolutionary process of a genetic algorithm is accomplished by genetic operators which translate the evolutionary concepts of selection, recombination or crossover, and mutation into data processing to solve an optimization problem dynamically. Possible solutions to the problem are coded as so-called artificial chromosomes, which are changed and adapted throughout the optimization process until an optimrun solution is obtained. 

A key feature ofa genetic algorithm is that only the best chromosomes are to pass their features to the next generation during evolution. 

GAlib (C+ + Library of Genetic Algorithm Components), Massachusetts Institute of Technology, http //lancet.mU.edu/ga/... 

The descriptor set can then be reduced by eliminating candidates that show such bad characteristics. Optimization techniques such as genetic algorithms (see Section 9.7) are powerful means of automating this selection process. 

Models developed with selected subsets of descriptors, instead of all possible descriptors, can be more accurate and robust. In order to select adequate descriptors for each of the four classes of protons, genetic algorithms (GA) were used, and the results were compared with those obtained when all the descriptors were used. 

HTS data as well as virtual screening can guide and direct the design of combinatorial libraries. A genetic algorithm (GA) can be applied to the generation of combinatorial libraries [18. The number of compounds accessible by combinatorial synthesis often exceeds the number of compounds which can be syiithcsii ed... 

Concomitantly with the increase in hardware capabilities, better software techniques will have to be developed. It will pay us to continue to learn how nature tackles problems. Artificial neural networks are a far cry away from the capabilities of the human brain. There is a lot of room left from the information processing of the human brain in order to develop more powerful artificial neural networks. Nature has developed over millions of years efficient optimization methods for adapting to changes in the environment. The development of evolutionary and genetic algorithms will continue. 

The chromosome in a genetic algorithm codes for the torsion angles of the rotatable bonds. 

This completes one complete cycle of the genetic algorithm. The new papulation then becomes the current population ready for a new cycle. The algorithm repeatedly applies this sequence for a predetermined number of iterations and/or until it com erges. 

---