Weighted geometric docking: incorporating external information in the rotation-translation scan

A computational model of ESAT-6 complex in membrane

One quarter of the world's population are infected by Mycobacterium tuberculosis (Mtb), which is a leading death-causing bacterial pathogen. Recent evidence has demonstrated that two virulence factors, ESAT-6 and CFP-10, play crucial roles in Mtb's cytosolic translocation. Many efforts have been made to study the ESAT-6 and CFP-10 proteins. Some studies have shown that ESAT-6 has an essential role in rupturing phagosome. However, the mechanisms of how ESAT-6 interacts with the membrane have not yet been fully understood. Recent studies indicate that the ESAT-6 disassociates with CFP-10 upon their interaction with phagosome membrane, forming a membrane-spanning pore. Based on these observations, as well as the available structure of ESAT-6, ESAT-6 is hypothesized to form an oligomer for membrane insertion as well as rupturing. Such an ESAT-6 oligomer may play a significant role in the tuberculosis infection. Therefore, deeper understanding of the oligomerization of ESAT-6 will establish new directions for tuberculosis treatment. However, the structure of the oligomer of ESAT-6 is not known. Here, we proposed a comprehensive approach to model the complex structures of ESAT-6 oligomer inside a membrane. Several computational tools, including MD simulation, symmetrical docking, MM/PBSA, are used to obtain and characterize such a complex structure. Results from our studies lead to a well-supported hypothesis of the ESAT-6 oligomerization as well as the identification of essential residues in stabilizing the ESAT-6 oligomer which provide useful insights for future drug design targeting tuberculosis. The approach in this research can also be used to model and study other cross-membrane complex structures.

Rigid-Docking Approaches to Explore Protein-Protein Interaction Space

Protein-protein interactions play core roles in living cells, especially in the regulatory systems. As information on proteins has rapidly accumulated on publicly available databases, much effort has been made to obtain a better picture of protein-protein interaction networks using protein tertiary structure data. Predicting relevant interacting partners from their tertiary structure is a challenging task and computer science methods have the potential to assist with this. Protein-protein rigid docking has been utilized by several projects, docking-based approaches having the advantages that they can suggest binding poses of predicted binding partners which would help in understanding the interaction mechanisms and that comparing docking results of both non-binders and binders can lead to understanding the specificity of protein-protein interactions from structural viewpoints. In this review we focus on explaining current computational prediction methods to predict pairwise direct protein-protein interactions that form protein complexes.

Modeling protein assemblies in the proteome

Most (if not all) proteins function when associated in multimolecular assemblies. Attaining the structures of protein assemblies at the atomic scale is an important aim of structural biology. Experimentally, structures are increasingly available, and computations can help bridge the resolution gap between high- and low-resolution scales. Existing computational methods have made substantial progress toward this aim; however, current approaches are still limited. Some involve manual adjustment of experimental data; some are automated docking methods, which are computationally expensive and not applicable to large-scale proteome studies; and still others exploit the symmetry of the complexes and thus are not applicable to nonsymmetrical complexes. Our study aims to take steps toward overcoming these limitations. We have developed a strategy for the construction of protein assemblies computationally based on binary interactions predicted by a motif-based protein interaction prediction tool, PRISM (Protein Interactions by Structural Matching). Previously, we have shown its power in predicting pairwise interactions. Here we take a step toward multimolecular assemblies, reflecting the more prevalent cellular scenarios. With this method we are able to construct homo-/hetero-complexes and symmetric/asymmetric complexes without a limitation on the number of components. The method considers conformational changes and is applicable to large-scale studies. We also exploit electron microscopy density maps to select a solution from among the predictions. Here we present the method, illustrate its results, and highlight its current limitations.

Pairwise and multimeric protein-protein docking using the LZerD program suite

Physical interactions between proteins are involved in many important cell functions and are key for understanding the mechanisms of biological processes. Protein-protein docking programs provide a means to computationally construct three-dimensional (3D) models of a protein complex structure from its component protein units. A protein docking program takes two or more individual 3D protein structures, which are either experimentally solved or computationally modeled, and outputs a series of probable complex structures.In this chapter we present the LZerD protein docking suite, which includes programs for pairwise docking, LZerD and PI-LZerD, and multiple protein docking, Multi-LZerD, developed by our group. PI-LZerD takes protein docking interface residues as additional input information. The methods use a combination of shape-based protein surface features as well as physics-based scoring terms to generate protein complex models. The programs are provided as stand-alone programs and can be downloaded from http://kiharalab.org/proteindocking.

How to use not-always-reliable binding site information in protein-protein docking prediction

