Geometric Recognition as a Tool for Predicting Structures of Molecular Complexes

Summary The structures of two binary complexes (the TEM-1/BLIP complex and the trypsin/amiloride complex) were predicted prior to their experimental determination and compared to the corresponding experimental structures when these became available. In both predictions the rigid-body geometric docking algorithm ranked the correct solution among the top ones. Additional information concerning the structure and chemical character of the binding site of one of the molecules in the complex was used to single out the correct solution. The results indicate that the combination of geometric surface matching with biochemical information produces a useful tool for structure prediction.     

Geometric Recognition as a Tool for Predicting Structures of Molecular Complexes

The structures of two binary complexes (the TEM-1/BLIP complex and the trypsin/amiloride complex) were predicted prior to their experimental determination and compared to the corresponding experimental structures when these became available. In both predictions the rigid-body geometric docking algorithm ranked the correct solution among the top ones. Additional information concerning the structure and chemical character of the binding site of one of the molecules in the complex was used to single out the correct solution. The results indicate that the combination of geometric surface matching with biochemical information produces a useful tool for structure prediction.     

Hydrophobic complementarity in protein-protein docking

Formation of hydrophobic contacts across a newly formed interface is energetically favorable. Based on this observation we developed a geometric-hydrophobic docking algorithm that estimates quantitatively the hydrophobic complementarity at protein-protein interfaces. Each molecule to be docked is represented as a grid of complex numbers, storing information regarding the shape of the molecule in the real part and information regarding the hydropathy of the surface in the imaginary part. The grid representations are correlated using fast Fourier transformations. The algorithm is used to compare the extent of hydrophobic complementarity in oligomers (represented by D2 tetramers) and in hetero-dimers of soluble proteins (complexes). We also test the implication of hydrophobic complementarity in distinguishing correct from false docking solutions. We find that hydrophobic complementarity at the interface exists in oligomers and in complexes, and in both groups the extent of such complementarity depends on the size of the interface. Thus, the non-polar portions of large interfaces are more often juxtaposed than non-polar portions of small interfaces. Next we find that hydrophobic complementarity helps to point out correct docking solutions. In oligomers it significantly improves the ranks of nearly correct reassembled and modeled tetramers. Combining geometric, electrostatic and hydrophobic complementarity for complexes gives excellent results, ranking a nearly correct solution < 10 for 5 of 23 tested systems, < 100 for 8 systems and < 1000 for 19 systems.     

Biologically enhanced sampling geometric docking and backbone flexibility treatment with multiconformational superposition

An efficient biologically enhanced sampling geometric docking method is presented based on the FTDock algorithm to predict the protein-protein binding modes. The active site data from different sources, such as biochemical and biophysical experiments or theoretical analyses of sequence data, can be incorporated in the rotation-translation scan. When discretizing a protein onto a 3-dimensional (3D) grid, a zero value is given to grid points outside a sphere centered on the geometric center of specified residues. In this way, docking solutions are biased toward modes where the interface region is inside the sphere. We also adopt a multiconformational superposition scheme to represent backbone flexibility in the proteins. When these procedures were applied to the targets of CAPRI, a larger number of hits and smaller ligand root-mean-square deviations (RMSDs) were obtained at the conformational search stage in all cases, and especially Target 19. With Target 18, only 1 near-native structure was retained by the biologically enhanced sampling geometric docking method, but this number increased to 53 and the least ligand RMSD decreased from 8.1 A to 2.9 A after performing multiconformational superposition. These results were obtained after the CAPRI prediction deadlines.     

Effect of local shape modifications of molecular surfaces on rigid-body protein-protein docking

