Simulated annealing using the classical density distribution

Tinker 8: Software Tools for Molecular Design

The Tinker software, currently released as version 8, is a modular molecular mechanics and dynamics package written primarily in a standard, easily portable dialect of Fortran 95 with OpenMP extensions. It supports a wide variety of force fields, including polarizable models such as the Atomic Multipole Optimized Energetics for Biomolecular Applications (AMOEBA) force field. The package runs on Linux, macOS, and Windows systems. In addition to canonical Tinker, there are branches, Tinker-HP and Tinker-OpenMM, designed for use on message passing interface (MPI) parallel distributed memory supercomputers and state-of-the-art graphical processing units (GPUs), respectively. The Tinker suite also includes a tightly integrated Java-based graphical user interface called Force Field Explorer (FFE), which provides molecular visualization capabilities as well as the ability to launch and control Tinker calculations.

Steered quantum dynamics for energy minimization

We introduce a quantum optimal control algorithm for energy minimization that combines the diffeomorphic modulation under observable response preserving homotopy (D-MORPH) gradient and the Broyden Fletcher Goldfarb Shanno (BFGS) iterative scheme for nonlinear optimization. An extended set of controls defining the time-dependent mass, dipole moment, and external perturbational field are optimized to find an effective Hamiltonian that steers the dynamics of the system into the global minimum without getting trapped into local minima. The algorithm is illustrated as applied to energy minimization on rugged surfaces and golf potentials comparable to those previously explored for testing quantum annealing methodologies.

Simulation via direct computation of partition functions

In this paper, we demonstrate the efficiency of simulations via direct computation of the partition function under various macroscopic conditions, such as different temperatures or volumes. The method can compute partition functions by flattening histograms, through, for example, the Wang-Landau recursive scheme, outside the energy space. This method offers a more general and flexible framework for handling various types of ensembles, especially ones in which computation of the density of states is not convenient. It can be easily scaled to large systems, and it is flexible in incorporating Monte Carlo cluster algorithms or molecular dynamics. High efficiency is shown in simulating large Ising models, in finding ground states of simple protein models, and in studying the liquid-vapor phase transition of a simple fluid. The method is very simple to implement and we expect it to be efficient in studying complex systems with rugged energy landscapes, e.g., biological macromolecules.

Global minimum structure searches via particle swarm optimization

Novel implementation of the evolutionary approach known as particle swarm optimization (PSO) capable of finding the global minimum of the potential energy surface of atomic assemblies is reported. This is the first time the PSO technique has been used to perform global optimization of minimum structure search for chemical systems. Significant improvements have been introduced to the original PSO algorithm to increase its efficiency and reliability and adapt it to chemical systems. The developed software has successfully found the lowest-energy structures of the LJ(26) Lennard-Jones cluster, anionic silicon hydride Si(2)H(5) (-), and triply hydrated hydroxide ion OH(-) (H(2)O)(3). It requires relatively small population sizes and demonstrates fast convergence. Efficiency of PSO has been compared with simulated annealing, and the gradient embedded genetic algorithm.

Performances of Wang-Landau algorithms for continuous systems

The relative performances of different implementations of the Wang-Landau method are assessed on two classes of systems with continuous degrees of freedom, namely, two polypeptides and two atomic Lennard-Jones clusters. Parallel tempering Monte Carlo simulations serve as a reference, and we pay particular attention to the variations of the multiplicative factor f during the course of the simulation. For the systems studied, the Wang-Landau method is found to be of comparable accuracy as parallel tempering, but has significant difficulties in reproducing low-temperature transitions exhibited by the Lennard-Jones clusters at low temperature. Using a complementary order parameter and calculating a two-dimensional joint density of states significantly improves the situation, especially for the notoriously difficult LJ(38) system. However, while parallel tempering easily converges for LJ(31), we have not been able to get data of comparable accuracy with Wang-Landau multicanonical sampling.

All-exchanges parallel tempering

