𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficiency of tabu-search-based conformational search algorithms

✍ Scribed by Christoph Grebner; Johannes Becker; Svetlana Stepanenko; Bernd Engels


Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
571 KB
Volume
32
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

Efficient conformational search or sampling approaches play an integral role in molecular modeling, leading to a strong demand for even faster and more reliable conformer search algorithms. This article compares the efficiency of a molecular dynamics method, a simulated annealing method, and the basin hopping (BH) approach (which are widely used in this field) with a previously suggested tabu‐search‐based approach called gradient only tabu search (GOTS). The study emphasizes the success of the GOTS procedure and, more importantly, shows that an approach which combines BH and GOTS outperforms the single methods in efficiency and speed. We also show that ring structures built by a hydrogen bond are useful as starting points for conformational search investigations of peptides and organic ligands with biological activities, especially in structures that contain multiple rings. Β© 2011 Wiley Periodicals, Inc. J Comput Chem, 2011


πŸ“œ SIMILAR VOLUMES


New Tabu Search based global optimizatio
✍ Svetlana Stepanenko; Bernd Engels πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 381 KB

## Abstract The study presents two new nonlinear global optimization routines; the Gradient Only Tabu Search (GOTS) and the Tabu Search with Powell's Algorithm (TSPA). They are based on the Tabu‐Search strategy, which tries to determine the global minimum of a function by the __steepest descent–mil

Efficient algorithm for conformational s
✍ Wang, Cheuk-San πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 345 KB πŸ‘ 2 views

A new algorithm, complementarity, is developed for conformational search of macrocyclic molecules. The algorithm scans a large number of candidate conformations and energy-minimizes only the promising ones. These candidates can be generated by two operators that construct new conformations from know

A parallel tabu search for conformationa
✍ Morales, L. B.; GarduοΏ½o-JuοΏ½rez, R.; Aguilar-Alvarado, J. M.; Riveros-Castro, F. πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 213 KB πŸ‘ 2 views

We have developed and implemented a tabu search heuristic (TS) to determine the best energy minimum for oligopeptides. Our test molecule was Met-enkephalin, a pentapetide that over the years has been used as a validation model for many global optimizers. The test potential energy function was ECEPP/

Conformational searching using a populat
✍ Stephen M. Long; Tran T. Tran; Peter Adams; Paul Darwen; Mark L. Smythe πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 262 KB

A new population-based incremental learning algorithm for conformational searching of molecules is presented. This algorithm is particularly effective at determining, by relatively small number of energy minimizations, global energy minima of large flexible molecules. The algorithm is also able to f

Voronoi Projection-Based Fast Nearest-Ne
✍ V. Ramasubramanian; K.K. Paliwal πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 334 KB

In this paper we consider fast nearest-neighbor search techniques based on the projections of Voronoi regions. The Voronoi diagram of a given set of points provides an implicit geometric interpretation of nearest-neighbor search and serves as an important basis for several proximity search algorithm