Geometric complementarity is the most dominant term in protein-protein docking and therefore, a good geometric representation of the molecules, which takes into account the flexibility of surface residues, is desirable. We present a modified geometric representation of the molecular surface that down-weighs the contribution of specified parts of the surface to the complementarity score. We apply it to the mobile ends of the most flexible side chains: lysines, glutamines and arginines (trimming). The new representation systematically reduces the complementarity scores of the false-positive solutions, often more than the scores of the correct solutions, thereby improving significantly our ability to identify nearly correct solutions in rigid-body docking of unbound structures. The effect of trimming lysine residues is larger than trimming of glutamine or arginine residues. It appears to be independent of the conformations of the trimmed residues but depends on the relative abundance of such residues at the interface and on the non-interacting surface. Combining the modified geometric representation with electrostatic complementarity further improves the docking results.     

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.     

Accurate detection of protein:ligand binding sites using molecular dynamics simulations

Accurate prediction of location of cavities and surface grooves in proteins is important, as these are potential sites for ligand binding. Several currently available programs for cavity detection are unable to detect cavities near the surface or surface grooves. In the present study, an optimized molecular dynamics based procedure is described for detection and quantification of interior cavities as well as surface pockets. This is based on the observation that the mobility of water in such pockets is significantly lower than that of bulk water. The algorithm efficiently detects surface grooves that are sites of protein-ligand and protein-protein interaction. The algorithm was also used to substantially improve the performance of an automated docking procedure for docking monomers of nonobligate protein-protein complexes. In addition, it was applied to predict key residues involved in the binding of the E. coli toxin CcdB with its inhibitor. Predictions were subsequently validated by mutagenesis experiments.     

Efficient restraints for protein-protein docking by comparison of observed amino acid substitution patterns with those predicted from local environment

The discovery that the functions of most eukaryotic gene products are mediated through multi-protein complexes makes the prediction of protein interactions one of the most important current challenges in structural biology. Rigid-body docking methods can generate a large number of alternative candidates, but it is difficult to discriminate the near-native interactions from the large number of false positives. Many different scoring functions have been developed for this purpose, but in most cases, experimental and biological information is still required for accurate predictions. We explore here the use of evolutionary restraints in evaluating rigid-body docking geometries. In order to identify potential interface residues we identify functional residues based on the comparison of observed amino acid substitutions with those predicted from local environment. The interface residues identified by this method are correctly located in 85% of the cases. These predicted interface residues are used to define distance restraints that help to score rigid-body docking solutions. We have developed the pyDockRST software, which uses the percentage of satisfied distance restraints, together with the electrostatics and desolvation binding energy, to identify correct docking orientations. This methodology dramatically improves the docking results when compared to the use of energy criteria alone, and is able to find the correct orientation within the top 20 docking solutions in 80% of the cases.     

A protein-protein docking algorithm dependent on the type of complexes

An efficient 'soft docking' algorithm is described to assist the prediction of protein-protein association using three-dimensional structures of molecules. The basic tools are the 'simplified protein' model and the docking algorithm of Wodak and Janin. The side chain flexibility of Arg, Lys, Asp, Glu and Met residues at the protein surface is taken into account. The complex type-dependent filtering technique on the basis of the geometric matching, hydrophobicity and electrostatic complementarity is used to select candidate binding modes. Subsequently, we calculate a scoring function which includes electrostatic and desolvation energy terms. In the 44 complexes tested including enzyme-inhibitor, antibody-antigen and other complexes, native-like structures were all found, of which 30 were ranked in the top 20. Thus, our soft docking algorithm has the potential to predict protein-protein recognition.     

ParaDock: a flexible non-specific DNA--rigid protein docking algorithm

Accurate prediction of protein-DNA complexes could provide an important stepping stone towards a thorough comprehension of vital intracellular processes. Few attempts were made to tackle this issue, focusing on binding patch prediction, protein function classification and distance constraints-based docking. We introduce ParaDock: a novel ab initio protein-DNA docking algorithm. ParaDock combines short DNA fragments, which have been rigidly docked to the protein based on geometric complementarity, to create bent planar DNA molecules of arbitrary sequence. Our algorithm was tested on the bound and unbound targets of a protein-DNA benchmark comprised of 47 complexes. With neither addressing protein flexibility, nor applying any refinement procedure, CAPRI acceptable solutions were obtained among the 10 top ranked hypotheses in 83% of the bound complexes, and 70% of the unbound. Without requiring prior knowledge of DNA length and sequence, and within <2?h per target on a standard 2.0?GHz single processor CPU, ParaDock offers a fast ab initio docking solution.     

