Biopolymer structure simulation and optimization via fragment regrowth Monte Carlo

An efficient exploration of the configuration space of a biopolymer is essential for its structure modeling and prediction. In this study, the authors propose a new Monte Carlo method, fragment regrowth via energy-guided sequential sampling (FRESS), which incorporates the idea of multigrid Monte Carlo into the framework of configurational-bias Monte Carlo and is suitable for chain polymer simulations. As a by-product, the authors also found a novel extension of the Metropolis Monte Carlo framework applicable to all Monte Carlo computations. They tested FRESS on hydrophobic-hydrophilic (HP) protein folding models in both two and three dimensions. For the benchmark sequences, FRESS not only found all the minimum energies obtained by previous studies with substantially less computation time but also found new lower energies for all the three-dimensional HP models with sequence length longer than 80 residues.     

A study of density of states and ground states in hydrophobic-hydrophilic protein folding models by equi-energy sampling

We propose an equi-energy (EE) sampling approach to study protein folding in the two-dimensional hydrophobic-hydrophilic (HP) lattice model. This approach enables efficient exploration of the global energy landscape and provides accurate estimates of the density of states, which then allows us to conduct a detailed study of the thermodynamics of HP protein folding, in particular, on the temperature dependence of the transition from folding to unfolding and on how sequence composition affects this phenomenon. With no extra cost, this approach also provides estimates on global energy minima and ground states. Without using any prior structural information of the protein the EE sampler is able to find the ground states that match the best known results in most benchmark cases. The numerical results demonstrate it as a powerful method to study lattice protein folding models.     

Protein folding simulations of 2D HP model by the genetic algorithm based on optimal secondary structures

In this paper, based on the evolutionary Monte Carlo (EMC) algorithm, we have made four points of ameliorations and propose a so-called genetic algorithm based on optimal secondary structure (GAOSS) method to predict efficiently the protein folding conformations in the two-dimensional hydrophobic–hydrophilic (2D HP) model. Nine benchmarks are tested to verify the effectiveness of the proposed approach and the results show that for the listed benchmarks GAOSS can find the best solutions so far. It means that reasonable, effective and compact secondary structures (SSs) can avoid blind searches and can reduce time consuming significantly. On the other hand, as examples, we discuss the diversity of protein GSC for the 24-mer and 85-mer sequences. Several GSCs have been found by GAOSS and some of the conformations are quite different from each other. It would be useful for the designing of protein molecules. GAOSS would be an efficient tool for the protein structure predictions (PSP).     

二维HP格点模型中的紧密高分子链构象及其热力学性质的研究

采用二维HP模型用精确计数法和MonteCarlo方法研究了链长为N(≤ 2 2 )的紧密高分子链的构象和热力学性质 .发现不同HP序列的紧密高分子链的平均自由能和平均配分函数与链长N存在关系 :〈F〉=aN+b ,　ln〈Z〉=a′N +b′ .同时发现对于可折叠成基态且简并度为 1的紧密高分子链 ,其平均自由能和平均配分函数与链长N也存在相似的关系 .在HP模型中对于链长为N的紧密高分子链 ,存在着 2 N + 1 个不同的HP序列 .我们发现可以折叠成基态且简并度为 1的蛋白质分子的HP序列数目NS 为NS =a× 2 N+ 1 　 (a =0 0 2 5 ) ,对应的HP序列中 ,疏水基团 (H)数目的含量为 4 0 %～ 6 0 %的序列出现的几率最大 .同时在这些紧密高分子链中有些具有相同的结构 ,发现结构的‘简并度’为 3 3～ 4 0 (10≤N≤ 16 ) .在紧密高分子链折叠过程中 ,折叠的初期能量下降比较快 ,折叠的中期能量下降比较缓慢 ,折叠的后期能量下降也是比较快     

Constrained proper sampling of conformations of transition state ensemble of protein folding

