DMC: A multifunctional hybrid dynamics/Monte Carlo simulation algorithm for the evaluation of conformational space

A hybrid conformational search algorithm (DMC) is described that combines a modified form of molecular dynamics with Metropolis Monte Carlo sampling, using the COSMIC(90) force field. Trial configurations are generated by short bursts of high-temperature dynamics in which the initial kinetic energy is focused into single bond rotations or alternatively into “corner-flapping” motions in ring systems. Constant temperature and simulated annealing search protocols have been applied to the conformational analysis of several model hydrocarbons (cyclopentane, cyclohexane, cycloheptane, cyclooctane, cycloheptadecane, decane, and tetradecane), and the performance compared with conventional molecular dynamics and Monte Carlo sampling methods. Optimum Metropolis sampling temperatures have been determined and range from 1000–2000 K for acyclic molecules to 3000 K for cyclic systems. Simulated annealing runs are most successful at locating the global minimum when cooling slowing from these optimum temperatures.     

Molecular properties from conformational ensembles. 1. Dipole moments of molecules with multiple internal rotations

We present a novel method for constructing the stable conformational space of small molecules with many rotatable bonds that uses our iterative stochastic elimination (ISE) algorithm, a robust stochastic search method capable of finding ensembles of best solutions for large combinatorial problems. To validate the method, we show that ISE reproduces the best conformers found in a fully exhaustive search, as well as compare computed dipole moments to experimental values, based on molecular ensembles and their Boltzmann distributions. Results were also compared to the alternative molecular dynamics and simulated annealing methods. Our results clarify that many low energy conformations may be required to reproduce molecular properties, while single low energy conformers or ensembles of low energy conformers cannot account for the experimental properties of flexible molecules. Whereas ISE well reproduces conformations that are not separated by very large energy barriers, it has not been successful in reproducing conformations of strained molecules.     

Enhanced sampling method in molecular simulations using genetic algorithm for biomolecular systems

We propose a molecular simulation method using genetic algorithm (GA) for biomolecular systems to obtain ensemble averages efficiently. In this method, we incorporate the genetic crossover, which is one of the operations of GA, to any simulation method such as conventional molecular dynamics (MD), Monte Carlo, and other simulation methods. The genetic crossover proposes candidate conformations by exchanging parts of conformations of a target molecule between a pair of conformations during the simulation. If the candidate conformations are accepted, the simulation resumes from the accepted ones. While conventional simulations are based on local update of conformations, the genetic crossover introduces global update of conformations. As an example of the present approach, we incorporated genetic crossover to MD simulations. We tested the validity of the method by calculating ensemble averages and the sampling efficiency by using two kinds of peptides, ALA3 and (AAQAA)₃. The results show that for ALA3 system, the distribution probabilities of backbone dihedral angles are in good agreement with those of the conventional MD and replica-exchange MD simulations. In the case of (AAQAA)₃ system, our method showed lower structural correlation of α-helix structures than the other two methods and more flexibility in the backbone ψ angles than the conventional MD simulation. These results suggest that our method gives more efficient conformational sampling than conventional simulation methods based on local update of conformations. © 2018 Wiley Periodicals, Inc.     

Prediction of peptide conformation: The adaptive simulated annealing approach

We report the application of the adaptive simulated annealing (ASA) method as a global optimization approach to biomolecular structure determination, using the ECEPP/2 (empirical conformation energy program for peptides) potential energy form. As applied to Met-enkephalin, our optimization results in a conformation that is in agreement with other studies. In addition, a dominant right-handed α-helical conformation is predicted for a 14-residue poly (L-alanine) model peptide in a limited search range. These results show that ASA is an efficient and robust algorithm for conformational analysis. © 1997 by John Wiley & Sons, Inc.     

Structural,spectroscopic aspects,and electronic properties of (TiO2)n clusters: A study based on the use of natural algorithms in association with quantum chemical methods