Evaluation of protein docking predictions using Hex 3.1 in CAPRI rounds 1 and 2

This article describes and reviews our efforts using Hex 3.1 to predict the docking modes of the seven target protein-protein complexes presented in the CAPRI (Critical Assessment of Predicted Interactions) blind docking trial. For each target, the structure of at least one of the docking partners was given in its unbound form, and several of the targets involved large multimeric structures (e.g., Lactobacillus HPr kinase, hemagglutinin, bovine rotavirus VP6). Here we describe several enhancements to our original spherical polar Fourier docking correlation algorithm. For example, a novel surface sphere smothering algorithm is introduced to generate multiple local coordinate systems around the surface of a large receptor molecule, which may be used to define a small number of initial ligand-docking orientations distributed over the receptor surface. High-resolution spherical polar docking correlations are performed over the resulting receptor surface patches, and candidate docking solutions are refined by using a novel soft molecular mechanics energy minimization procedure. Overall, this approach identified two good solutions at rank 5 or less for two of the seven CAPRI complexes. Subsequent analysis of our results shows that Hex 3.1 is able to place good solutions within a list of 相似文献   

Scoring optimisation of unbound protein-protein docking including protein binding site predictions

The prediction of the structure of the protein-protein complex is of great importance to better understand molecular recognition processes. During systematic protein-protein docking, the surface of a protein molecule is scanned for putative binding sites of a partner protein. The possibility to include external data based on either experiments or bioinformatic predictions on putative binding sites during docking has been systematically explored. The external data were included during docking with a coarse-grained protein model and on the basis of force field weights to bias the docking search towards a predicted or known binding region. The approach was tested on a large set of protein partners in unbound conformations. The significant improvement of the docking performance was found if reliable data on the native binding sites were available. This was possible even if data for single key amino acids at a binding interface are included. In case of binding site predictions with limited accuracy, only modest improvement compared with unbiased docking was found. The optimisation of the protocol to bias the search towards predicted binding sites was found to further improve the docking performance resulting in approximately 40% acceptable solutions within the top 10 docking predictions compared with 22% in case of unbiased docking of unbound protein structures.     

GalaxyDomDock: An Ab Initio Domain–domain Docking Web Server for Multi-domain Protein Structure Prediction

A significant proportion of proteins comprise multiple domains. Domain–domain docking is a tool that predicts multi-domain protein structures when individual domain structures can be accurately predicted but when domain orientations cannot be predicted accurately. GalaxyDomDock predicts an ensemble of domain orientations from given domain structures by docking. Such information would also be beneficial in elucidating the functions of proteins that have multiple states with different domain orientations. GalaxyDomDock is an ab initio domain–domain docking method based on GalaxyTongDock, a previously developed protein–protein docking method. Infeasible domain orientations for the given linker are effectively screened out from the docked conformations by a geometric filter, using the Dijkstra algorithm. In addition, domain linker conformations are predicted by adopting a loop sampling method FALC. The proposed GalaxyDomDock outperformed existing ab initio domain–domain docking methods, such as AIDA and Rosetta, in performance tests on the Rosetta benchmark set of two-domain proteins. GalaxyDomDock also performed better than or comparable to AIDA on the AIDA benchmark set of two-domain proteins and two-domain proteins containing discontinuous domains, including the benchmark set in which each domain of the set was modeled by the recent version of AlphaFold. The GalaxyDomDock web server is freely available as a part of GalaxyWEB at http://galaxy.seoklab.org/domdock.     

Binding interface prediction by combining protein–protein docking results

