Premium
A knowledge‐based move set for protein folding
Author(s) -
Chen William W.,
Yang Jae Shick,
Shakhnovich Eugene I.
Publication year - 2006
Publication title -
proteins: structure, function, and bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.699
H-Index - 191
eISSN - 1097-0134
pISSN - 0887-3585
DOI - 10.1002/prot.21237
Subject(s) - dihedral angle , energy landscape , maxima and minima , protein folding , monte carlo method , statistical physics , set (abstract data type) , computer science , folding (dsp implementation) , protein structure prediction , simulated annealing , algorithm , protein structure , chemistry , physics , mathematics , molecule , engineering , biochemistry , organic chemistry , mathematical analysis , hydrogen bond , statistics , electrical engineering , programming language
The free energy landscape of protein folding is rugged, occasionally characterized by compact, intermediate states of low free energy. In computational folding, this landscape leads to trapped, compact states with incorrect secondary structure. We devised a residue‐specific, protein backbone move set for efficient sampling of protein‐like conformations in computational folding simulations. The move set is based on the selection of a small set of backbone dihedral angles, derived from clustering dihedral angles sampled from experimental structures. We show in both simulated annealing and replica exchange Monte Carlo (REMC) simulations that the knowledge‐based move set, when compared with a conventional move set, shows statistically significant improved ability at overcoming kinetic barriers, reaching deeper energy minima, and achieving correspondingly lower RMSDs to native structures. The new move set is also more efficient, being able to reach low energy states considerably faster. Use of this move set in determining the energy minimum state and for calculating thermodynamic quantities is discussed. Proteins 2007. © 2006 Wiley‐Liss, Inc.