In this article, we propose a stochastic search‐based method, namely genetic algorithm (GA) and simulated annealing (SA) in conjunction with density functional theory (DFT) to evaluate global and local minimum structures of (TiO₂)_n clusters with n = 1–12. Once the structures are established, we evaluate the infrared spectroscopic modes, cluster formation energy, vertical excitation energy, vertical ionization potential, vertical electron affinity, highest occupied molecular orbital (HOMO)‐lowest unoccupied molecular orbital (LUMO) gaps, and so forth. We show that an initial determination of structure using stochastic techniques (GA/SA), also popularly known as natural algorithms as their working principle mimics certain natural processes, and following it up with density functional calculations lead to high‐quality structures for these systems. We have shown that the clusters tend to form three‐dimensional networks. We compare our results with the available experimental and theoretical results. The results obtained from SA/GA‐DFT technique agree well with available theoretical and experimental data of literature. © 2013 Wiley Periodicals, Inc.     

Applications of simulated annealing to the conformational analysis of flexible molecules

We describe in this article our solution to the global minimum problem which uses the simulated annealing algorithm of Kirkpatrick. This method is a Metropolis (e-ΔE/kT) Monte Carlo sampling of conformation space with simultaneous constraint of the search by lowering the temperature T so that the search converges on the global minimum. The Anneal-Conformer program has been extensively tested with peptides and organic molecules using either the Amber or MM2 force fields. A history file of the simulated annealing process allows reconstruction of the random walk in conformation space for subsequent examination. Thus plots of distance and dihedral angle changes during the search for the global minimum can be examined to deduce molecular shape and flexibility. A separate program Conf-Gen reads the history file and extracts all low energy conformations visited during the run.     

Combining genetic algorithm and simulated annealing: a molecular geometry optimization study

We introduce a new hybrid approach to determine the ground state geometry of molecular systems. Firstly, we compared the ability of genetic algorithm (GA) and simulated annealing (SA) to find the lowest energy geometry of silicon clusters with six and 10 atoms. This comparison showed that GA exhibits fast initial convergence, but its performance deteriorates as it approaches the desired global extreme. Interestingly, SA showed a complementary convergence pattern, in addition to high accuracy. Our new procedure combines selected features from GA and SA to achieve weak dependence on initial parameters, parallel search strategy, fast convergence and high accuracy. This hybrid algorithm outperforms GA and SA by one order of magnitude for small silicon clusters (Si₆ and Si₁₀). Next, we applied the hybrid method to study the geometry of a 20-atom silicon cluster. It was able to find an original geometry, apparently lower in energy than those previously described in literature. In principle, our procedure can be applied successfully to any molecular system.     

A machine learning technique toward generating minimum energy structures of small boron clusters

The search for a global minimum related to molecular electronic structure and chemical bonding has received wide attention based on some theoretical calculations at various levels of theory. Particle swarm optimization (PSO) algorithm and modified PSO have been used to predict the energetically stable/metastable states associated with a given chemical composition. Out of a variety of techniques such as genetic algorithm, basin hopping, simulated annealing, PSO, and so on, PSO is considered to be one of the most suitable methods due to its various advantages over others. We use a swarm‐intelligence based parallel code to improve a PSO algorithm in a multidimensional search space augmented by quantum chemical calculations on gas phase structures at 0 K without any symmetry constraint to obtain an optimal solution. Our currently employed code is interfaced with Gaussian software for single point energy calculations. The code developed here is shown to be efficient. Small population size (small cluster) in the multidimensional space is actually good enough to get better results with low computational cost than the typical larger population. But for larger systems also the analysis is possible. One can try with a large number of particles as well. We have also analyzed how arbitrary and random structures and the local minimum energy structures gravitate toward the target global minimum structure. At the same time, we compare our results with that obtained from other evolutionary techniques.     

Lattice models of peptide aggregation: evaluation of conformational search algorithms

We present a series of conformational search calculations on the aggregation of short peptide fragments that form fibrils similar to those seen in many protein mis-folding diseases. The proteins were represented by a face-centered cubic lattice model with the conformational energies calculated using the Miyazawa-Jernigan potential. The searches were performed using algorithms based on the Metropolis Monte Carlo method, including simulated annealing and replica exchange. We also present the results of searches using the tabu search method, an algorithm that has been used for many optimization problems, but has rarely been used in protein conformational searches. The replica exchange algorithm consistently found more stable structures then the other algorithms, and was particularly effective for the octamers and larger systems.     

A comparison of heuristic search algorithms for molecular docking