In many protein-protein docking algorithms, binding site information is used to help predicting the protein complex structures. Using correct and accurate binding site information can increase protein-protein docking success rate significantly. On the other hand, using wrong binding sites information should lead to a failed prediction, or, at least decrease the success rate. Recently, various successful theoretical methods have been proposed to predict the binding sites of proteins. However, the predicted binding site information is not always reliable, sometimes wrong binding site information could be given. Hence there is a high risk to use the predicted binding site information in current docking algorithms. In this paper, a softly restricting method (SRM) is developed to solve this problem. By utilizing predicted binding site information in a proper way, the SRM algorithm is sensitive to the correct binding site information but insensitive to wrong information, which decreases the risk of using predicted binding site information. This SRM is tested on benchmark 3.0 using purely predicted binding site information. The result shows that when the predicted information is correct, SRM increases the success rate significantly; however, even if the predicted information is completely wrong, SRM only decreases success rate slightly, which indicates that the SRM is suitable for utilizing predicted binding site information.

Protein-protein docking with F(2)Dock 2.0 and GB-rerank

Motivation

Computational simulation of protein-protein docking can expedite the process of molecular modeling and drug discovery. This paper reports on our new F² Dock protocol which improves the state of the art in initial stage rigid body exhaustive docking search, scoring and ranking by introducing improvements in the shape-complementarity and electrostatics affinity functions, a new knowledge-based interface propensity term with FFT formulation, a set of novel knowledge-based filters and finally a solvation energy (GBSA) based reranking technique. Our algorithms are based on highly efficient data structures including the dynamic packing grids and octrees which significantly speed up the computations and also provide guaranteed bounds on approximation error.

Results

The improved affinity functions show superior performance compared to their traditional counterparts in finding correct docking poses at higher ranks. We found that the new filters and the GBSA based reranking individually and in combination significantly improve the accuracy of docking predictions with only minor increase in computation time. We compared F² Dock 2.0 with ZDock 3.0.2 and found improvements over it, specifically among 176 complexes in ZLab Benchmark 4.0, F² Dock 2.0 finds a near-native solution as the top prediction for 22 complexes; where ZDock 3.0.2 does so for 13 complexes. F² Dock 2.0 finds a near-native solution within the top 1000 predictions for 106 complexes as opposed to 104 complexes for ZDock 3.0.2. However, there are 17 and 15 complexes where F² Dock 2.0 finds a solution but ZDock 3.0.2 does not and vice versa; which indicates that the two docking protocols can also complement each other.

Availability

The docking protocol has been implemented as a server with a graphical client (TexMol) which allows the user to manage multiple docking jobs, and visualize the docked poses and interfaces. Both the server and client are available for download. Server: http://www.cs.utexas.edu/~bajaj/cvc/software/f2dock.shtml. Client: http://www.cs.utexas.edu/~bajaj/cvc/software/f2dockclient.shtml.

A critical assessment of information-guided protein-protein docking predictions

The structures of protein complexes are increasingly predicted via protein-protein docking (PPD) using ambiguous interaction data to help guide the docking. These data often are incomplete and contain errors and therefore could lead to incorrect docking predictions. In this study, we performed a series of PPD simulations to examine the effects of incompletely and incorrectly assigned interface residues on the success rate of PPD predictions. The results for a widely used PPD benchmark dataset obtained using a new interface information-driven PPD (IPPD) method developed in this work showed that the success rate for an acceptable top-ranked model varied, depending on the information content used, from as high as 95% when contact relationships (though not contact distances) were known for all residues to 78% when only the interface/non-interface state of the residues was known. However, the success rates decreased rapidly to ∼40% when the interface/non-interface state of 20% of the residues was assigned incorrectly, and to less than 5% for a 40% incorrect assignment. Comparisons with results obtained by re-ranking a global search and with those reported for other data-guided PPD methods showed that, in general, IPPD performed better than re-ranking when the information used was more complete and more accurate, but worse when it was not, and that when using bioinformatics-predicted information on interface residues, IPPD and other data-guided PPD methods performed poorly, at a level similar to simulations with a 40% incorrect assignment. These results provide guidelines for using information about interface residues to improve PPD predictions and reveal a bottleneck for such improvement imposed by the low accuracy of current bioinformatic interface residue predictions.

A unique spatial arrangement of the snRNPs within the native spliceosome emerges from in silico studies

The spliceosome is a mega-Dalton ribonucleoprotein (RNP) assembly that processes primary RNA transcripts, producing functional mRNA. The electron microscopy structures of the native spliceosome and of several spliceosomal subcomplexes are available; however, the spatial arrangement of the latter within the native spliceosome is not known. We designed a computational procedure to efficiently fit thousands of conformers into the spliceosome envelope. Despite the low resolution limitations, we obtained only one model that complies with the available biochemical data. Our model localizes the five small nuclear RNPs (snRNPs) mostly within the large subunit of the native spliceosome, requiring only minor conformation changes. The remaining free volume presumably accommodates additional spliceosomal components. The constituents of the active core of the spliceosome are juxtaposed, forming a continuous surface deep within the large spliceosomal cavity, which provides a sheltered environment for the splicing reaction.

