Generalized-Ensemble Algorithms for Protein Folding Simulations

TL;DR

This paper reviews generalized-ensemble algorithms like multicanonical, simulated tempering, and replica-exchange, which improve protein folding simulations by overcoming quasi-ergodicity and enabling efficient sampling across energy landscapes.

Contribution

It provides a comprehensive overview of these algorithms, including their Monte Carlo and molecular dynamics implementations and recent extensions, enhancing simulation capabilities.

Findings

Improved sampling efficiency in protein folding simulations.

Ability to obtain canonical averages from a single simulation.

Extensions of existing algorithms for better performance.

Abstract

Conventional simulations of complex systems in the canonical ensemble suffer from the quasi-ergodicity problem. A simulation in generalized ensemble overcomes this difficulty by performing a random walk in potential energy space and other parameter space. From only one simulation run, one can obtain canonical-ensemble averages of physical quantities as functions of temperature by the single-histogram and/or multiple-histogram reweighting techniques. In this article we review the generalized-ensemble algorithms. Three well-known methods, namely, multicanonical algorithm, simulated tempering, and replica-exchange method, are described first. Both Monte Carlo and molecular dynamics versions of the algorithms are given. We then present further extensions of the above three methods.