We developed a method called residue contact frequency (RCF), which uses the complex structures generated by the protein–protein docking algorithm ZDOCK to predict interface residues. Unlike interface prediction algorithms that are based on monomers alone, RCF is binding partner specific. We evaluated the performance of RCF using the area under the precision‐recall (PR) curve (AUC) on a large protein docking Benchmark. RCF (AUC = 0.44) performed as well as meta‐PPISP (AUC = 0.43), which is one of the best monomer‐based interface prediction methods. In addition, we test a support vector machine (SVM) to combine RCF with meta‐PPISP and another monomer‐based interface prediction algorithm Evolutionary Trace to further improve the performance. We found that the SVM that combined RCF and meta‐PPISP achieved the best performance (AUC = 0.47). We used RCF to predict the binding interfaces of proteins that can bind to multiple partners and RCF was able to correctly predict interface residues that are unique for the respective binding partners. Furthermore, we found that residues that contributed greatly to binding affinity (hotspot residues) had significantly higher RCF than other residues. Proteins 2014; 82:57–66. © 2013 Wiley Periodicals, Inc.     

A new protein-protein docking scoring function based on interface residue properties

MOTIVATION: Protein-protein complexes are known to play key roles in many cellular processes. However, they are often not accessible to experimental study because of their low stability and difficulty to produce the proteins and assemble them in native conformation. Thus, docking algorithms have been developed to provide an in silico approach of the problem. A protein-protein docking procedure traditionally consists of two successive tasks: a search algorithm generates a large number of candidate solutions, and then a scoring function is used to rank them. RESULTS: To address the second step, we developed a scoring function based on a Vorono? tessellation of the protein three-dimensional structure. We showed that the Vorono? representation may be used to describe in a simplified but useful manner, the geometric and physico-chemical complementarities of two molecular surfaces. We measured a set of parameters on native protein-protein complexes and on decoys, and used them as attributes in several statistical learning procedures: a logistic function, Support Vector Machines (SVM), and a genetic algorithm. For the later, we used ROGER, a genetic algorithm designed to optimize the area under the receiver operating characteristics curve. To further test the scores derived with ROGER, we ranked models generated by two different docking algorithms on targets of a blind prediction experiment, improving in almost all cases the rank of native-like solutions. AVAILABILITY: http://genomics.eu.org/spip/-Bioinformatics-tools-     

Automated structure-based prediction of functional sites in proteins: applications to assessing the validity of inheriting protein function from homology in genome annotation and to protein docking

A major problem in genome annotation is whether it is valid to transfer the function from a characterised protein to a homologue of unknown activity. Here, we show that one can employ a strategy that uses a structure-based prediction of protein functional sites to assess the reliability of functional inheritance. We have automated and benchmarked a method based on the evolutionary trace approach. Using a multiple sequence alignment, we identified invariant polar residues, which were then mapped onto the protein structure. Spatial clusters of these invariant residues formed the predicted functional site. For 68 of 86 proteins examined, the method yielded information about the observed functional site. This algorithm for functional site prediction was then used to assess the validity of transferring the function between homologues. This procedure was tested on 18 pairs of homologous proteins with unrelated function and 70 pairs of proteins with related function, and was shown to be 94 % accurate. This automated method could be linked to schemes for genome annotation. Finally, we examined the use of functional site prediction in protein-protein and protein-DNA docking. The use of predicted functional sites was shown to filter putative docked complexes with a discrimination similar to that obtained by manually including biological information about active sites or DNA-binding residues.     

Docking of protein molecular surfaces with evolutionary trace analysis

We have developed a new method to predict protein- protein complexes based on the shape complementarity of the molecular surfaces, along with sequence conservation obtained by evolutionary trace (ET) analysis. The docking is achieved by optimization of an object function that evaluates the degree of shape complementarity weighted by the conservation of the interacting residues. The optimization is carried out using a genetic algorithm in combination with Monte Carlo sampling. We applied this method to CAPRI targets and evaluated the performance systematically. Consequently, our method could achieve native-like predictions in several cases. In addition, we have analyzed the feasibility of the ET method for docking simulations, and found that the conservation information was useful only in a limited category of proteins (signal related proteins and enzymes).