Constructing structural networks of signaling pathways on the proteome scale

Proteins function through their interactions, and the availability of protein interaction networks could help in understanding cellular processes. However, the known structural data are limited and the classical network node-and-edge representation, where proteins are nodes and interactions are edges, shows only which proteins interact; not how they interact. Structural networks provide this information. Protein-protein interface structures can also indicate which binding partners can interact simultaneously and which are competitive, and can help forecasting potentially harmful drug side effects. Here, we use a powerful protein-protein interactions prediction tool which is able to carry out accurate predictions on the proteome scale to construct the structural network of the extracellular signal-regulated kinases (ERK) in the mitogen-activated protein kinase (MAPK) signaling pathway. This knowledge-based method, PRISM, is motif-based, and is combined with flexible refinement and energy scoring. PRISM predicts protein interactions based on structural and evolutionary similarity to known protein interfaces.

Multi-LZerD: multiple protein docking for asymmetric complexes

The tertiary structures of protein complexes provide a crucial insight about the molecular mechanisms that regulate their functions and assembly. However, solving protein complex structures by experimental methods is often more difficult than single protein structures. Here, we have developed a novel computational multiple protein docking algorithm, Multi-LZerD, that builds models of multimeric complexes by effectively reusing pairwise docking predictions of component proteins. A genetic algorithm is applied to explore the conformational space followed by a structure refinement procedure. Benchmark on eleven hetero-multimeric complexes resulted in near-native conformations for all but one of them (a root mean square deviation smaller than 2.5Å). We also show that our method copes with unbound docking cases well, outperforming the methodology that can be directly compared with our approach. Multi-LZerD was able to predict near-native structures for multimeric complexes of various topologies.

Optimized grid-based protein-protein docking as a global search tool followed by incorporating experimentally derivable restraints

Unbound protein docking, or the computational prediction of the structure of a protein complex from the structures of its separated components, is of importance but still challenging. A practical approach toward reliable results for unbound docking is to incorporate experimentally derived information with computation. To this end, truly systematic search of the global docking space is desirable. The fast Fourier transform (FFT) docking is a systematic search method with high computational efficiency. However, by using FFT to perform unbound docking, possible conformational changes upon binding must be treated implicitly. To better accommodate the implicit treatment of conformational flexibility, we develop a rational approach to optimize "softened" parameters for FFT docking. In connection with the increased "softness" of the parameters in this global search step, we use a revised rule to select candidate models from the search results. For complexes designated as of low and medium difficulty for unbound docking, these adaptations of the original FTDOCK program lead to substantial improvements of the global search results. Finally, we show that models resulted from FFT-based global search can be further filtered with restraints derivable from nuclear magnetic resonance (NMR) chemical shift perturbation or mutagenesis experiments, leading to a small set of models that can be feasibly refined and evaluated using computationally more expensive methods and that still include high-ranking near-native conformations.

CAPRI targets T29-T42: proving ground for new docking procedures

The critical assessment of protein interactions (CAPRI) experiment provides a unique opportunity for unbiased assessment of docking procedures. The recent CAPRI targets T29-T42 entailed docking of bound, unbound, and modeled structures, presenting a wide range of prediction difficulty. We submitted accurate predictions for targets T40, T41, and T42, a good prediction for T32 and acceptable predictions for T29 and T34. The accuracy of our docking results generally matched the prediction difficulty; hence, docking of modeled proteins produced less accurate results. However, there were interesting exceptions: an accurate prediction was submitted for the dimer of modeled tetratricopeptide repeat (T42) and only an acceptable prediction for the bound/unbound case T29. The ensembles of docking models produced in the scans included an acceptable or better prediction for every target. We show here that our recently developed postscan reevaluation procedure, which tests propensity and solvation measures of the whole interface and the interface core, successfully distinguished these predictions from false docking models. For enzyme-inhibitor targets, we show that the distance of the interface from the enzyme's centroid ranked high native like docking models. Also, for one case we demonstrate that docking of an ensemble of conformers produced by normal modes analysis can improve the accuracy of the prediction.

ASPDock: protein-protein docking algorithm using atomic solvation parameters model

Background

Atomic Solvation Parameters (ASP) model has been proven to be a very successful method of calculating the binding free energy of protein complexes. This suggests that incorporating it into docking algorithms should improve the accuracy of prediction. In this paper we propose an FFT-based algorithm to calculate ASP scores of protein complexes and develop an ASP-based protein-protein docking method (ASPDock).

Results

