Polarizable Protein Packing
- Creators
- Ng, Albert H.
- Snow, Christopher D.
Abstract
To incorporate protein polarization effects within a protein combinatorial optimization framework, we decompose the polarizable force field AMOEBA into low order terms. Including terms up to the third-order provides a fair approximation to the full energy while maintaining tractability. We represent the polarizable packing problem for protein G as a hypergraph and solve for optimal rotamers with the FASTER combinatorial optimization algorithm. These approximate energy models can be improved to high accuracy [root mean square deviation (rmsd) < 1 kJ mol^(−1)] via ridge regression. The resulting trained approximations are used to efficiently identify new, low-energy solutions. The approach is general and should allow combinatorial optimization of other many-body problems.
Additional Information
© 2011 Wiley Periodicals, Inc. Received 9 December 2009; Revised 12 October 2010; Accepted 17 October 2010. Published online 24 January 2011. The authors thank Frances H. Arnold for support. The authors thank Phillip A. Romero, Gevorg Grigoryan, and an anonymous reviewer for useful suggestions. A.H.N. was supported by the Caltech Summer Undergraduate Research Fellowship program (SURF).Additional details
- Eprint ID
- 23418
- Resolver ID
- CaltechAUTHORS:20110421-143247084
- Caltech Summer Undergraduate Research Fellowship Program (SURF)
- Created
-
2011-04-21Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field