This paper describes the implementation and comparison of four heuristic search algorithms (genetic algorithm, evolutionary programming, simulated annealing and tabu search) and a random search procedure for flexible molecular docking. To our knowledge, this is the first application of the tabu search algorithm in this area. The algorithms are compared using a recently described fast molecular recognition potential function and a diverse set of five protein–ligand systems. Statistical analysis of the results indicates that overall the genetic algorithm performs best in terms of the median energy of the solutions located. However, tabu search shows a better performance in terms of locating solutions close to the crystallographic ligand conformation. These results suggest that a hybrid search algorithm may give superior results to any of the algorithms alone.     

An improved optimization strategy and its application to clustering analysis.

In this paper, a new optimization strategy is put forward which locates as many potential unimodal regions as possible in the search space. The potential optima can be further explored by a global optimization method for searching in the identified unimodal regions. The proposed strategy was evaluated by the optimization of test functions. The results obtained by this approach are comparable with those achieved by variable step size generalized simulated annealing (VSGSA) and a genetic algorithm (GA). Finally, we used this strategy in a clustering analysis of a tobacco data set.     

An exploration of a novel strategy for superposing several flexible molecules

Summary This paper describes a computational strategy for the superposition of a set of flexible molecules. The combinatorial problems of searching conformational space and molecular matching are reduced drastically by the combined use of simulated annealing methods and cluster analysis. For each molecule, the global minimum of the conformational energy is determined by annealing and the search trajectory is retained in a history file. All the significantly different low-energy conformations are extracted by cluster analysis of data in the history file. Each pair of molecules, in each of their significantly different conformations, is then matched by simulated annealing, using the difference-distance matrix as the objective function. A set of match statistics is then obtained, from which the best match taken from all different conformations can be found. The molecules are then superposed either by reference to a base molecule or by a consensus method. This strategy ensures that as wide a range of conformations as possible is considered, but at the same time that the smallest number of significantly different conformations is used. The method has been tested on a set of six angiotensin II antagonists with between 7–11 rotatable bonds.     

De novo structural prediction of transition metal complexes: application to technetium

De novo structural prediction of transition metal complexes is investigated. Technetium complexes are chosen given their importance in medical imaging and nuclear waste remediation and for the chemical diversity they display. A new conformational searching algorithm (LIGB) for transition metals is described that allows one to search for different conformational and geometric isomers within a single simulation. In the preponderance of cases, both conformational searching techniques (LIGB and high-temperature molecular dynamics/simulated annealing) provide comparable results, while LIGB is superior for macrocyclic complexes. A genetic algorithm-optimized PM3(tm) parametrization for Tc is compared with the standard implementation and found to yield a significant improvement in predictive ability for the most prevalent Tc structural motifs. The utility of a coupled molecular mechanics-semiempirical quantum mechanics protocol is demonstrated for very rapid, efficient, and effective de novo prediction of transition metal complex geometries.     

A reliable prediction of the global phase stability for liquid–liquid equilibrium through the simulated annealing algorithm: Application to NRTL and UNIQUAC equations