Characterizing the conformations of protein in the transition state ensemble (TSE) is important for studying protein folding. A promising approach pioneered by Vendruscolo et al. [Nature (London) 409, 641 (2001)] to study TSE is to generate conformations that satisfy all constraints imposed by the experimentally measured φ values that provide information about the native likeness of the transition states. Fai?sca et al. [J. Chem. Phys. 129, 095108 (2008)] generated conformations of TSE based on the criterion that, starting from a TS conformation, the probabilities of folding and unfolding are about equal through Markov Chain Monte Carlo (MCMC) simulations. In this study, we use the technique of constrained sequential Monte Carlo method [Lin et al., J. Chem. Phys. 129, 094101 (2008); Zhang et al. Proteins 66, 61 (2007)] to generate TSE conformations of acylphosphatase of 98 residues that satisfy the φ-value constraints, as well as the criterion that each conformation has a folding probability of 0.5 by Monte Carlo simulations. We adopt a two stage process and first generate 5000 contact maps satisfying the φ-value constraints. Each contact map is then used to generate 1000 properly weighted conformations. After clustering similar conformations, we obtain a set of properly weighted samples of 4185 candidate clusters. Representative conformation of each of these cluster is then selected and 50 runs of Markov chain Monte Carlo (MCMC) simulation are carried using a regrowth move set. We then select a subset of 1501 conformations that have equal probabilities to fold and to unfold as the set of TSE. These 1501 samples characterize well the distribution of transition state ensemble conformations of acylphosphatase. Compared with previous studies, our approach can access much wider conformational space and can objectively generate conformations that satisfy the φ-value constraints and the criterion of 0.5 folding probability without bias. In contrast to previous studies, our results show that transition state conformations are very diverse and are far from nativelike when measured in cartesian root-mean-square deviation (cRMSD): the average cRMSD between TSE conformations and the native structure is 9.4 A? for this short protein, instead of 6 A? reported in previous studies. In addition, we found that the average fraction of native contacts in the TSE is 0.37, with enrichment in native-like β-sheets and a shortage of long range contacts, suggesting such contacts form at a later stage of folding. We further calculate the first passage time of folding of TSE conformations through calculation of physical time associated with the regrowth moves in MCMC simulation through mapping such moves to a Markovian state model, whose transition time was obtained by Langevin dynamics simulations. Our results indicate that despite the large structural diversity of the TSE, they are characterized by similar folding time. Our approach is general and can be used to study TSE in other macromolecules.     

Novel Monte Carlo scheme for systems with short-ranged interactions

We propose a Monte Carlo (MC) sampling algorithm to simulate systems of particles interacting via very short-ranged discontinuous potentials. Such models are often used to describe protein solutions or colloidal suspensions. Most normal MC algorithms fail for such systems because, at low temperatures, they tend to get trapped in local potential-energy local minima due to the short range of the pair potential. To circumvent this problem, we have devised a scheme that changes the construction of trial moves in such a way that the potential-energy difference between initial and final states drops out of the acceptance rule for the Monte Carlo trial moves. This approach allows us to simulate systems with short-ranged attraction under conditions that were unreachable up to now.     

Estimation of protein folding rate from Monte Carlo simulations and entropy capacity

The problem of protein self-organization is one of the most important problems of molecular biology nowadays. Despite the recent success in the understanding of general principles of protein folding, details of this process are yet to be elucidated. Moreover, the prediction of protein folding rates has its own practical value due to the fact that aggregation directly depends on the rate of protein folding. The time of folding has been calculated for 67 proteins with known experimental data at the point of thermodynamic equilibrium between unfolded and native states using a Monte Carlo model where each residue is considered to be either folded as in the native state or completely disordered. The times of folding for 67 proteins which reach the native state within the limit of 10(8) Monte Carlo steps are in a good correlation with the experimentally measured folding rate at the mid-transition point (the correlation coefficient is -0.82). Theoretical consideration of a capillarity model for the process of protein folding demonstrates that the difference in the folding rate for proteins sharing more spherical and less spherical folds is the result of differences in the conformational entropy due to a larger surface of the boundary between folded and unfolded phases in the transition state for proteins with more spherical fold. The capillarity model allows us to predict the folding rate at the same level of correlation as by Monte Carlo simulations. The calculated model entropy capacity (conformational entropy per residue divided by the average contact energy per residue) for 67 proteins correlates by about 78% with the experimentally measured folding rate at the mid-transition point.     

Biased fragment distribution in MC simulation of protein folding

Monte Carlo (MC) methods play an important role in simulations of protein folding. These methods rely on a random sampling of moves on a potential energy surface. To improve the efficiency of the sampling, we propose a new selection of trial moves based on an empirical distribution of three-residue (triplet) conformations. This selection is compared to random combinations of the preferred conformations of the three amino acids, and it is shown that the new trial moves lead to finding structures closer to the native conformation.     

Mode excitation Monte Carlo simulations of mesoscopically large membranes

Solvent-free coarse grained models represent one of the most promising approaches for molecular simulations of mesoscopically large membranes. In these models, the size of the simulated membrane is limited by the slow relaxation time of the longest bending mode. Here, we present a Monte Carlo algorithm with update moves in which all the lipids are simultaneously displaced. These collective moves result in fast excitation and relaxation of the long wavelength thermal fluctuations. We apply the method to simulations of a bilayer membrane with linear size of approximately 50 nm and show reduction in the relaxation time by two orders of magnitudes when compared to conventional Monte Carlo.     

