✦ LIBER ✦

A comparison of a direct search method and a genetic algorithm for conformational searching

✍ Scribed by Meza, J. C.; Judson, R. S.; Faulkner, T. R.; Treasurywala, A. M.

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 780 KB
Volume: 17
Category: Article
ISSN: 0192-8651
DOI: 10.1002/(sici)1096-987x(19960715)17:9<1142::aid-jcc6>3.0.co;2-s

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Development of a novel genetic algorithm

Development of a novel genetic algorithm search method (GAP1.0) for exploring peptide conformational space

✍ Jin, A. Y.; Leung, F. Y.; Weaver, D. F. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 260 KB 👁 1 views

A genetic algorithm-driven search method GAP1.0; Genetic . Algorithm Peptide search, version 1.0 has been developed for the computational exploration of peptide conformational space. The suitability of a variety of genetic algorithm operators was evaluated through representative calculations w x Ž .

A Direct Search Method for Nonlinear Pro

A Direct Search Method for Nonlinear Programming

✍ J.M. Martínez 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB 👁 1 views

A genetic algorithm with local search st

A genetic algorithm with local search strategy for improved detection of community structure

✍ Shuzhuo Li; Yinghui Chen; Haifeng Du; Marcus W. Feldman 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 324 KB

Three variations of genetic algorithm fo

Three variations of genetic algorithm for searching biomolecular conformation space: Comparison of GAP 1.0, 2.0, and 3.0

✍ Jin, A. Y.; Leung, F. Y.; Weaver, D. F. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 279 KB 👁 1 views

Three genetic algorithm programs, GAP 1.0, 2.0, and 3.0, were used in conjunction with the ECEPPr2 force field to search the conformation w x space of Met -enkephalin. Each program was proficient at quickly finding many diverse low-energy conformers. Conformer populations displayed a variety of seco

Greedy search and a hybrid local optimiz

Greedy search and a hybrid local optimization/genetic algorithm for tree-based inverse scattering

✍ Raymond A. Wildman; Daniel S. Weile 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

## Abstract A genetic programming‐based geometry optimization method for inverse scattering that uses a tree data structure to encode Boolean combinations of convex shapes has recently been shown to outperform other genetic algorithm‐based techniques. Nonetheless, the genetic algorithms are still i

A novel exhaustive search algorithm for

A novel exhaustive search algorithm for predicting the conformation of polypeptide segments in proteins

✍ Charlotte M. Deane; Tom L. Blundell 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB 👁 2 views

We present a fast ab initio method for the prediction of local conformations in proteins. The program, PETRA, selects polypeptide fragments from a computer-generated database (APD) encoding all possible peptide fragments up to twelve amino acids long. Each fragment is defined by a representative set