Studying protein-protein interactions is crucial to gaining a better understanding of processes such as metabolic control, signal transduction, and gene regulation. Many biologically important interactions occur in weak, transient complexes that are not amenable to direct experimental analysis, even if both interacting proteins can be isolated and their structures determined. Thus it is important to develop computational docking methods that, starting from the structures of component proteins, can determine the structure of their complexes with accuracy close to that obtained by X-ray crystallography. Our multistage approach to docking starts with a rigid body search that samples billions of conformations on a grid using fast Fourier transform (FFT) correlation calculations, and includes post-processing to find near-native conformations among thousands of docked structures. Our methods were among the best in the latest CAPRI docking experiment, but results are still poor for antigen-antibody and some other types of complexes. The general goal of this proposal is the development of new algorithms that will improve the accuracy and reliability of multistage docking while retaining its computational efficiency, hence enabling the use of state-of- the-art methods for a web-based docking server. We will address three problems. First, Monte Carlo-based docking programs have demonstrated that searching for optimal side chain conformations in the interface can improve results. However, Monte Carlo is not a very efficient search, and such programs are computationally too demanding to globally explore the conformational space without a priori information on the structure of the complex. To remedy this we will develop efficient docking-specific side chain search algorithms within the framework of the multistage approach. This will include the identification of """"""""key"""""""" side chains that are most important for recognition, thereby reducing the side chains'degrees of freedom. Second, accounting for electrostatics, desolvation, hydrogen bonding, and possibly experimental constraints improves docking results, but the use of such complex scoring functions reduces the numerical advantage provided by the FFT correlation approach. We will regain this advantage by developing a multi-property 5-dimensional FFT-based algorithm that can be used with scoring functions of arbitrary complexity without added computational costs. Third, docking results are particularly poor for antibody-antigen pairs. Our preliminary data indicate that results can be substantially improved by adopting asymmetric hydrophobicity potentials that account for the biophysics of interactions in particular classes of protein-protein complexes. In the first six months of the project we set up a new version of our ClusPro server, heavily used by experimentalists, which will include recent developments. The server will be continuously updated as our new algorithms become available. In addition to providing the server, we have already started development on a modular program library specific to the docking problem that will be freely accessible.
Studying protein-protein interactions is crucial to gaining a better understanding of processes such as metabolic control, signal transduction and gene regulation. Since many biologically important interactions occur in weak, transient complexes that are not amenable to direct experimental analysis, it is important to develop computational docking methods that, starting from the structures of component proteins, can determine the structure of their complexes with accuracy close to that obtained by X-ray crystallography. The general goal of this proposal is to further improve the accuracy of multistage docking while retaining its computational efficiency, thereby enabling the use of state-of-the-art methods in protein docking servers available to the scientific community.
|Zarbafian, Shahrooz; Moghadasi, Mohammad; Roshandelpoor, Athar et al. (2018) Protein docking refinement by convex underestimation in the low-dimensional subspace of encounter complexes. Sci Rep 8:5896|
|Kozakov, Dima; Hall, David R; Xia, Bing et al. (2017) The ClusPro web server for protein-protein docking. Nat Protoc 12:255-278|
|Bohnuud, Tanggis; Luo, Lingqi; Wodak, Shoshana J et al. (2017) A benchmark testing ground for integrating homology modeling and protein docking. Proteins 85:10-16|
|Vajda, Sandor; Yueh, Christine; Beglov, Dmitri et al. (2017) New additions to the ClusPro server motivated by CAPRI. Proteins 85:435-444|
|Yueh, Christine; Hall, David R; Xia, Bing et al. (2017) ClusPro-DC: Dimer Classification by the Cluspro Server for Protein-Protein Docking. J Mol Biol 429:372-381|
|Im, Wonpil; Liang, Jie; Olson, Arthur et al. (2016) Challenges in structural approaches to cell modeling. J Mol Biol 428:2943-64|
|Lensink, Marc F; Velankar, Sameer; Kryshtafovych, Andriy et al. (2016) Prediction of homoprotein and heteroprotein complexes by protein docking and template-based modeling: A CASP-CAPRI experiment. Proteins 84 Suppl 1:323-48|
|Mamonov, Artem B; Moghadasi, Mohammad; Mirzaei, Hanieh et al. (2016) Focused grid-based resampling for protein docking and mapping. J Comput Chem 37:961-70|
|Xia, Bing; Vajda, Sandor; Kozakov, Dima (2016) Accounting for pairwise distance restraints in FFT-based protein-protein docking. Bioinformatics 32:3342-3344|
|Padhorny, Dzmitry; Kazennov, Andrey; Zerbe, Brandon S et al. (2016) Protein-protein docking by fast generalized Fourier transforms on 5D rotational manifolds. Proc Natl Acad Sci U S A 113:E4286-93|
Showing the most recent 10 out of 68 publications