Sandor Vajda

ClusPro: an automated docking and discrimination method for the prediction of protein complexes

MOTIVATION Predicting protein interactions is one of the most challenging problems in functional genomics. Given two proteins known to interact, current docking methods evaluate billions of docked conformations by simple scoring functions, and in addition to near-native structures yield many false positives, i.e. structures with good surface complementarity but far from the native. RESULTS We have developed a fast algorithm for filtering docked conformations with good surface complementarity, and ranking them based on their clustering properties. The free energy filters select complexes with lowest desolvation and electrostatic energies. Clustering is then used to smooth the local minima and to select the ones with the broadest energy wells-a property associated with the free energy at the binding site. The robustness of the method was tested on sets of 2000 docked conformations generated for 48 pairs of interacting proteins. In 31 of these cases, the top 10 predictions include at least one near-native complex, with an average RMSD of 5 A from the native structure. The docking and discrimination method also provides good results for a number of complexes that were used as targets in the Critical Assessment of PRedictions of Interactions experiment. AVAILABILITY The fully automated docking and discrimination server ClusPro can be found at http://structure.bu.edu

ClusPro: A fully automated algorithm for protein-protein docking

ClusPro (http://nrc.bu.edu/cluster) represents the first fully automated, web-based program for the computational docking of protein structures. Users may upload the coordinate files of two protein structures through ClusPros web interface, or enter the PDB codes of the respective structures, which ClusPro will then download from the PDB server (http://www.rcsb.org/pdb/). The docking algorithms evaluate billions of putative complexes, retaining a preset number with favorable surface complementarities. A filtering method is then applied to this set of structures, selecting those with good electrostatic and desolvation free energies for further clustering. The program output is a short list of putative complexes ranked according to their clustering properties, which is automatically sent back to the user via email.

CAPRI: A Critical Assessment of PRedicted Interactions

CAPRI is a communitywide experiment to assess the capacity of protein‐docking methods to predict protein–protein interactions. Nineteen groups participated in rounds 1 and 2 of CAPRI and submitted blind structure predictions for seven protein–protein complexes based on the known structure of the component proteins. The predictions were compared to the unpublished X‐ray structures of the complexes. We describe here the motivations for launching CAPRI, the rules that we applied to select targets and run the experiment, and some conclusions that can already be drawn. The results stress the need for new scoring functions and for methods handling the conformation changes that were observed in some of the target systems. CAPRI has already been a powerful drive for the community of computational biologists who development docking algorithms. We hope that this issue of Proteins will also be of interest to the community of structural biologists, which we call upon to provide new targets for future rounds of CAPRI, and to all molecular biologists who view protein–protein recognition as an essential process. Proteins 2003;52:2–9.

PIPER: an FFT-based protein docking program with pairwise potentials.

The Fast Fourier Transform (FFT) correlation approach to protein–protein docking can evaluate the energies of billions of docked conformations on a grid if the energy is described in the form of a correlation function. Here, this restriction is removed, and the approach is efficiently used with pairwise interaction potentials that substantially improve the docking results. The basic idea is approximating the interaction matrix by its eigenvectors corresponding to the few dominant eigenvalues, resulting in an energy expression written as the sum of a few correlation functions, and solving the problem by repeated FFT calculations. In addition to describing how the method is implemented, we present a novel class of structure‐based pairwise intermolecular potentials. The DARS (Decoys As the Reference State) potentials are extracted from structures of protein–protein complexes and use large sets of docked conformations as decoys to derive atom pair distributions in the reference state. The current version of the DARS potential works well for enzyme–inhibitor complexes. With the new FFT‐based program, DARS provides much better docking results than the earlier approaches, in many cases generating 50% more near‐native docked conformations. Although the potential is far from optimal for antibody–antigen pairs, the results are still slightly better than those given by an earlier FFT method. The docking program PIPER is freely available for noncommercial applications. Proteins 2006.

Achieving reliability and high accuracy in automated protein docking: Cluspro, PIPER, SDU, and stability analysis in CAPRI rounds 13–19

Our approach to protein—protein docking includes three main steps. First, we run PIPER, a rigid body docking program based on the Fast Fourier Transform (FFT) correlation approach, extended to use pairwise interactions potentials. Second, the 1000 best energy conformations are clustered, and the 30 largest clusters are retained for refinement. Third, the stability of the clusters is analyzed by short Monte Carlo simulations, and the structures are refined by the medium‐range optimization method SDU. The first two steps of this approach are implemented in the ClusPro 2.0 protein–protein docking server. Despite being fully automated, the last step is computationally too expensive to be included in the server. When comparing the models obtained in CAPRI rounds 13–19 by ClusPro, by the refinement of the ClusPro predictions and by all predictor groups, we arrived at three conclusions. First, for the first time in the CAPRI history, our automated ClusPro server was able to compete with the best human predictor groups. Second, selecting the top ranked models, our current protocol reliably generates high‐quality structures of protein–protein complexes from the structures of separately crystallized proteins, even in the absence of biological information, provided that there is limited backbone conformational change. Third, despite occasional successes, homology modeling requires further improvement to achieve reliable docking results. Proteins 2010.

How Good is Automated Protein Docking

The protein docking server ClusPro has been participating in critical assessment of prediction of interactions (CAPRI) since its introduction in 2004. This article evaluates the performance of ClusPro 2.0 for targets 46–58 in Rounds 22–27 of CAPRI. The analysis leads to a number of important observations. First, ClusPro reliably yields acceptable or medium accuracy models for targets of moderate difficulty that have also been successfully predicted by other groups, and fails only for targets that have few acceptable models submitted. Second, the quality of automated docking by ClusPro is very close to that of the best human predictor groups, including our own submissions. This is very important, because servers have to submit results within 48 h and the predictions should be reproducible, whereas human predictors have several weeks and can use any type of information. Third, while we refined the ClusPro results for manual submission by running computationally costly Monte Carlo minimization simulations, we observed significant improvement in accuracy only for two of the six complexes correctly predicted by ClusPro. Fourth, new developments, not seen in previous rounds of CAPRI, are that the top ranked model provided by ClusPro was acceptable or better quality for all these six targets, and that the top ranked model was also the highest quality for five of the six, confirming that ranking models based on cluster size can reliably identify the best near‐native conformations. Proteins 2013; 81:2159–2166.

Convergence and combination of methods in protein-protein docking

The analysis of results from Critical Assessment of Predicted Interactions (CAPRI), the first community-wide experiment devoted to protein docking, shows that all successful methods consist of multiple stages. The methods belong to three classes: global methods based on fast Fourier transforms (FFTs) or geometric matching, medium-range Monte Carlo methods, and the restraint-guided High Ambiguity Driven biomolecular DOCKing (HADDOCK) program. Although these classes of methods require very different amounts of information in addition to the structures of component proteins, they all share the same four computational steps: firstly, simplified and/or rigid body search; secondly, selecting the region(s) of interest; thirdly, refinement of docked structures; and fourthly, selecting the best models. Although each method is optimal for a specific class of docking problems, combining computational steps from different methods can improve the reliability and accuracy of results.

Similarity transformation approach to identifiability analysis of nonlinear compartmental models.

Through use of the local state isomorphism theorem instead of the algebraic equivalence theorem of linear systems theory, the similarity transformation approach is extended to nonlinear models, resulting in finitely verifiable sufficient and necessary conditions for global and local identifiability. The approach requires testing of certain controllability and observability conditions, but in many practical examples these conditions prove very easy to verify. In principle the method also involves nonlinear state variable transformations, but in all of the examples presented in the paper the transformations turn out to be linear. The method is applied to an unidentifiable nonlinear model and a locally identifiable nonlinear model, and these are the first nonlinear models other than bilinear models where the reason for lack of global identifiability is nontrivial. The method is also applied to two models with Michaelis-Menten elimination kinetics, both of considerable importance in pharmacokinetics, and for both of which the complicated nature of the algebraic equations arising from the Taylor series approach has hitherto defeated attempts to establish identifiability results for specific input functions.

Free energy landscapes of encounter complexes in protein-protein association.

We report the computer generation of a high-density map of the thermodynamic properties of the diffusion-accessible encounter conformations of four receptor-ligand protein pairs, and use it to study the electrostatic and desolvation components of the free energy of association. Encounter complex conformations are generated by sampling the translational/rotational space of the ligand around the receptor, both at 5-A and zero surface-to-surface separations. We find that partial desolvation is always an important effect, and it becomes dominant for complexes in which one of the reactants is neutral or weakly charged. The interaction provides a slowly varying attractive force over a small but significant region of the molecular surface. In complexes with no strong charge complementarity this region surrounds the binding site, and the orientation of the ligand in the encounter conformation with the lowest desolvation free energy is similar to the one observed in the fully formed complex. Complexes with strong opposite charges exhibit two types of behavior. In the first group, represented by barnase/barstar, electrostatics exerts strong orientational steering toward the binding site, and desolvation provides some added adhesion within the local region of low electrostatic energy. In the second group, represented by the complex of kallikrein and pancreatic trypsin inhibitor, the overall stability results from the rather nonspecific electrostatic attraction, whereas the affinity toward the binding region is determined by desolvation interactions.

Structural conservation of druggable hot spots in protein–protein interfaces

Despite the growing number of examples of small-molecule inhibitors that disrupt protein–protein interactions (PPIs), the origin of druggability of such targets is poorly understood. To identify druggable sites in protein–protein interfaces we combine computational solvent mapping, which explores the protein surface using a variety of small “probe” molecules, with a conformer generator to account for side-chain flexibility. Applications to unliganded structures of 15 PPI target proteins show that the druggable sites comprise a cluster of binding hot spots, distinguishable from other regions of the protein due to their concave topology combined with a pattern of hydrophobic and polar functionality. This combination of properties confers on the hot spots a tendency to bind organic species possessing some polar groups decorating largely hydrophobic scaffolds. Thus, druggable sites at PPI are not simply sites that are complementary to particular organic functionality, but rather possess a general tendency to bind organic compounds with a variety of structures, including key side chains of the partner protein. Results also highlight the importance of conformational adaptivity at the binding site to allow the hot spots to expand to accommodate a ligand of drug-like dimensions. The critical components of this adaptivity are largely local, involving primarily low energy side-chain motions within 6 Å of a hot spot. The structural and physicochemical signature of druggable sites at PPI interfaces is sufficiently robust to be detectable from the structure of the unliganded protein, even when substantial conformational adaptation is required for optimal ligand binding.