The ASPDock is first tested on the 21 complexes whose binding free energies have been determined experimentally. The results show that the calculated ASP scores have stronger correlation (r ≈ 0.69) with the binding free energies than the pure shape complementarity scores (r ≈ 0.48). The ASPDock is further tested on a large dataset, the benchmark 3.0, which contain 124 complexes and also shows better performance than pure shape complementarity method in docking prediction. Comparisons with other state-of-the-art docking algorithms showed that ASP score indeed gives higher success rate than the pure shape complementarity score of FTDock but lower success rate than Zdock3.0. We also developed a softly restricting method to add the information of predicted binding sites into our docking algorithm. The ASP-based docking method performed well in CAPRI rounds 18 and 19.

Conclusions

ASP may be more accurate and physical than the pure shape complementarity in describing the feature of protein docking.

Designing coarse grained-and atom based-potentials for protein-protein docking

BACKGROUND

Protein-protein docking is a challenging computational problem in functional genomics, particularly when one or both proteins undergo conformational change(s) upon binding. The major challenge is to define a scoring function soft enough to tolerate these changes and specific enough to distinguish between near-native and "misdocked" conformations.

RESULTS

Using a linear programming (LP) technique, we developed two types of potentials: (i) Side chain-based and (ii) Heavy atom-based. To achieve this we considered a set of 161 transient complexes and generated a large set of putative docked structures (decoys), based on a shape complementarity criterion, for each complex. The demand on the potentials was to yield, for the native (correctly docked) structure, a potential energy lower than those of any of the non-native (misdocked) structures. We show that the heavy atom-based potentials were able to comply with this requirement but not the side chain-based one. Thus, despite the smaller number of parameters, the capability of heavy atom-based potentials to discriminate between native and "misdocked" conformations is improved relative to those of the side chain-based potentials. The performance of the atom-based potentials was evaluated by a jackknife test on a set of 50 complexes taken from the Zdock2.3 decoys set.

CONCLUSIONS

Our results show that, using the LP approach, we were able to train our potentials using a dataset of transient complexes only the newly developed potentials outperform three other known potentials in this test.

Building macromolecular assemblies by information-driven docking: introducing the HADDOCK multibody docking server

Over the last years, large scale proteomics studies have generated a wealth of information of biomolecular complexes. Adding the structural dimension to the resulting interactomes represents a major challenge that classical structural experimental methods alone will have difficulties to confront. To meet this challenge, complementary modeling techniques such as docking are thus needed. Among the current docking methods, HADDOCK (High Ambiguity-Driven DOCKing) distinguishes itself from others by the use of experimental and/or bioinformatics data to drive the modeling process and has shown a strong performance in the critical assessment of prediction of interactions (CAPRI), a blind experiment for the prediction of interactions. Although most docking programs are limited to binary complexes, HADDOCK can deal with multiple molecules (up to six), a capability that will be required to build large macromolecular assemblies. We present here a novel web interface of HADDOCK that allows the user to dock up to six biomolecules simultaneously. This interface allows the inclusion of a large variety of both experimental and/or bioinformatics data and supports several types of cyclic and dihedral symmetries in the docking of multibody assemblies. The server was tested on a benchmark of six cases, containing five symmetric homo-oligomeric protein complexes and one symmetric protein-DNA complex. Our results reveal that, in the presence of either bioinformatics and/or experimental data, HADDOCK shows an excellent performance: in all cases, HADDOCK was able to generate good to high quality solutions and ranked them at the top, demonstrating its ability to model symmetric multicomponent assemblies. Docking methods can thus play an important role in adding the structural dimension to interactomes. However, although the current docking methodologies were successful for a vast range of cases, considering the variety and complexity of macromolecular assemblies, inclusion of some kind of experimental information (e.g. from mass spectrometry, nuclear magnetic resonance, cryoelectron microscopy, etc.) will remain highly desirable to obtain reliable results.

A simple reference state makes a significant improvement in near-native selections from structurally refined docking decoys

Near-native selections from docking decoys have proved challenging especially when unbound proteins are used in the molecular docking. One reason is that significant atomic clashes in docking decoys lead to poor predictions of binding affinities of near native decoys. Atomic clashes can be removed by structural refinement through energy minimization. Such an energy minimization, however, will lead to an unrealistic bias toward docked structures with large interfaces. Here, we extend an empirical energy function developed for protein design to protein-protein docking selection by introducing a simple reference state that removes the unrealistic dependence of binding affinity of docking decoys on the buried solvent accessible surface area of interface. The energy function called EMPIRE (EMpirical Protein-InteRaction Energy), when coupled with a refinement strategy, is found to provide a significantly improved success rate in near native selections when applied to RosettaDock and refined ZDOCK docking decoys. Our work underlines the importance of removing nonspecific interactions from specific ones in near native selections from docking decoys.

FitEM2EM--tools for low resolution study of macromolecular assembly and dynamics

