SEARCH · PubMed Health

Results for “Protein Interaction Mapping”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 325 records · Page 18Linked to original sources

PubMed2003

Evaluation of the third solvent clusters fitting procedure for the prediction of protein-protein interactions based on the results at the CAPRI blind docking study.

To predict protein-protein interactions, rough or coarse handling for the induced fit problem is proposed. Our method involves the overlap of two hydrophobic interactions as "third solvent clusters fitting." Predictions for binding sites and geometric centers were acceptable, but those of the binding axes were poor. In this study, only the largest benzene cluster was used for the third solvent clusters fitting. For the next CAPRI targets, we must perform protein-protein interaction analyses, which include other smaller benzene clusters.

Benzene↗

PubMed2003

GAPDOCK: a Genetic Algorithm Approach to Protein Docking in CAPRI round 1.

As part of the first Critical Assessment of PRotein Interactions, round 1, we predict the structure of two protein-protein complexes, by using a genetic algorithm, GAPDOCK, in combination with surface complementarity, buried surface area, biochemical information, and human intervention. Among the five models submitted for target 1, HPr phosphocarrier protein (B. subtilis) and the hexameric HPr kinase (L. lactis), the best correctly predicts 17 of 52 interprotein contacts, whereas for target 2, bovine rotavirus VP6 protein-monoclonal antibody, the best model predicts 27 of 52 correct contacts. Given the difficult nature of the targets, these predictions are very encouraging and compare well with those obtained by other methods. Nevertheless, it is clear that there is a need for improved methods for distinguishing between "correct" and "plausible but incorrect" complexes.

Algorithms↗

PubMed2003

Modeling protein complexes with BiGGER.

This article describes the method and results of our participation in the Critical Assessment of PRediction of Interactions (CAPRI) experiment, using the protein docking program BiGGER (Bimolecular complex Generation with Global Evaluation and Ranking) (Palma et al., Proteins 2000;39:372-384). Of five target complexes (CAPRI targets 2, 4, 5, 6, and 7), only one was successfully predicted (target 6), but BiGGER generated reasonable models for targets 4, 5, and 7, which could have been identified if additional biochemical information had been available.

Algorithms↗

PubMed2003

ZDOCK predictions for the CAPRI challenge.

The CAPRI Challenge is a blind test of protein-protein-docking algorithms that predict the complex structure from the crystal structures of the interacting proteins. We participated in both rounds of this blind test and submitted predictions for all seven targets, relying mainly on our Fast Fourier Transform based algorithm ZDOCK that combines shape complementarity, desolvation, and electrostatics. Our group made good predictions for three targets and had at least some success with three others. Implications of the treatment of prior biological information as well as contributions of manual inspection to docking predictions are also discussed.

Algorithms↗

PubMed2003

ZDOCK: an initial-stage protein-docking algorithm.

The development of scoring functions is of great importance to protein docking. Here we present a new scoring function for the initial stage of unbound docking. It combines our recently developed pairwise shape complementarity with desolvation and electrostatics. We compare this scoring function with three other functions on a large benchmark of 49 nonredundant test cases and show its superior performance, especially for the antibody-antigen category of test cases. For 44 test cases (90% of the benchmark), we can retain at least one near-native structure within the top 2000 predictions at the 6 degrees rotational sampling density, with an average of 52 near-native structures per test case. The remaining five difficult test cases can be explained by a combination of poor binding affinity, large backbone conformational changes, and our algorithm's strong tendency for identifying large concave binding pockets. All four scoring functions have been integrated into our Fast Fourier Transform based docking algorithm ZDOCK, which is freely available to academic users at http://zlab.bu.edu/~ rong/dock.

Algorithms↗

PubMed2003

A protein-protein docking benchmark.