An alternative exchange strategy for parallel tempering simulations is introduced. Instead of attempting to swap configurations between two randomly chosen but adjacent replicas, the acceptance probabilities of all possible swap moves are calculated a priori. One specific swap move is then selected according to its probability and enforced. The efficiency of the method is illustrated first on the case of two Lennard-Jones (LJ) clusters containing 13 and 31 atoms, respectively. The convergence of the caloric curve is seen to be at least twice as fast as in conventional parallel tempering simulations, especially for the difficult case of LJ31. Further evidence for an improved efficiency is reported on the ergodic measure introduced by Mountain and Thirumalai [J. Phys. Chem. 93, 6975 (1989)], calculated here for LJ13 close to the melting point. Finally, tests on two simple spin systems indicate that the method should be particularly useful when a limited number of replicas are available.

A dynamic lattice searching method for fast optimization of Lennard-Jones clusters

A highly efficient unbiased global optimization method called dynamic lattice searching (DLS) was proposed. The method starts with a randomly generated local minimum, and finds better solution by a circulation of construction and searching of the dynamic lattice (DL) until the better solution approaches the best solution. The DL is constructed adaptively based on the starting local minimum by searching the possible location sites for an added atom, and the DL searching is implemented by iteratively moving the atom located at the occupied lattice site with the highest energy to the vacant lattice site with the lowest energy. Because the DL can greatly reduce the searching space and the number of the time-consuming local minimization procedures, the proposed DLS method runs at a very high efficiency, especially for the clusters of larger size. The performance of the DLS is investigated in the optimization of Lennard-Jones (LJ) clusters up to 309 atoms, and the structure of the LJ(500) is also predicted. Furthermore, the idea of dynamic lattice can be easily adopted in the optimization of other molecular or atomic clusters. It may be a promising approach to be universally used for structural optimizations in the chemistry field.

The elastic net algorithm and protein structure prediction

Predicting protein structures from their amino acid sequences is a problem of global optimization. Global optima (native structures) are often sought using stochastic sampling methods such as Monte Carlo or molecular dynamics, but these methods are slow. In contrast, there are fast deterministic methods that find near-optimal solutions of well-known global optimization problems such as the traveling salesman problem (TSP). But fast TSP strategies have yet to be applied to protein folding, because of fundamental differences in the two types of problems. Here, we show how protein folding can be framed in terms of the TSP, to which we apply a variation of the Durbin-Willshaw elastic net optimization strategy. We illustrate using a simple model of proteins with database-derived statistical potentials and predicted secondary structure restraints. This optimization strategy can be applied to many different models and potential functions, and can readily incorporate experimental restraint information. It is also fast; with the simple model used here, the method finds structures that are within 5-6 A all-Calpha-atom RMSD of the known native structures for 40-mers in about 8 s on a PC; 100-mers take about 20 s. The computer time tau scales as tau approximately n, where n is the number of amino acids. This method may prove to be useful for structure refinement and prediction.

Folding of oligoglutamines: a theoretical approach based upon thermodynamics and molecular mechanics

Folding of oligoglutamine chains of different lengths is of crucial interest for exploring the molecular mechanisms of Huntington's disease. A simple oligoglutamine model based upon the Flory-Huggins theory of polymer solutions demonstrates a random coil instability in chains containing more than 40 glutamine residues with respect to beta-sheet formation. This is in striking quantitative agreement with biochemical results on the chain length dependence of polyglutamine aggregation in vivo and in vitro, as well as with clinical data on the polyglutamine chain length dependence of the onset of Huntington's disease. Furthermore, a detailed molecular-mechanical investigation of a polypeptide chain carrying 40 glutamine residues was performed. Two possible folding modes of such an oligoglutamine chain were revealed: a) a beta-hairpin and b) a highly compact random coil entity stabilized by a wealth of H-bonds among the glutamine side chains. A possible role of these folding modes in polyglutamine aggregation, as well as in the onset of Huntington's disease, is discussed.

Global optimization of clusters, crystals, and biomolecules

Finding the optimal solution to a complex optimization problem is of great importance in many fields, ranging from protein structure prediction to the design of microprocessor circuitry. Some recent progress in finding the global minima of potential energy functions is described, focusing on applications of the simple "basin-hopping" approach to atomic and molecular clusters and more complicated hypersurface deformation techniques for crystals and biomolecules. These methods have produced promising results and should enable larger and more complex systems to be treated in the future.