Annealing contour Monte Carlo algorithm for structure optimization in an off-lattice protein model

We present a space annealing version for a contour Monte Carlo algorithm and show that it can be applied successfully to finding the ground states for an off-lattice protein model. The comparison shows that the algorithm has made a significant improvement over the pruned-enriched-Rosenbluth method and the Metropolis Monte Carlo method in finding the ground states for AB models. For all sequences, the algorithm has renewed the putative ground energy values in the two-dimensional AB model and set the putative ground energy values in the three-dimensional AB model.     

Folding probabilities: a novel approach to folding transitions and the two-dimensional Ising-model

The theoretical concept of folding probability, p(fold), has proven to be a useful means to characterize the kinetics of protein folding. Here, we illustrate the practical importance of p(fold) and demonstrate how it can be determined theoretically. We derive a general analytical expression for p(fold) and show how it can be estimated from simulations for systems where the transition rates between the relevant microstates are not known. By analyzing the Ising model we are able to determine the scaling behavior of the numerical error in the p(fold) estimate as function of the number of analyzed Monte Carlo runs. We apply our method to a simple, newly developed protein folding model for the formation of alpha helices. It is demonstrated that our technique highly parallelizes the calculation of p(fold) and that it is orders of magnitude more efficient than conventional approaches.     

Heuristic energy landscape paving for protein folding problem in the three-dimensional HP lattice model

The protein folding problem, i.e., the prediction of the tertiary structures of protein molecules from their amino acid sequences is one of the most important problems in computational biology and biochemistry. However, the extremely difficult optimization problem arising from energy function is a key challenge in protein folding simulation. The energy landscape paving (ELP) method has already been applied very successfully to off-lattice protein models and other optimization problems with complex energy landscape in continuous space. By improving the ELP method, and subsequently incorporating the neighborhood strategy with the pull-move set into the improved ELP method, a heuristic ELP algorithm is proposed to find low-energy conformations of 3D HP lattice model proteins in the discrete space. The algorithm is tested on three sets of 3D HP benchmark instances consisting 31 sequences. For eleven sequences with 27 monomers, the proposed method explores the conformation surfaces more efficiently than other methods, and finds new lower energies in several cases. For ten 48-monomer sequences, we find the lowest energies so far. With the achieved results, the algorithm converges rapidly and efficiently. For all ten 64-monomer sequences, the algorithm finds lower energies within comparable computation times than previous methods. Numeric results show that the heuristic ELP method is a competitive tool for protein folding simulation in 3D lattice model. To the best of our knowledge, this is the first application of ELP to the 3D discrete space.     

Hybrid Monte Carlo implementation of the Fourier path integral algorithm

This paper formulates a hybrid Monte Carlo implementation of the Fourier path integral (FPI-HMC) approach with partial averaging. Such a hybrid Monte Carlo approach allows one to generate collective moves through configuration space using molecular dynamics while retaining the computational advantages associated with the Fourier path integral Monte Carlo method. In comparison with the earlier Metropolis Monte Carlo implementations of the FPI algorithm, the present HMC method is shown to be significantly more efficient for quantum Lennard-Jones solids and suggests that such algorithms may prove useful for efficient simulations of a range of atomic and molecular systems.     

Peptide length dependence of a simplified model for the folding of regular two‐stranded coiled‐coils

In this work we study a simplified model for the folding of dimeric coiled‐coil proteins with regular sequences. The model keeps the individual peptides in rigid straight helical conformations. This situation makes the model bad suited for its application to long peptide chains. We have thus used Monte Carlo simulations to explore how the expected limitations of the model reflect in its thermodynamic and structural behavior. We find that, for long chains, the model shows a vague definition of the folded state which is only appreciated after a careful analysis, but can become otherwise unnoticed. The formal similarity of this situation to the possible presence of intermediate states and its meaning in the cooperativity character of the folding/unfolding transition is briefly discussed.     

Monte Carlo simulation of polarizable systems: Early rejection scheme for improving the performance of adiabatic nuclear and electronic sampling Monte Carlo simulations

An early rejection scheme for trial moves in adiabatic nuclear and electronic sampling Monte Carlo simulation (ANES-MC) of polarizable intermolecular potential models is presented. The proposed algorithm is based on Swendsen–Wang filter functions for prediction of success or failure of trial moves in Monte Carlo simulations. The goal was to reduce the amount of calculations involved in ANES-MC electronic moves, by foreseeing the success of an attempt before making those moves. The new method was employed in Gibbs ensemble Monte Carlo (GEMC) simulations of the polarizable simple point charge-fluctuating charge (SPC-FQ) model of water. The overall improvement in GEMC depends on the number of swap attempts (transfer molecules between phases) in one Monte Carlo cycle. The proposed method allows this number to increase, enhancing the chemical potential equalization. For a system with 300 SPC-FQ water molecules, for example, the fractions of early rejected transfers were about 0.9998 and 0.9994 at 373 and 423 K, respectively. This means that the transfer moves consume only a very small part of the overall computing effort, making GEMC almost equivalent to a simulation in the canonical ensemble.     