Studies of the structure and dynamics of macromolecular assemblies often involve comparison of low resolution models obtained using different techniques such as electron microscopy or atomic force microscopy. We present new computational tools for comparing (matching) and docking of low resolution structures, based on shape complementarity. The matched or docked objects are represented by three dimensional grids where the value of each grid point depends on its position with regard to the interior, surface or exterior of the object. The grids are correlated using fast Fourier transformations producing either matches of related objects or docking models depending on the details of the grid representations. The procedures incorporate thickening and smoothing of the surfaces of the objects which effectively compensates for differences in the resolution of the matched/docked objects, circumventing the need for resolution modification. The presented matching tool FitEM2EMin successfully fitted electron microscopy structures obtained at different resolutions, different conformers of the same structure and partial structures, ranking correct matches at the top in every case. The differences between the grid representations of the matched objects can be used to study conformation differences or to characterize the size and shape of substructures. The presented low-to-low docking tool FitEM2EMout ranked the expected models at the top.

Integrating diverse data for structure determination of macromolecular assemblies

To understand the cell, we need to determine the macromolecular assembly structures, which may consist of tens to hundreds of components. First, we review the varied experimental data that characterize the assemblies at several levels of resolution. We then describe computational methods for generating the structures using these data. To maximize completeness, resolution, accuracy, precision, and efficiency of the structure determination, a computational approach is required that uses spatial information from a variety of experimental methods. We propose such an approach, defined by its three main components: a hierarchical representation of the assembly, a scoring function consisting of spatial restraints derived from experimental data, and an optimization method that generates structures consistent with the data. This approach is illustrated by determining the configuration of the 456 proteins in the nuclear pore complex (NPC) from baker's yeast. With these tools, we are poised to integrate structural information gathered at multiple levels of the biological hierarchy--from atoms to cells--into a common framework.

A filter enhanced sampling and combinatorial scoring study for protein docking in CAPRI

Protein-protein docking is usually exploited with a two-step strategy, i.e., conformational sampling and decoy scoring. In this work, a new filter enhanced sampling scheme was proposed and added into the RosettaDock algorithm to improve the conformational sampling efficiency. The filter term is based on the statistical result that backbone hydrogen bonds in the native protein structures are wrapped by more than nine hydrophobic groups to shield them from attacks of water molecules (Fernandez and Scheraga, Proc Natl Acad Sci USA 2003;100:113-118). A combinatorial scoring function, ComScore, specially designed for the other-type protein-protein complexes was also adopted to select the near native docked modes. ComScore was composed of the atomic contact energy, van der Waals, and electrostatic interaction energies, and the weight of each item was fit through the multiple linear regression approach. To analyze our docking results, the filter enhanced sampling scheme was applied to targets T12, T20, and T21 after the CAPRI blind test, and improvements were obtained. The ligand least root mean square deviations (L_rmsds) were reduced and the hit numbers were increased. ComScore was used in the scoring test for CAPRI rounds 9-12 with good success in rounds 9 and 11.

Prediction of physical protein-protein interactions

Many essential cellular processes such as signal transduction, transport, cellular motion and most regulatory mechanisms are mediated by protein-protein interactions. In recent years, new experimental techniques have been developed to discover the protein-protein interaction networks of several organisms. However, the accuracy and coverage of these techniques have proven to be limited, and computational approaches remain essential both to assist in the design and validation of experimental studies and for the prediction of interaction partners and detailed structures of protein complexes. Here, we provide a critical overview of existing structure-independent and structure-based computational methods. Although these techniques have significantly advanced in the past few years, we find that most of them are still in their infancy. We also provide an overview of experimental techniques for the detection of protein-protein interactions. Although the developments are promising, false positive and false negative results are common, and reliable detection is possible only by taking a consensus of different experimental approaches. The shortcomings of experimental techniques affect both the further development and the fair evaluation of computational prediction methods. For an adequate comparative evaluation of prediction and high-throughput experimental methods, an appropriately large benchmark set of biophysically characterized protein complexes would be needed, but is sorely lacking.

Prediction of HIV-1 entry inhibitors neomycin-arginine conjugates interaction with the CD4-gp120 binding site by molecular modeling and multistep docking procedure

Developing of multi-target HIV-1 entry inhibitors represents an important avenue of drug therapy. Two such inhibitors are hexa-arginine-neomycin-conjugate (NeoR6) and nona-d-arginine-neomycin-conjugate (Neo-r9). Our findings that NeoR6-resistant mutations appear in the gp120 constant regions; and NeoR6 is not CCR5 antagonist, but inhibits CXCR4 and CCR5 HIV-1 using isolates, led us to suggest that NeoR6 may inhibit HIV-1 entry by interfering with the CD4-gp120 binding. To support this notion, we constructed a homology model of unliganded HIV-1(IIIB) gp120 and docked NeoR6 and Neo-r9 to it, using a multistep docking procedure: geometric-electrostatic docking by MolFit; flexible ligand docking by Autodock3 and final refinement of the obtained complexes by Discover3. Binding free energies were calculated by MM-PBSA methodology. The model predicts competitive inhibition of CD4-gp120 binding by NeoR6 and Neo-r9. We determined plausible binding sites between constructed CD4-bound gp120 trimer and homology modeled membranal CXCR4, and tested NeoR6 and Neo-r9 interfering with this interaction. These models support our notion that another mechanism of anti-HIV-1 activity of NeoR6 is inhibition of gp120-CXCR4 binding. These structural models and interaction of NeoR6 and Neo-r9 with gp120 and CXCR4 provide a powerful approach for structural based drug design for selective targeting of HIV-1 entry and/or for inhibition of other retroviruses with similar mechanism of entry.

