𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Preprocessing of rotamers for protein design calculations

✍ Scribed by Premal S. Shah; Geoffrey K. Hom; Stephen L. Mayo


Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
101 KB
Volume
25
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

We have developed a process that significantly reduces the number of rotamers in computational protein design calculations. This process, which we call Vegas, results in dramatic computational performance increases when used with algorithms based on the dead‐end elimination (DEE) theorem. Vegas estimates the energy of each rotamer at each position by fixing each rotamer in turn and utilizing various search algorithms to optimize the remaining positions. Algorithms used for this context specific optimization can include Monte Carlo, self‐consistent mean field, and the evaluation of an expression that generates a lower bound energy for the fixed rotamer. Rotamers with energies above a user‐defined cutoff value are eliminated. We found that using Vegas to preprocess rotamers significantly reduced the calculation time of subsequent DEE‐based algorithms while retaining the global minimum energy conformation. For a full boundary design of a 51 amino acid fragment of engrailed homeodomain, the total calculation time was reduced by 12‐fold. © 2004 Wiley Periodicals, Inc. J Comput Chem 25: 1797–1800, 2004


📜 SIMILAR VOLUMES


Exact rotamer optimization for protein d
✍ D. Benjamin Gordon; Geoffrey K. Hom; Stephen L. Mayo; Niles A. Pierce 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB

Computational methods play a central role in the rational design of novel proteins. The present work describes a new hybrid exact rotamer optimization (HERO) method that builds on previous dead-end elimination algorithms to yield dramatic performance enhancements. Measured on experimentally validate

Maintaining solvent accessible surface a
✍ Andrew Leaver-Fay; Glenn L. Butterfoss; Jack Snoeyink; Brian Kuhlman 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB

## Abstract Although quantities derived from solvent accessible surface areas (SASA) are useful in many applications in protein design and structural biology, the computational cost of accurate SASA calculation makes SASA‐based scores difficult to integrate into commonly used protein design methodo

Rotamer optimization for protein design
✍ Eun-Jong Hong; Shaun M. Lippow; Bruce Tidor; Tomás Lozano-Pérez 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 510 KB

## Abstract The search for the global minimum energy conformation (GMEC) of protein side chains is an important computational challenge in protein structure prediction and design. Using rotamer models, the problem is formulated as a NP‐hard optimization problem. Dead‐end elimination (DEE) methods c

Calculation of affinities of peptides fo
✍ Serena Donnini; André H. Juffer 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 437 KB

## Abstract Several methodologies were employed to calculate the Gibbs standard free energy of binding for a collection of protein–ligand complexes, where the ligand is a peptide and the protein is representative for various protein families. Almost 40 protein–ligand complexes were employed for a c

Design analysis for refolding monomeric
✍ Nicholas Kotlarski; Brian K. O'Neill; Geoffrey L. Francis; Anton P. J. Middelber 📂 Article 📅 1997 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 894 KB

Renaturation of protein expressed as inclusion bodies within Escherichia coli is a key step in many bioprocesses. Operating conditions for the refolding step dramatically affect the amount of protein product recovered, and hence profoundly influence the process economics. The first systematic compar