Optimization of Monte Carlo trial moves for protein simulations

Closed rigid-body rotations of residue segments under bond-angle restraints are simple and effective Monte Carlo moves for searching the conformational space of proteins. The efficiency of these moves is examined here as a function of the number of moving residues and the magnitude of their displacement. It is found that the efficiency of folding and equilibrium simulations can be significantly improved by tailoring the distribution of the number of moving residues to the simulation temperature. In general, simulations exploring compact conformations are more efficient when the average number of moving residues is smaller. It is also demonstrated that the moves do not require additional restrictions on the magnitude of the rotation displacements and perform much better than other rotation moves that do not restrict the bond angles a priori. As an example, these results are applied to the replica exchange method. By assigning distributions that generate a smaller number of moving residues to lower temperature replicas, the simulation times are decreased as long as the higher temperature replicas are effective.     

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.     

SARS病毒E蛋白的计算机模拟的初步研究

以粗粒化的多肽链模型进行了SARS病毒包膜中E蛋白的计算机模拟,描述了该蛋白质空间构象的概貌.首先扩展了多肽链的HP模型,使之能够用于研究在水或脂环境下蛋白质折叠的行为,并且考虑了全部氨基酸残基疏水相互作用能的差异.相关格子链的MonteCarlo模拟显示了很高的计算效率.模拟再现了蛋白质的coil-globule转变,验证了蛋白质序列分布的重要性.结果表明,在水环境中,E蛋白质空间结构由紧致的疏水内核和部分向外延伸的亲水片段组成;在脂环境中,中部疏水片段会成为向外延伸的环,而当两侧紧致的亲水片段分开时,则形成桥.     

Folding kinetics of a lattice protein via a forward flux sampling approach

We implement a forward flux sampling approach [R. J. Allen et al., J. Chem. Phys. 124, 194111 (2006)] for calculating transition rate constants and for sampling paths of protein folding events. The algorithm generates trajectories for the transition between the unfolded and folded states as chains of partially connected paths, which can be used to obtain the transition-state ensemble and the properties that characterize these intermediates. We apply this approach to Monte Carlo simulations of a model lattice protein in open space and in confined spaces of varying dimensions. We study the effect of confinement on both protein thermodynamic stability and folding kinetics; the former by mapping free-energy landscapes and the latter by the determination of rate constants and mechanistic details of the folding pathway. Our results show that, for the range of temperatures where the native state is stable, confinement of a protein destabilizes the unfolded state by reducing its entropy, resulting in increased thermodynamic stability of the folded state. Relative to the folding in open space, we find that the kinetics can be accelerated at temperatures above the temperature at which the unconfined protein folds fastest and that the rate constant increases with the number of constrained dimensions. By examining the statistical properties of the transition-state ensemble, we detect signs of a classical nucleation folding mechanism for a core of native contacts formed at an early stage of the process. This nucleus acts as folding foci and is composed of those residues that have higher probability to form native contacts in the transition-state intermediates, which can vary depending on the confinement conditions of the system.     

Comparing three stochastic search algorithms for computational protein design: Monte Carlo,replica exchange Monte Carlo,and a multistart,steepest‐descent heuristic

Computational protein design depends on an energy function and an algorithm to search the sequence/conformation space. We compare three stochastic search algorithms: a heuristic, Monte Carlo (MC), and a Replica Exchange Monte Carlo method (REMC). The heuristic performs a steepest‐descent minimization starting from thousands of random starting points. The methods are applied to nine test proteins from three structural families, with a fixed backbone structure, a molecular mechanics energy function, and with 1, 5, 10, 20, 30, or all amino acids allowed to mutate. Results are compared to an exact, “Cost Function Network” method that identifies the global minimum energy conformation (GMEC) in favorable cases. The designed sequences accurately reproduce experimental sequences in the hydrophobic core. The heuristic and REMC agree closely and reproduce the GMEC when it is known, with a few exceptions. Plain MC performs well for most cases, occasionally departing from the GMEC by 3–4 kcal/mol. With REMC, the diversity of the sequences sampled agrees with exact enumeration where the latter is possible: up to 2 kcal/mol above the GMEC. Beyond, room temperature replicas sample sequences up to 10 kcal/mol above the GMEC, providing thermal averages and a solution to the inverse protein folding problem. © 2016 Wiley Periodicals, Inc.