Premium
A comparison of a direct search method and a genetic algorithm for conformational searching
Author(s) -
Meza J. C.,
Judson R. S.,
Faulkner T. R.,
Treasurywala A. M.
Publication year - 1996
Publication title -
journal of computational chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.907
H-Index - 188
eISSN - 1096-987X
pISSN - 0192-8651
DOI - 10.1002/(sici)1096-987x(19960715)17:9<1142::aid-jcc6>3.0.co;2-s
Subject(s) - maxima and minima , genetic algorithm , grid , algorithm , search algorithm , computer science , population , class (philosophy) , energy (signal processing) , mathematics , artificial intelligence , machine learning , statistics , mathematical analysis , geometry , demography , sociology
We present results from the application of two conformational searching methods: genetic algorithms (GA) and direct search methods for finding low energy conformations of organic molecules. GAs are in a class of biologically motivated optimization methods that evolve a population of individuals in which individuals who are more “fit” have a higher probability of surviving into subsequent generations. The parallel direct search method (PDS) is a type of pattern search method that uses an adaptive grid to search for minima. Both methods found energies equal to or lower than the energy of the relaxed crystal structure in all cases, at a relatively small cost in CPU time. We suggest that either method would be a good candidate to find 3‐D conformations in a large scale screening application. © 1996 by John Wiley & Sons, Inc.