Residue conservation information for generating near-native structures in protein-protein docking

MOTIVATION

Protein-protein docking algorithms typically generate large numbers of possible complex structures with only a few of them resembling the native structure. Recently (Duan et al., Protein Sci, 14:316-218, 2005), it was observed that the surface density of conserved residue positions is high at the interface regions of interacting protein surfaces, except for antibody-antigen complexes, where a lesser number of conserved positions than average is observed at the interface regions. Using this observation, we identified putative interacting regions on the surface of interacting partners and significantly improved docking results by assigning top ranks to near-native complex structures. In this paper, we combine the residue conservation information with a widely used shape complementarity algorithm to generate candidate complex structures with a higher percentage of near-native structures (hits). What is new in this work is that the conservation information is used early in the generation stage and not only in the ranking stage of the docking algorithm. This results in a significantly larger number of generated hits and an improved predictive ability in identifying the native structure of protein-protein complexes.

RESULTS

We report on results from 48 well-characterized protein complexes, which have enough residue conservation information from the same 59 benchmark complexes used in our previous work. We compute conservation indices of residue positions on the surfaces of interacting proteins using available homologous sequences from UNIPROT and calculate the solvent accessible surface area. We combine this information with shape-complementarity scores to generate candidate protein-protein complex structures. When compared with pure shape-complementarity algorithms, performed by FTDock, our method results in significantly more hits, with the improvement being over 100% in many instances. We demonstrate that residue conservation information is useful not only in refinement and scoring of docking solutions, but also helpful in enrichment of near-native-structures during the generation of candidate geometries of complex structures.

Identification of novel glycogen synthase kinase-3beta substrate-interacting residues suggests a common mechanism for substrate recognition

Substrate recognition and specificity are essential for the reliability and fidelity of protein kinase function. GSK-3 has a unique substrate specificity that requires prior phosphorylation of its substrates. However, how the enzyme selects its phosphorylated substrates is unknown. Here, we combined in silico modeling with mutagenesis and biological studies to identify GSK-3-substrate interaction sites located within its binding cleft. Protein-protein docking of GSK-3beta and the phosphorylated cAMP responsive element binding protein (pCREB) (using the available experimentally determined structures), identified Phe67, Gln89, and Asn95 of GSK-3beta as putative binding sites interacting with the CREB phosphorylation motif. Mutations of these residues to alanine impaired GSK-3beta phosphorylation of several substrates, without abrogating its autocatalytic activity. Subsequently, expression of the GSK-3beta mutants in cells resulted in decreased phosphorylation of substrates CREB, IRS-1, and beta-catenin, and prevented their suppression of glycogen synthase activity as compared with cells expressing the wild-type GSK-3beta. Our studies provide important additional understanding of how GSK-3beta recognizes its substrates: In addition to prior phosphorylation typically required in GSK-3 substrates, substrate recognition involves interactions with GSK-3beta residues: Phe67, Gln89, and Asn95, which confer a common basis for substrate binding and selectivity, yet allow for substrate diversity.

Optimal design of protein docking potentials: efficiency and limitations

Protein-protein docking is a challenging computational problem in functional genomics, particularly when one or both proteins undergo conformational change(s) upon binding. The major challenge is to define scoring function soft enough to tolerate these changes and specific enough to distinguish between near-native and "misdocked" conformations. Using a linear programming technique, we derived protein docking potentials (PDPs) that comply with this requirement. We considered a set of 63 nonredundant complexes to this aim, and generated 400,000 putative docked complexes (decoys) based on shape complementarity criterion for each complex. The PDPs were required to yield for the native (correctly docked) structure a potential energy lower than those of all the nonnative (misdocked) structures. The energy constraints applied to all complexes led to ca. 25 million inequalities, the simultaneous solution of which yielded an optimal set of PDPs that discriminated the correctly docked (up to 4.0 A root-mean-square deviation from known complex structure) structure among the 85 top-ranking (0.02%) decoys in 59/63 examined bound-bound cases. The high performance of the potentials was further verified in jackknife tests and by ranking putative docked conformation submitted to CAPRI. In addition to their utility in identifying correctly folded complexes, the PDPs reveal biologically meaningful features that distinguish docking potentials from folding potentials.

