Numerical Comparisons of Three Recently Proposed Algorithms in the Protein Folding Problem
Ulrich H. E. Hansmann, Yuko Okamoto
Abstract
We compare numerically the effectiveness of three recently proposed algorithms, multicanonical simulations, simulations in a 1/k-ensemble, and simulated tempering for the protein folding problem. For this we perform simulations with high statistics for one of the simplest peptides, Met-enkephalin. While the performances of all three approaches is much better than traditional methods, we find that the differences among the three are only marginal.
Create a lesson
Related papers
The RAS-CCSD model, with applications for open-shell molecules
Sarai Dery Folkestad
Kernel-Level Constant-Potential Molecular Dynamics in GROMACS
Sheng Bi, Mathieu Salanne, Jun Cheng et al.
Tersoff-NN: Hybrid Machine-Learned Bond-Order Extension of the Tersoff Potential
Yusuke Nishimura, Sho Kubota, Kotaro Takematsu et al.
Learning Electron Density with Virtual Atoms for Transferable Atomistic Representations
Yuzhi Liu, Xinzijian Liu, Chengqian Zhang et al.
UGME: A python package for non-Markovian protein folding dynamics
Anthony J. Dominic, Bertram Cham, Andrés Montoya-Castillo
Spin Migration in the Argon Dimer
Stefanos Carlström, Serguei Patchkovskii, Misha Yu Ivanov