Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Computer simulations of biomolecules such as molecular dynamics simulations are limited by the time scale of conformational rearrangements. Several sampling techniques are available to search the multi-minima free energy landscape but most efficient, time-dependent methods do generally not produce a canonical ensemble. A sampling algorithm based on a self-regulating ladder of searching copies in the dihedral subspace is developped in this paper. The learning process using short-and long-term memory functions allows an efficient search in phase space while combining a deterministic dynamics and stochastic swaps with the searching copies conserves a canonical limit. The sampling efficiency and accuracy are indicated by comparing the ansatz with conventional molecular dynamics and replica exchange simulations.
Lenka Zdeborová, Emanuele Troiani, Giovanni Piccioli
Pascal Fua, Zhen Wei, Edouard Robert Albert Patrick Dufour, Colin Pelletier