Looking at enzymes from the inside out: the proximity of catalytic residues to the molecular centroid can be used for detection of active sites and enzyme-ligand interfaces

Analysis of the distances of the exposed residues in 175 enzymes from the centroids of the molecules indicates that catalytic residues are very often found among the 5% of residues closest to the enzyme centroid. This property of catalytic residues is implemented in a new prediction algorithm (named EnSite) for locating the active sites of enzymes and in a new scheme for re-ranking enzyme-ligand docking solutions. EnSite examines only 5% of the molecular surface (represented by surface dots) that is closest to the centroid, identifying continuous surface segments and ranking them by their area size. EnSite ranks the correct prediction 1-4 in 97% of the cases in a dataset of 65 monomeric enzymes (rank 1 for 89% of the cases) and in 86% of the cases in a dataset of 176 monomeric and multimeric enzymes from all six top-level enzyme classifications (rank 1 in 74% of the cases). Importantly, identification of buried or flat active sites is straightforward because EnSite "looks" at the molecular surface from the inside out. Detailed examination of the results indicates that the proximity of the catalytic residues to the centroid is a property of the functional unit, defined as the assembly of domains or chains that form the active site (in most cases the functional unit corresponds to a single whole polypeptide chain). Using the functional unit in the prediction further improves the results. The new property of active sites is also used for re-evaluating enzyme-inhibitor unbound docking results. Sorting the docking solutions by the distance of the interface to the centroid of the enzyme improves remarkably the ranks of nearly correct solutions compared to ranks based on geometric-electrostatic-hydrophobic complementarity scores.

Physicochemical and residue conservation calculations to improve the ranking of protein-protein docking solutions

Many protein-protein docking algorithms generate numerous possible complex structures with only a few of them resembling the native structure. The major challenge is choosing the near-native structures from the generated set. Recently it has been observed that the density of conserved residue positions is higher at the interface regions of interacting protein surfaces, except for antibody-antigen complexes, where a very low number of conserved positions is observed at the interface regions. In the present study we have used this observation to identify putative interacting regions on the surface of interacting partners. We studied 59 protein complexes, used previously as a benchmark data set for docking investigations. We computed conservation indices of residue positions on the surfaces of interacting proteins using available homologous sequences and used this information to filter out from 56% to 86% of generated docked models, retaining near-native structures for further evaluation. We used a reverse filter of conservation score to filter out the majority of nonnative antigen-antibody complex structures. For each docked model in the filtered subsets, we relaxed the conformation of the side chains by minimizing the energy with CHARMM, and then calculated the binding free energy using a generalized Born method and solvent-accessible surface area calculations. Using the free energy along with conservation information and other descriptors used in the literature for ranking docking solutions, such as shape complementarity and pair potentials, we developed a global ranking procedure that significantly improves the docking results by giving top ranks to near-native complex structures.

Modeling oligomers with Cn or Dn symmetry: Application to CAPRI target 10

The abundance of oligomeric proteins makes them a frequent target for structure prediction. However, homologous proteins sometimes adopt different oligomerization states, rendering the prediction of structures of whole oligomers beyond the scope of comparative modeling. This obstacle can be overcome by combining comparative modeling of the single subunit of an oligomer with docking techniques, designed for predicting subunit-subunit interfaces. We present here algorithms for predicting the structures of homo-oligomers with C(n) or D(n) (n > 2) symmetry. The prediction procedure includes a symmetry-restricted docking step followed by a C(n) or D(n) oligomer-forming step, in which the dimers from the docking step are assembled to oligomers. The procedure is applied to each of the crystallographically independent subunits in 8 C(n) and 3 D(n) oligomers, producing very accurate predictions. It is further applied to a single monomer of the tick-borne encephalitis virus coat protein E (Target 10 of the CAPRI experiment). The predicted trimer ranked 30, obtained via rigid-body geometric-hydrophobic docking followed by C(n) oligomer formation, is very similar to the experimentally observed trimer formed by domain II of this protein. Furthermore, the predicted trimer formed from the separated domain I is also close to the experimental structure.

Docking to single-domain and multiple-domain proteins: Old and new challenges

The diverse selection of targets in the CAPRI experiments provides grounds for determining the limits of our rigid-body docking program MolFit, and for extending it. We find that the sensitivity of MolFit is high, enabling it to produce reasonably accurate docking solutions when the structures undergo moderate local conformation changes upon complex formation or when the docked molecules are modeled. Yet the ranks of these solutions are sometimes too low to meet the requirements of CAPRI assessment. This indicates that the selectivity of MolFit, which was optimized for docking of unbound X-ray structures, and which relies on the availability of external data from biochemical and bioinformatic sources, needs readjustment in order to meet the challenges presented by NMR or modeled structures. A different challenge is presented by large global conformation changes such as movements of domains. We show that such changes can be accommodated within the rigid-body approximation by employing rigid multibody multistage docking procedures. We also address the difficulty of ranking results from 2-body and multibody docking scans in cases in which there are no external data favoring one option over the other.

