Maintaining solvent accessible surface area under rotamer substitution for protein design

✍ Scribed by Andrew Leaver-Fay; Glenn L. Butterfoss; Jack Snoeyink; Brian Kuhlman

• Publisher: John Wiley and Sons
• Year: 2007
• Tongue: English
• Weight: 125 KB
• Volume: 28
• Category: Article
• ISSN: 0192-8651
• DOI: 10.1002/jcc.20626

✦ Synopsis

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 methodologies. We demonstrate a method for maintaining accurate SASA during a Monte Carlo search of sequence and rotamer space for a fixed protein backbone. We extend the fast Le Grand and Merz algorithm (Le Grand and Merz, J Comput Chem, 14, 349), which discretizes the solvent accessible surface for each atom by placing dots on a sphere and combines Boolean masks to determine which dots are exposed. By replacing semigroup operations with group operations (from Boolean logic to counting dot coverage) we support SASA updates. Our algorithm takes time proportional to the number of atoms affected by rotamer substitution, rather than the number of atoms in the protein. For design simulations with a one hundred residue protein our approach is ∼145 times faster than performing a Le Grand and Merz SASA calculation from scratch following each rotamer substitution. To demonstrate practical effectiveness, we optimize a SASA‐based measure of protein packing in the complete redesign of a large set of proteins and protein–protein interfaces. © 2007 Wiley Periodicals, Inc. J Comput Chem 2007