All recent successful methods for protein-protein docking are based on a multistage approach. Such an approach first applies a coarse grain search, and then isolates a number of regions (clusters) in the conformational space that need to be further explored. Final-stage exploration involves cluster refinement and cluster discrimination steps and poses several challenges: a multitude of clusters to explore, a very rugged energy landscape, and the need to account for the flexibility of the proteins and to incorporate entropy metrics in otherwise quite sophisticated energy potentials. The central goal of this proposal is to develop novel high-throughput optimization methods that can efficiently explore a multitude of conformational clusters and produce high-quality predictions of the bound structure. To that end, the work will leverage a new global optimization method developed by the proposing team, the Semi-Definite programming-based Underestimation (SOU) method, which can exploit the funnel-like shape of energy functions.
Specific aims i nclude: (1) the development of a final-stage optimization method that can efficiently explore conformational clusters; (2) the extension of the final-stage optimization method developed under Specific Aim 1 to allow full flexibility for the side-chains in the interface between the two proteins; and (3) the development of a cluster-discrimination algorithm that combines stochastic search approaches with estimates of funnel volume as a surrogate for the entropy of complexes in the funnel. Novel aspects of the proposed work include: (i) the identification and efficient exploration of multi- dimensional energy funnels in the translation/orientational subspaces defined by the movement of the ligand towards the receptor, (ii) the coordination of translational and orientational movements of the ligand, which can potentially reveal information about dominant association pathways, (Hi) the development of an algorithm for fast re-packing of the interface side-chains using ideas from combinatorial optimization, and (iv) the incorporation of a surrogate entropy metric in cluster discrimination leveraging stochastic search approaches. This work will substantially improve upon docking results for relatively weak protein complexes and enable the flexible docking of larger proteins than what is possible today, resulting in a better understanding of processes such as metabolic control, signal transduction, and gene regulation. ? ? ?

Agency
National Institute of Health (NIH)
Institute
National Institute of General Medical Sciences (NIGMS)
Type
Exploratory/Developmental Grants (R21)
Project #
1R21GM079396-01
Application #
7186793
Study Section
Special Emphasis Panel (ZRG1-BCMB-Q (90))
Program Officer
Wehrle, Janna P
Project Start
2007-01-15
Project End
2008-12-31
Budget Start
2007-01-15
Budget End
2007-12-31
Support Year
1
Fiscal Year
2007
Total Cost
$237,375
Indirect Cost
Name
Boston University
Department
Engineering (All Types)
Type
Schools of Engineering
DUNS #
049435266
City
Boston
State
MA
Country
United States
Zip Code
02215
Shen, Yang; Paschalidis, Ioannis Ch; Vakili, Pirooz et al. (2008) Protein docking by the underestimation of free energy funnels in the space of encounter complexes. PLoS Comput Biol 4:e1000191
Paschalidis, Ioannis Ch; Shen, Yang; Vakili, Pirooz et al. (2007) SDU: A Semidefinite Programming-Based Underestimation Method for Stochastic Global Optimization in Protein Docking. IEEE Trans Automat Contr 52:664-676
Shen, Yang; Brenke, Ryan; Kozakov, Dima et al. (2007) Docking with PIPER and refinement with SDU in rounds 6-11 of CAPRI. Proteins 69:734-42
Paschalidis, Ioannis Ch; Shen, Yang; Vakili, Pirooz et al. (2006) Protein-protein docking with reduced potentials by exploiting multi-dimensional energy funnels. Conf Proc IEEE Eng Med Biol Soc 1:5330-3