Dead-End Elimination with a Polarizable Force Field Repacks PCNA Structures
نویسندگان
چکیده
منابع مشابه
Dead-End Elimination with Backbone Flexibility
MOTIVATION Dead-End Elimination (DEE) is a powerful algorithm capable of reducing the search space for structure-based protein design by a combinatorial factor. By using a fixed backbone template, a rotamer library, and a potential energy function, DEE identifies and prunes rotamer choices that are provably not part of the Global Minimum Energy Conformation (GMEC), effectively eliminating the m...
متن کاملIon solvation thermodynamics from simulation with a polarizable force field.
Thermodynamic measurements of the solvation of salts and electrolytes are relatively straightforward, but it is not possible to separate total solvation free energies into distinct cation and anion contributions without reference to an additional extrathermodynamic assumption. The present work attempts to resolve this difficulty using molecular dynamics simulations with the AMOEBA polarizable f...
متن کاملDesigning a Peptide Ligand with Dead End Elimination
In protein redesign one of the main challenges is the ability to evaluate many different conformations of the redesigned protein in order to determine the best structure. One approach to this problem is to provably get rid of bad protein conformations using dead-end elimination (DEE). DEE was first developed for application to protein structure evaluation by Desmet et al. [1]. Since then there ...
متن کاملA supervised fitting approach to force field parametrization with application to the SIBFA polarizable force field
A supervised, semiautomated approach to force field parameter fitting is described and applied to the SIBFA polarizable force field. The I-NoLLS interactive, nonlinear least squares fitting program is used as an engine for parameter refinement while keeping parameter values within a physical range. Interactive fitting is shown to avoid many of the stability problems that frequently afflict high...
متن کاملDead-End Elimination for Weighted CSP
Soft neighborhood substitutability (SNS) is a powerful technique to automatically detect and prune dominated solutions in combinatorial optimization. Recently, it has been shown in [26] that enforcing partial SNS (PSNS) during search can be worthwhile in the context of Weighted Constraint Satisfaction Problems (WCSP). However, for some problems, especially with large domains, PSNS is still too ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biophysical Journal
سال: 2015
ISSN: 0006-3495
DOI: 10.1016/j.bpj.2015.06.062