The HP model of protein folding: a challenging testing ground for Wang-Landau sampling
From MaRDI portal
Publication:711191
DOI10.1016/J.CPC.2008.01.028zbMATH Open1197.82031OpenAlexW2066028596MaRDI QIDQ711191FDOQ711191
Authors: David P. Landau, Thomas Wüst
Publication date: 25 October 2010
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cpc.2008.01.028
Recommendations
- Unraveling the beautiful complexity of simple lattice model polymers and proteins using Wang-Landau sampling
- Application of Wang-Landau sampling to a protein model using SMMP
- Experimental and Efficient Algorithms
- Mathematical Foundations of Computer Science 2004
- Protein folding in the HP model on grid lattices with diagonals
Cites Work
Cited In (8)
- Monte Carlo simulations of systems with complex energy landscapes
- Universality aspects of the 2d random-bond Ising and 3D Blume-Capel models
- Title not available (Why is that?)
- Application of Wang-Landau sampling to a protein model using SMMP
- Efficient algorithm for computing exact partition functions of lattice polymer models
- Unraveling the beautiful complexity of simple lattice model polymers and proteins using Wang-Landau sampling
- A filter-and-fan approach to the 2D HP model of the protein folding problem
- Protein folding in the HP model on grid lattices with diagonals
This page was built for publication: The HP model of protein folding: a challenging testing ground for Wang-Landau sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q711191)