Multicanonical Chain Growth Algorithm
arXiv:cond-mat/0304613 · doi:10.1103/PhysRevLett.91.208105
Abstract
We present a temperature-independent Monte Carlo method for the determination of the density of states of lattice proteins that combines the fast ground-state search strategy of the nPERM chain growth and multicanonical reweighting for sampling the complete energy space. Since the density of states contains all energetic information of a statistical system, we can directly calculate the mean energy, specific heat, Gibbs free energy, and entropy for all temperatures. We apply this method to HP lattice proteins and for the examples of sequences considered, we identify the transitions between native, globule, and random coil states. Since no special properties of heteropolymers are involved in this algorithm, the method applies to polymer models as well.
4 pages, RevTeX, 5 Postscript figures, Author Information under http://www.physik.uni-leipzig.de/CQT
Cited by in corpus (42)
- Multicanonical Study of Coarse-Grained Off-Lattice Models for Folding Heteropolymers
- A review of Monte Carlo simulations of polymers with PERM
- Thermodynamics of Lattice Heteropolymers
- Versatile approach to access the low temperature thermodynamics of lattice polymers and proteins
- Freezing and Collapse of Flexible Polymers on Regular Lattices in Three Dimensions
- Conformational Transitions of Non-Grafted Polymers Near an Adsorbing Substrate
- Optimized Wang-Landau sampling of lattice polymers: Ground state search and folding thermodynamics of HP model proteins
- Shape anisotropy of polymers in disordered environment
- Thermodynamics of Peptide Aggregation Processes. An Analysis from Perspectives of Three Statistical Ensembles
- Substrate Specificity of Peptide Adsorption: A Model Study
- Substrate Adhesion of a Nongrafted Flexible Polymer in a Cavity
- Conformational Mechanics of Polymer Adsorption Transitions at Attractive Substrates
- Systematic Microcanonical Analyses of Polymer Adsorption Transitions
- Unraveling the beautiful complexity of simple lattice model polymers and proteins using Wang-Landau sampling
- Exact Partition Function Zeros of a Polymer on a Simple-Cubic Lattice
- Error estimation and reduction with cross correlations
- Two-State Folding, Folding through Intermediates, and Metastability in a Minimalistic Hydrophobic-Polar Model for Proteins
- Exact Enumeration of Three-Dimensional Lattice Proteins
- Scaling behavior of self-avoiding walks on percolation clusters
- Multicanonical MCMC for Sampling Rare Events
- Exact Sequence Analysis for Three-Dimensional HP Lattice Proteins
- Walking on fractals: diffusion and self-avoiding walks on percolation clusters
- Adsorption of flexible polymer chains on a surface: Effects of different solvent conditions
- Solvent-Dependent Critical Properties of Polymer Adsorption
- Identification of Characteristic Protein Folding Channels in a Coarse-Grained Hydrophobic-Polar Peptide Model
- Massively parallelized replica-exchange simulations of polymers on GPUs
- Polymer adsorption on a fractal substrate: numerical study
- Fractals Meet Fractals: Self-Avoiding Random Walks on Percolation Clusters
- Polymers in crowded environment under stretching force: globule-coil transitions
- Adsorption of finite polymers in different thermodynamic ensembles
- Structural Properties of Small Semiconductor-Binding Synthetic Peptides
- Polymers in disordered environments
- Conformational properties of polymers in anisotropic environments
- flatIGW - an inverse algorithm to compute the Density of States of lattice Self Avoiding Walks
- Conformational Transitions of Heteropolymers
- Polymers in anisotropic environment with extended defects
- Rare event sampling with stochastic growth algorithms
- Phase diagram of the Wako-Saito-Munoz-Eaton beta-hairpin Model obtained with partition function zeros
- Multicanonical Monte Carlo Ensemble Growth Algorithm
- Conformational transitions in random heteropolymer models
- Minimalistic Hybrid Models for the Adsorption of Polymers and Peptides to Solid Substrates
- Enhanced Sampling Algorithms