The effect of resolution-dependent global shape modifications on rigid-body protein-protein docking

Docking unbound molecules presents a challenge in the case where no prior biological or bioinformatic knowledge exists. This is mainly due to differences between the structures of the molecules when in a complex and in the free state. Presumably, these differences interfere with the ability of protein-protein docking algorithms, which rely on a dominant shape descriptor, to identify the correct solution and rank it higher than false solutions. In this study we verify the notion that small discords in the molecular fit can be eliminated by using appropriately designed low-resolution shape descriptors, thereby improving the docking results. We exploit the inherent gradual resolution dependency of Fourier transforms and formulate a resolution-dependent shape descriptor by truncating selected Fourier transform terms. Thus, different levels of shape modification are attained, affecting the degree of detail in the depiction of the molecular surface. We applied the modified descriptor to a selection of 23 protein-protein systems, using the unbound structures where possible. The docking results obtained with the new geometric descriptor were considerably superior to former results, improving the ranks of nearly correct solutions for 17 systems. Unification of the results of scans in which different resolutions were employed further improved the ranks of nearly correct solutions to less than 100 for 12 of the 23 systems and less than 300 for 20 systems. The new geometric descriptor can be combined with other descriptors, which typify the electrostatic or hydrophobic character of the molecular surface, and with external experimental or bioinformatic data.

Computational approaches to protein-protein interaction

The interactions between proteins allow the cell's life. A number of experimental, genome-wide, high-throughput studies have been devoted to the determination of protein-protein interactions and the consequent interaction networks. Here, the bioinformatics methods dealing with protein-protein interactions and interaction network are overviewed. 1. Interaction databases developed to collect and annotate this immense amount of data; 2. Automated data mining techniques developed to extract information about interactions from the published literature; 3. Computational methods to assess the experimental results developed as a consequence of the finding that the results of high-throughput methods are rather inaccurate; 4. Exploitation of the information provided by protein interaction networks in order to predict functional features of the proteins; and 5. Prediction of protein-protein interactions.

Data-driven docking for the study of biomolecular complexes

With the amount of genetic information available, a lot of attention has focused on systems biology, in particular biomolecular interactions. Considering the huge number of such interactions, and their often weak and transient nature, conventional experimental methods such as X-ray crystallography and NMR spectroscopy are not sufficient to gain structural insight into these. A wealth of biochemical and/or biophysical data can, however, readily be obtained for biomolecular complexes. Combining these data with docking (the process of modeling the 3D structure of a complex from its known constituents) should provide valuable structural information and complement the classical structural methods. In this review we discuss and illustrate the various sources of data that can be used to map interactions and their combination with docking methods to generate structural models of the complexes. Finally a perspective on the future of this kind of approach is given.

On proteins, grids, correlations, and docking

The activity of a living cell can be portrayed as a network of interactions involving proteins and nucleic acids that transfer biological information. Intervention in cellular processes requires thorough understanding of the interactions between the molecules, which can be provided by docking techniques. Docking methods attempt to predict the structures of complexes given the structures of the component molecules. We focus hereby on protein-protein docking procedures that employ grid representations of the molecules, and use correlation for searching the solution space and evaluating putative complexes. Geometric surface complementarity is the dominant descriptor in docking. Inclusion of electrostatics often improves the results of geometric docking for soluble proteins, whereas hydrophobic complementarity is more important in construction of oligomers. Using binding-site information in the scan or as a filter helps to identify and up-rank nearly correct solutions.

Prediction of the unknown: inspiring experience with the CAPRI experiment

We submitted predictions for all seven targets in the CAPRI experiment. For four targets, our submitted models included acceptable, medium accuracy predictions of the structures of the complexes, and for a fifth target we identified the location of the binding site of one of the molecules. We used a weighted-geometric docking algorithm in which contacts involving specified parts of the surfaces of either one or both molecules were up-weighted or down-weighted. The weights were based on available structural and biochemical data or on sequence analyses. The weighted-geometric docking proved very useful for five targets, improving the complementarity scores and the ranks of the nearly correct solutions, as well as their statistical significance. In addition, the weighted-geometric docking promoted formation of clusters of similar solutions, which include more accurate predictions.

Genome-wide studies of protein-protein interaction

Recent large-scale studies of protein complexes in yeast have demonstrated that the wide majority of proteins exist in the cell as parts of multicomponent assemblies, mostly novel and of unknown function. The structural and functional analysis of these complexes should be a priority for structural biologists in coming years. In silico methods such as docking simulations, which may contribute to this analysis, are being tested in the CAPRI community-wide experiment, which assesses blind predictions of the structure of protein-protein complexes.