The simulated annealing algorithm is introduced to search the global optimal solutions for the multipeak phenomena which generally exist in the phase stability problems with continuous variables. The Gibbs free energy criterion was modeled by the NRTL and UNIQUAC activity coefficient equations. When previous approaches fail, it is usually because they locate local minima due to the nonconvex and nonlinear natures of the models used to predict phase equilibrium. In this paper, the preliminary results show that the global minimum of the tangent plane distance function (TPDF) can be obtained by using the simulated annealing algorithm. The effects of the initial and the final values of the control parameter, the decrement of the control parameter and the length of the Markov chains are analyzed. The optimal `cooling schedule' was obtained according to the calculation results of the phase stability problems for one ternary mixture. The liquid–liquid equilibrium compositions were calculated by the Newton–Raphson method on the basis of the global minimum of TPDF. The results of four examples show that the simulated annealing algorithm can effectively solve the global phase stability problem.     

Local elevation: A method for improving the searching properties of molecular dynamics simulation

Summary The concept of memory has been introduced into a molecular dynamics algorithm. This was done so as to persuade a molecular system to visit new areas of conformational space rather than be confined to a small number of low-energy regions. The method is demonstrated on a simple model system and the 11-residue cyclic peptide cyclosporin A. For comparison, calculations were also performed using simulated temperature annealing and a potential energy annealing scheme. Although the method can only be applied to systems with a small number of degrees of freedom, it offers the chance to generate a multitude of different low-energy structures, where other methods only give a single one or few. This is clearly important in problems such as drug design, where one is interested in the conformational spread of a system.     

Protein structure prediction using basin-hopping

Associative memory Hamiltonian structure prediction potentials are not overly rugged, thereby suggesting their landscapes are like those of actual proteins. In the present contribution we show how basin-hopping global optimization can identify low-lying minima for the corresponding mildly frustrated energy landscapes. For small systems the basin-hopping algorithm succeeds in locating both lower minima and conformations closer to the experimental structure than does molecular dynamics with simulated annealing. For large systems the efficiency of basin-hopping decreases for our initial implementation, where the steps consist of random perturbations to the Cartesian coordinates. We implemented umbrella sampling using basin-hopping to further confirm when the global minima are reached. We have also improved the energy surface by employing bioinformatic techniques for reducing the roughness or variance of the energy surface. Finally, the basin-hopping calculations have guided improvements in the excluded volume of the Hamiltonian, producing better structures. These results suggest a novel and transferable optimization scheme for future energy function development.     

Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function

A novel and robust automated docking method that predicts the bound conformations of flexible ligands to macromolecular targets has been developed and tested, in combination with a new scoring function that estimates the free energy change upon binding. Interestingly, this method applies a Lamarckian model of genetics, in which environmental adaptations of an individual's phenotype are reverse transcribed into its genotype and become heritable traits (sic). We consider three search methods, Monte Carlo simulated annealing, a traditional genetic algorithm, and the Lamarckian genetic algorithm, and compare their performance in dockings of seven protein–ligand test systems having known three-dimensional structure. We show that both the traditional and Lamarckian genetic algorithms can handle ligands with more degrees of freedom than the simulated annealing method used in earlier versions of AUTO DOCK , and that the Lamarckian genetic algorithm is the most efficient, reliable, and successful of the three. The empirical free energy function was calibrated using a set of 30 structurally known protein–ligand complexes with experimentally determined binding constants. Linear regression analysis of the observed binding constants in terms of a wide variety of structure-derived molecular properties was performed. The final model had a residual standard error of 9.11 kJ mol⁻¹ (2.177 kcal mol⁻¹) and was chosen as the new energy function. The new search methods and empirical free energy function are available in AUTO DOCK , version 3.0. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 1639–1662, 1998     

Reference energy extremal optimization: a stochastic search algorithm applied to computational protein design

We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowledge of local energy information and systematically improves on the residues that have high local energies. Power-law probability distributions are used to select the backbone sites to be improved on and the rotamer choices to be changed to. We compare this method with simulated annealing (SA) and motivate and present an improved method, which we call reference energy extremal optimization (REEO). REEO uses reference energies to convert a problem with a structured local-energy profile to one with more random profile, and extremal optimization proves to be extremely efficient for the latter problem. We show in detail the large improvement we have achieved using REEO as compared to simulated annealing and discuss a number of other heuristics we have attempted to date.     

Stochastic molecular optimization using generalized simulated annealing

We propose a stochastic optimization technique based on a generalized simulated annealing (GSA) method for mapping minima points of molecular conformational energy surfaces. The energy maps are obtained by coupling a classical molecular force field (THOR package) with a GSA procedure. Unlike the usual molecular dynamics (MD) method, the method proposed in this study is force independent; that is, we obtain the optimized conformation without calculating the force, and only potential energy is involved. Therefore, we do not need to know the conformational energy gradient to arrive at equilibrium conformations. Its utility in molecular mechanics is illustrated by applying it to examples of simple molecules (H₂O and H₂O₃) and to polypeptides. The results obtained for H₂O and H₂O₃ using Tsallis thermostatistics suggest that the GSA approach is faster than the other two conventional methods (Boltzmann and Cauchy machines). The results for polypeptides show that pentalanine does not form a stable α-helix structure, probably because the number of hydrogen bonds is insufficient to maintain the helical array. On the contrary, the icoalanine molecule forms an α-helix structure. We obtain this structure simulating all Φ, Ψ pairs using only a few steps, as compared with conventional methods. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 647–657, 1998     

Efficiency of tabu‐search‐based conformational search algorithms

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