Related papers: A New Monte Carlo Algorithm for Protein Folding
We demonstrate that the recently proposed pruned-enriched Rosenbluth method PERM (P. Grassberger, Phys. Rev. E, in press (1997)) leads to extremely efficient algorithms for the folding of simple model proteins. We test it on several models…
We demonstrate that the recently proposed pruned-enriched Rosenbluth method PERM (P.~Grassberger, Phys.~Rev.~{\bf E 56} (1997) 3682) leads to very efficient algorithms for the folding of simple model proteins. We test it on several models…
In this review, we describe applications of the pruned-enriched Rosenbluth method (PERM), a sequential Monte Carlo algorithm with resampling, to various problems in polymer physics. PERM produces samples according to any given prescribed…
We describe a class of growth algorithms for finding low energy states of heteropolymers. These polymers form toy models for proteins, and the hope is that similar methods will ultimately be useful for finding native states of real proteins…
We present Monte Carlo simulations of lattice models of polymers. These simulations are intended to demonstrate the strengths of a powerful new flat histogram algorithm which is obtained by adding microcanonical reweighting techniques to…
Coarse-grained (lattice-) models have a long tradition in aiding efforts to decipher the physical or biological complexity of proteins. Despite the simplicity of these models, however, numerical simulations are often computationally very…
A rigourous Monte Carlo method for protein folding simulation on lattice model is introduced. We show that a parameter which can be seen as the rigidity of the conformations has to be introduced in order to satisfy the detailed balance…
Metadynamics is a powerful computational tool to obtain the free energy landscape of complex systems. The Monte Carlo algorithm has proven useful to calculate thermodynamic quantities associated with simplified models of proteins, and thus…
We discuss uniform sampling algorithms that are based on stochastic growth methods, using sampling of extreme configurations of polymers in simple lattice models as a motivation. We shall show how a series of clever enhancements to a…
We describe an algorithm for the Rosenbluth Monte Carlo enumeration of clusters and lattice animals. The method may also be used to calculate associated properties such as moments or perimeter multiplicities of the clusters. The new scheme…
We discuss uniform sampling algorithms that are based on stochastic growth methods, using sampling of extreme configurations of polymers in simple lattice models as a motivation. We shall show how a series of clever enhancements to a…
Due to the complex characteristics of bottle-brush polymers, it became a challenge to develop an efficient algorithm for studying such macromolecules under various solvent conditions or some constraints in the space by using computer…
An improved version of the pruned-enriched-Rosenbluth method (PERM) is proposed and tested on finding lowest energy states in simple models of lattice heteropolymers. It is found to outperform not only the previous version of PERM, but also…
We propose a new way of looking at global optimization of off-lattice protein models. We present a dual optimization concept of predicting optimal sequences as well as optimal folds. We validate the utility of the recently introduced…
In this paper we present a new Monte Carlo Search (MCS) algorithm for finding the ground state energy of proteins in the HP-model. We also compare it briefly to other MCS algorithms not usually used on the HP-model and provide an overview…
We propose an algorithmic strategy for improving the efficiency of Monte Carlo searches for the low-energy states of proteins. Our strategy is motivated by a model of how proteins alter their shapes. In our model when proteins fold under…
A new general algorithm for optimization of potential functions for protein folding is introduced. It is based upon gradient optimization of the thermodynamic stability of native folds of a training set of proteins with known structure. The…
A new method for sequence optimization in protein models is presented. The approach, which has inherited its basic philosophy from recent work by Deutsch and Kurosky [Phys. Rev. Lett. 76, 323 (1996)] by maximizing conditional probabilities…
Two improved versions of the pruned-enriched-Rosenbluth method (PERM) are proposed and tested on simple models of lattice heteropolymers. Both are found to outperform not only the previous version of PERM, but also all other stochastic…
A local equilibrium approach for the kinetics of a simplified protein folding model, whose equilibrium thermodynamics is exactly solvable, was developed in [M. Zamparo and A. Pelizzola, Phys. Rev. Lett. 97, 068106 (2006)]. Important…