We have developed a nonredundant benchmark for testing protein-protein docking algorithms. Currently it contains 59 test cases: 22 enzyme-inhibitor complexes, 19 antibody-antigen complexes, 11 other complexes, and 7 difficult test cases. Thirty-one of the test cases, for which the unbound structures of both the receptor and ligand are available, are classified as follows: 16 enzyme-inhibitor, 5 antibody-antigen, 5 others, and 5 difficult. Such a centralized resource should benefit the docking community not only as a large curated test set but also as a common ground for comparing different algorithms. The benchmark is available at (http://zlab.bu.edu/~rong/dock/benchmark.shtml).

Algorithms↗

PubMed2003

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

Weighted geometric docking is a prediction algorithm that matches weighted molecular surfaces. Each molecule is represented by a grid of complex numbers, storing information about the shape of the molecule in the real part and weight information in the imaginary part. The weights are based on experimental biochemical and biophysical data or on theoretical analyses of amino acid conservation or correlation patterns in multiple-sequence alignments of homologous proteins. Only a few surface residues on either one or both molecules are weighted. In contrast to methods that use postscan filtering based on biochemical information, our method incorporates the external data in the rotation-translation search, producing a different set of docking solutions biased toward solutions in which the up-weighted residues are at the interface. Similarly, interactions involving specified residues can be impeded. The weighted geometric algorithm was applied to five systems for which regular geometric docking of the unbound molecules gave poor results. We obtained much better ranking of the nearly correct prediction and higher statistical significance when weighted geometric docking was used. The method was successful even when the weighted portion of the surface corresponded only partially and approximately to the binding site.

Algorithms↗

PubMed2003

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.

Algorithms↗

PubMed2003

Assessment of blind predictions of protein-protein interactions: current status of docking methods.

The current status of docking procedures for predicting protein-protein interactions starting from their three-dimensional structure is assessed from a first major evaluation of blind predictions. This evaluation was performed as part of a communitywide experiment on Critical Assessment of PRedicted Interactions (CAPRI). Seven newly determined structures of protein-protein complexes were available as targets for this experiment. These were the complexes between a kinase and its protein substrate, between a T-cell receptor beta-chain and a superantigen, and five antigen-antibody complexes. For each target, the predictors were given the experimental structures of the free components, or of one free and one bound component in a random orientation. The structure of the complex was revealed only at the time of the evaluation. A total of 465 predictions submitted by 19 groups were evaluated. These groups used a wide range of algorithms and scoring functions, some of which were completely novel. The quality of the predicted interactions was evaluated by comparing residue-residue contacts and interface residues to those in the X-ray structures and by analyzing the fit of the ligand molecules (the smaller of the two proteins in the complex) or of interface residues only, in the predicted versus target complexes. A total of 14 groups produced predictions, ranking from acceptable to highly accurate for five of the seven targets. The use of available biochemical and biological information, and in one instance structural information, played a key role in achieving this result. It was essential for identifying the native binding modes for the five correctly predicted targets, including the kinase-substrate complex where the enzyme changes conformation on association. But it was also the cause for missing the correct solution for the two remaining unpredicted targets, which involve unexpected antigen-antibody binding modes. Overall, this analysis reveals genuine progress in docking procedures but also illustrates the remaining serious limitations and points out the need for better scoring functions and more effective ways for handling conformational flexibility.

Algorithms↗

PubMed2003

Successful discrimination of protein interactions.

We present results from the prediction of protein complexes associated with the first Critical Assessment of PRediction of Interactions (CAPRI) experiment. Our algorithm, SmoothDock, comprises four steps: (1) we perform rigid body docking using the program DOT, keeping the top 20,000 structures as ranked by surface complementarity; (2) we rerank these structures according to a free energy estimate that includes both desolvation and electrostatics and retain the top 2000 complexes; (3) we cluster the filtered complexes using a pairwise root-mean-square deviation (RMSD) criterion; (4) the 25 largest clusters are subject to a smooth docking discrimination algorithm where van der Waals forces are taken into account. We predicted targets 1, 6, and 7 with RMSDs of 9.5, 2.4, and 2.6 A, respectively. More importantly, from the perspective of biological applications, our approach consistently ranked the correct model first (i.e., with highest confidence). For target 5 we identified the binding region but not the correct orientation. Although we were able to find reasonable clusters for all targets, low-affinity complexes (K(d) < nM) were harder to discriminate. For four of seven targets, the top models predicted by our automated procedure were among the best communitywide predictions.

Algorithms↗

PubMed2003

Finding needles in haystacks: Reranking DOT results by using shape complementarity, cluster analysis, and biological information.

We present an evaluation of our results for the first Critical Assessment of PRedicted Interaction (CAPRI). The methods used include the molecular docking program DOT, shape analysis tool FADE, cluster analysis and filtering based on biological data. Good results were obtained for most of the seven CAPRI targets, and for two systems, submissions having the highest number of correctly predicted contacts were produced.

Algorithms↗

PubMed2003

Evaluation of the 3D-Dock protein docking suite in rounds 1 and 2 of the CAPRI blind trial.

The 3D-Dock suite of programs has been used to make predictions for the seven targets in rounds 1 and 2 of the CAPRI method evaluation exercise. Some correct contacts were obtained in at least one prediction for four of seven targets. Target 06 was predicted very well, with an RMSD of the ligand after superimposition of the receptor of only 0.77 A. We investigate the performance of the various stages of the method, with the aim of finding where improvements need to be made, and in particular whether the manual interventions that were made were essential, and whether results of the level of accuracy obtained for target 06 may be expected with confidence.

Algorithms↗

PubMed2003

Taking geometry to its edge: fast unbound rigid (and hinge-bent) docking.

We present a very efficient rigid "unbound" soft docking methodology, which is based on detection of geometric shape complementarity, allowing liberal steric clash at the interface. The method is based on local shape feature matching, avoiding the exhaustive search of the 6D transformation space. Our experiments at CAPRI rounds 1 and 2 show that although the method does not perform an exhaustive search of the 6D transformation space, the "correct" solution is never lost. However, such a solution might rank low for large proteins, because there are alternatives with significantly larger geometrically compatible interfaces. In many cases this problem can be resolved by successful a priori focusing on the vicinity of potential binding sites as well as the extension of the technique to flexible (hinge-bent) docking. This is demonstrated in the experiments performed as a lesson from our CAPRI experience.

Algorithms↗

PubMed2004

Characterization of Lys-698-to-Met substitution in human plasminogen catalytic domain.

Streptokinase (SK) is a human plasminogen (Pg) activator secreted by streptococci. The activation mechanism of SK differs from that of physiological Pg activators in that SK is not a protease and cannot proteolytically activate Pg. Instead, it forms a tight complex with Pg that proteolytically activates other Pg molecules. The residue Lys-698 of human Pg was hypothesized to participate in triggering activation in the SK-Pg complex. Here, we report a study of the Lys-698 to Met substitution in the catalytic domain of Pg (microPg) containing the proteolytic activation-resistant background (R561A). While it remains competent in forming a complex with SK, maintaining a comparable equilibration dissociation constant (K(D)), the recombinant protein shows a nearly 60-fold reduction in amidolytic activity relative to its R561A background when mixed with native SK. A 2.3 A crystal structure of this mutant microPg confirmed the correct folding of this recombinant protein. Combined with other biochemical data, these results support the premise that Lys-698 of human Pg plays a functional role in the so-called N-terminal insertion activation mechanism by SK.

Amino Acid Substitution↗

PubMed2004

A structural pattern-based method for protein fold recognition.

A method (SPREK) was developed to evaluate the register of a sequence on a structure based on the matching of structural patterns against a library derived from the protein structure databank. The scores obtained were normalized against random background distributions derived from sequence shuffling and permutation methods. 'Random' structures were also used to evaluate the effectiveness of the method. These were generated by a simple random-walk and a more sophisticated structure prediction method that produced protein-like folds. For comparison with other methods, the performance of the method was assessed using collections of models including decoys and models from the CASP-5 exercise. The performance of SPREK on the decoy models was equivalent to (and sometimes better than) those obtained with more complex approaches. An exception was the two smallest proteins, for which SPREK did not perform well due to a lack of patterns. Using the best parameter combination from trials on decoy models, the CASP models of intermediate difficulty were evaluated by SPREK and the quality of the top scoring model was evaluated by its CASP ranking. Of the 14 targets in this class, half lie in the top 10% (out of around 140 models for each target). The two worst rankings resulted from the selection by our method of a well-packed model that was based on the wrong fold. Of the other poor rankings, one was the smallest protein and the others were the four largest (all over 250 residues).

Algorithms↗

PubMed2004

Change in protein flexibility upon complex formation: analysis of Ras-Raf using molecular dynamics and a molecular framework approach.

Changes in flexibility upon protein-protein complex formation of H-Ras and the Ras-binding domain of C-Raf1 have been investigated using the molecular framework approach FIRST (Floppy Inclusion and Rigid Substructure Topology) and molecular dynamics simulations (MD) of in total approximately 35 ns length. In a computational time of about one second, FIRST identifies flexible and rigid regions in a single, static three-dimensional molecular framework, whose vertices represent protein atoms and whose edges represent covalent and non-covalent (hydrogen bond and hydrophobic) constraints and fixed bond angles within the protein. The two methods show a very good agreement with respect to the identification of changes in flexibility in both binding partners on a local scale. This implies that flexibility can be successfully predicted by identifying which bonds limit motion within a molecule and how they are coupled. In particular, as identified by MD, the beta-sheet in Raf shows considerably more pronounced orientational correlations in the bound state compared to the unbound state. Similarly, FIRST assigns the beta-sheet to the largest rigid cluster of the complex. Interestingly, FIRST allows us to identify that interactions across the interface (but not conformational changes upon complex formation) result in the observed rigidification. Since regions of the beta-sheet of Raf that do not interact directly with Ras become rigidified, this also demonstrates the long-range aspect to rigidity percolation. Possible implications of the change of flexibility of the Ras-binding domain of Raf on the activation of Raf upon complex formation are discussed. Finally, the sensitivity of FIRST results with respect to the representation of non-covalent interactions used as constraints is probed.

Algorithms↗

PubMed2004

A unified representation of multiprotein complex data for modeling interaction networks.

The protein interaction network presents one perspective for understanding cellular processes. Recent experiments employing high-throughput mass spectrometric characterizations have resulted in large data sets of physiologically relevant multiprotein complexes. We present a unified representation of such data sets based on an underlying bipartite graph model that is an advance over existing models of the network. Our unified representation allows for weighting of connections between proteins shared in more than one complex, as well as addressing the higher level organization that occurs when the network is viewed as consisting of protein complexes that share components. This representation also allows for the application of the rigorous MinMaxCut graph clustering algorithm for the determination of relevant protein modules in the networks. Statistically significant annotations of clusters in the protein-protein and complex-complex networks using terms from the Gene Ontology indicate that this method will be useful for posing hypotheses about uncharacterized components of protein complexes or uncharacterized relationships between protein complexes.

Algorithms↗

PubMed2004

Protein contact prediction using patterns of correlation.

We describe a new method for using neural networks to predict residue contact pairs in a protein. The main inputs to the neural network are a set of 25 measures of correlated mutation between all pairs of residues in two "windows" of size 5 centered on the residues of interest. While the individual pair-wise correlations are a relatively weak predictor of contact, by training the network on windows of correlation the accuracy of prediction is significantly improved. The neural network is trained on a set of 100 proteins and then tested on a disjoint set of 1033 proteins of known structure. An average predictive accuracy of 21.7% is obtained taking the best L/2 predictions for each protein, where L is the sequence length. Taking the best L/10 predictions gives an average accuracy of 30.7%. The predictor is also tested on a set of 59 proteins from the CASP5 experiment. The accuracy is found to be relatively consistent across different sequence lengths, but to vary widely according to the secondary structure. Predictive accuracy is also found to improve by using multiple sequence alignments containing many sequences to calculate the correlations.

Amino Acids↗