Protein social behavior makes a stronger signal for partner identification than surface geometry

Cells are interactive living systems where proteins movements, interactions and regulation are substantially free from centralized management. How protein physico‐chemical and geometrical properties determine who interact with whom remains far from fully understood. We show that characterizing how a protein behaves with many potential interactors in a complete cross‐docking study leads to a sharp identification of its cellular/true/native partner(s). We define a sociability index, or S‐index, reflecting whether a protein likes or not to pair with other proteins. Formally, we propose a suitable normalization function that accounts for protein sociability and we combine it with a simple interface‐based (ranking) score to discriminate partners from non‐interactors. We show that sociability is an important factor and that the normalization permits to reach a much higher discriminative power than shape complementarity docking scores. The social effect is also observed with more sophisticated docking algorithms. Docking conformations are evaluated using experimental binding sites. These latter approximate in the best possible way binding sites predictions, which have reached high accuracy in recent years. This makes our analysis helpful for a global understanding of partner identification and for suggesting discriminating strategies. These results contradict previous findings claiming the partner identification problem being solvable solely with geometrical docking. Proteins 2016; 85:137–154. © 2016 Wiley Periodicals, Inc.     

Hidden partners: Using cross‐docking calculations to predict binding sites for proteins with multiple interactions

Protein‐protein interactions control a large range of biological processes and their identification is essential to understand the underlying biological mechanisms. To complement experimental approaches, in silico methods are available to investigate protein‐protein interactions. Cross‐docking methods, in particular, can be used to predict protein binding sites. However, proteins can interact with numerous partners and can present multiple binding sites on their surface, which may alter the binding site prediction quality. We evaluate the binding site predictions obtained using complete cross‐docking simulations of 358 proteins with 2 different scoring schemes accounting for multiple binding sites. Despite overall good binding site prediction performances, 68 cases were still associated with very low prediction quality, presenting individual area under the specificity‐sensitivity ROC curve (AUC) values below the random AUC threshold of 0.5, since cross‐docking calculations can lead to the identification of alternate protein binding sites (that are different from the reference experimental sites). For the large majority of these proteins, we show that the predicted alternate binding sites correspond to interaction sites with hidden partners, that is, partners not included in the original cross‐docking dataset. Among those new partners, we find proteins, but also nucleic acid molecules. Finally, for proteins with multiple binding sites on their surface, we investigated the structural determinants associated with the binding sites the most targeted by the docking partners.     

Structural quality of unrefined models in protein docking

Structural characterization of protein‐protein interactions is essential for understanding life processes at the molecular level. However, only a fraction of protein interactions have experimentally resolved structures. Thus, reliable computational methods for structural modeling of protein interactions (protein docking) are important for generating such structures and understanding the principles of protein recognition. Template‐based docking techniques that utilize structural similarity between target protein‐protein interaction and cocrystallized protein‐protein complexes (templates) are gaining popularity due to generally higher reliability than that of the template‐free docking. However, the template‐based approach lacks explicit penalties for intermolecular penetration, as opposed to the typical free docking where such penalty is inherent due to the shape complementarity paradigm. Thus, template‐based docking models are commonly assumed to require special treatment to remove large structural penetrations. In this study, we compared clashes in the template‐based and free docking of the same proteins, with crystallographically determined and modeled structures. The results show that for the less accurate protein models, free docking produces fewer clashes than the template‐based approach. However, contrary to the common expectation, in acceptable and better quality docking models of unbound crystallographically determined proteins, the clashes in the template‐based docking are comparable to those in the free docking, due to the overall higher quality of the template‐based docking predictions. This suggests that the free docking refinement protocols can in principle be applied to the template‐based docking predictions as well. Proteins 2016; 85:39–45. © 2016 Wiley Periodicals, Inc.     

Deciphering protein complexes and protein interaction networks by tandem affinity purification and mass spectrometry: analytical perspective

We employed a combination of tandem affinity purification and mass spectrometry for deciphering protein complexes and the protein interaction network in budding yeast. 53 genes were epitope-tagged, and their interaction partners were isolated by two-step immunoaffinity chromatography from whole cell lysates. 38 baits pulled down a total of 220 interaction partners, which are members of 19 functionally distinct protein complexes. We identified four proteins shared between complexes of different functionality thus charting segments of a protein interaction network. Concordance with the results of genome-wide two-hybrid screening was poor (14% of identified interactors overlapped) suggesting that the two approaches may provide complementary views on physical interactions within the proteome.     

iATTRACT: Simultaneous global and local interface optimization for protein–protein docking refinement

Protein‐protein interactions are abundant in the cell but to date structural data for a large number of complexes is lacking. Computational docking methods can complement experiments by providing structural models of complexes based on structures of the individual partners. A major caveat for docking success is accounting for protein flexibility. Especially, interface residues undergo significant conformational changes upon binding. This limits the performance of docking methods that keep partner structures rigid or allow limited flexibility. A new docking refinement approach, iATTRACT, has been developed which combines simultaneous full interface flexibility and rigid body optimizations during docking energy minimization. It employs an atomistic molecular mechanics force field for intermolecular interface interactions and a structure‐based force field for intramolecular contributions. The approach was systematically evaluated on a large protein‐protein docking benchmark, starting from an enriched decoy set of rigidly docked protein–protein complexes deviating by up to 15 Å from the native structure at the interface. Large improvements in sampling and slight but significant improvements in scoring/discrimination of near native docking solutions were observed. Complexes with initial deviations at the interface of up to 5.5 Å were refined to significantly better agreement with the native structure. Improvements in the fraction of native contacts were especially favorable, yielding increases of up to 70%. Proteins 2015; 83:248–258. © 2014 Wiley Periodicals, Inc.     

Accurate prediction of protein–protein interactions from sequence alignments using a Bayesian method

Accurate and large‐scale prediction of protein–protein interactions directly from amino‐acid sequences is one of the great challenges in computational biology. Here we present a new Bayesian network method that predicts interaction partners using only multiple alignments of amino‐acid sequences of interacting protein domains, without tunable parameters, and without the need for any training examples. We first apply the method to bacterial two‐component systems and comprehensively reconstruct two‐component signaling networks across all sequenced bacteria. Comparisons of our predictions with known interactions show that our method infers interaction partners genome‐wide with high accuracy. To demonstrate the general applicability of our method we show that it also accurately predicts interaction partners in a recent dataset of polyketide synthases. Analysis of the predicted genome‐wide two‐component signaling networks shows that cognates (interacting kinase/regulator pairs, which lie adjacent on the genome) and orphans (which lie isolated) form two relatively independent components of the signaling network in each genome. In addition, while most genes are predicted to have only a small number of interaction partners, we find that 10% of orphans form a separate class of ‘hub’ nodes that distribute and integrate signals to and from up to tens of different interaction partners.     

Intuitive,but not simple: Including explicit water molecules in protein–protein docking simulations improves model quality

Characterizing the nature of interaction between proteins that have not been experimentally cocrystallized requires a computational docking approach that can successfully predict the spatial conformation adopted in the complex. In this work, the Hydropathic INTeractions (HINT) force field model was used for scoring docked models in a data set of 30 high‐resolution crystallographically characterized “dry” protein–protein complexes and was shown to reliably identify native‐like models. However, most current protein–protein docking algorithms fail to explicitly account for water molecules involved in bridging interactions that mediate and stabilize the association of the protein partners, so we used HINT to illuminate the physical and chemical properties of bridging waters and account for their energetic stabilizing contributions. The HINT water Relevance metric identified the “truly” bridging waters at the 30 protein–protein interfaces and we utilized them in “solvated” docking by manually inserting them into the input files for the rigid body ZDOCK program. By accounting for these interfacial waters, a statistically significant improvement of ～24% in the average hit‐count within the top‐10 predictions the protein–protein dataset was seen, compared to standard “dry” docking. The results also show scoring improvement, with medium and high accuracy models ranking much better than incorrect ones. These improvements can be attributed to the physical presence of water molecules that alter surface properties and better represent native shape and hydropathic complementarity between interacting partners, with concomitantly more accurate native‐like structure predictions. Proteins 2014; 82:916–932. © 2013 Wiley Periodicals, Inc.     

Biochemical approaches for discovering protein-protein interactions

Protein–protein interactions or protein complexes are integral in nearly all cellular processes, ranging from metabolism to structure. Elucidating both individual protein associations and complex protein interaction networks, while challenging, is an essential goal of functional genomics. For example, discovering interacting partners for a 'protein of unknown function' can provide insight into actual function far beyond what is possible with sequence-based predictions, and provide a platform for future research. Synthetic genetic approaches such as two-hybrid screening often reveal a perplexing array of potential interacting partners for any given target protein. It is now known, however, that this type of anonymous screening approach can yield high levels of false-positive results, and therefore putative interactors must be confirmed by independent methods. In vitro biochemical strategies for identifying interacting proteins are varied and time-honored, some being as old as the field of protein chemistry itself. Herein we discuss five biochemical approaches for isolating and characterizing protein–protein interactions in vitro : co-immunoprecipitation, blue native gel electrophoresis, in vitro binding assays, protein cross-linking, and rate-zonal centrifugation. A perspective is provided for each method, and where appropriate specific, trial-tested methods are included.     

Biotin tagging coupled with amino acid‐coded mass tagging for efficient and precise screening of interaction proteome in mammalian cells

In mammalian cells, when tandem affinity purification approach is employed, the existence of untagged endogenous target protein and repetitive washing steps together result in overall low yield of purified/stable complexes and the loss of weakly and transiently interacting partners of biological significance. To avoid the trade‐offs involving in methodological sensitivity, precision, and throughput, here we introduce an integrated method, biotin tagging coupled with amino acid‐coded mass tagging, for highly sensitive and accurate screening of mammalian protein–protein interactions. Without the need of establishing a stable cell line, using a short peptide tag which could be specifically biotinylated in vivo, the biotin‐tagged target/bait protein was then isolated along with its associates efficiently by streptavidin magnetic microbeads in a single step. In a pulled‐down complex amino acid‐coded mass tagging serves as “in‐spectra” quantitative markers to distinguish those bait‐specific interactors from non‐specific background proteins under stringent criteria. Applying this biotin tagging coupled with amino acid‐coded mass tagging approach, we first biotin‐tagged in vivo a multi‐functional protein family member, 14‐3‐3ε, which was expressed at close to endogenous level. Starting with approximately 20 millions of 293T cells which were significantly less than what needed for a tandem affinity purification run, 266 specific interactors of 14‐3‐3ε were identified in high confidence.     

Trophic interaction modifications: an empirical and theoretical framework

Consumer–resource interactions are often influenced by other species in the community. At present these ‘trophic interaction modifications’ are rarely included in ecological models despite demonstrations that they can drive system dynamics. Here, we advocate and extend an approach that has the potential to unite and represent this key group of non‐trophic interactions by emphasising the change to trophic interactions induced by modifying species. We highlight the opportunities this approach brings in comparison to frameworks that coerce trophic interaction modifications into pairwise relationships. To establish common frames of reference and explore the value of the approach, we set out a range of metrics for the ‘strength’ of an interaction modification which incorporate increasing levels of contextual information about the system. Through demonstrations in three‐species model systems, we establish that these metrics capture complimentary aspects of interaction modifications. We show how the approach can be used in a range of empirical contexts; we identify as specific gaps in current understanding experiments with multiple levels of modifier species and the distributions of modifications in networks. The trophic interaction modification approach we propose can motivate and unite empirical and theoretical studies of system dynamics, providing a route to confront ecological complexity.     

Protein-protein docking with multiple residue conformations and residue substitutions

The protein docking problem has two major aspects: sampling conformations and orientations, and scoring them for fit. To investigate the extent to which the protein docking problem may be attributed to the sampling of ligand side‐chain conformations, multiple conformations of multiple residues were calculated for the uncomplexed (unbound) structures of protein ligands. These ligand conformations were docked into both the complexed (bound) and unbound conformations of the cognate receptors, and their energies were evaluated using an atomistic potential function. The following questions were considered: (1) does the ensemble of precalculated ligand conformations contain a structure similar to the bound form of the ligand? (2) Can the large number of conformations that are calculated be efficiently docked into the receptors? (3) Can near‐native complexes be distinguished from non‐native complexes? Results from seven test systems suggest that the precalculated ensembles do include side‐chain conformations similar to those adopted in the experimental complexes. By assuming additivity among the side chains, the ensemble can be docked in less than 12 h on a desktop computer. These multiconformer dockings produce near‐native complexes and also non‐native complexes. When docked against the bound conformations of the receptors, the near‐native complexes of the unbound ligand were always distinguishable from the non‐native complexes. When docked against the unbound conformations of the receptors, the near‐native dockings could usually, but not always, be distinguished from the non‐native complexes. In every case, docking the unbound ligands with flexible side chains led to better energies and a better distinction between near‐native and non‐native fits. An extension of this algorithm allowed for docking multiple residue substitutions (mutants) in addition to multiple conformations. The rankings of the docked mutant proteins correlated with experimental binding affinities. These results suggest that sampling multiple residue conformations and residue substitutions of the unbound ligand contributes to, but does not fully provide, a solution to the protein docking problem. Conformational sampling allows a classical atomistic scoring function to be used; such a function may contribute to better selectivity between near‐native and non‐native complexes. Allowing for receptor flexibility may further extend these results.     

Combining affinity enrichment,cross‐linking with photo amino acids,and mass spectrometry for probing protein kinase D2 interactions

We present a novel approach that relies on the affinity capture of protein interaction partners from a complex mixture, followed by their covalent fixation via UV‐induced activation of incorporated diazirine photoreactive amino acids (photo‐methionine and photo‐leucine). The captured protein complexes are enzymatically digested and interacting proteins are identified and quantified by label‐free LC/MS analysis. Using HeLa cell lysates with photo‐methionine and photo‐leucine‐labeled proteins, we were able to capture and preserve protein interactions that are otherwise elusive in conventional pull‐down experiments. Our approach is exemplified for mapping the protein interaction network of protein kinase D2, but has the potential to be applied to any protein system. Data are available via ProteomeXchange with identifiers PXD005346 (photo amino acid incorporation) and PXD005349 (enrichment experiments).     

Great interactions: How binding incorrect partners can teach us about protein recognition and function

Protein–protein interactions play a key part in most biological processes and understanding their mechanism is a fundamental problem leading to numerous practical applications. The prediction of protein binding sites in particular is of paramount importance since proteins now represent a major class of therapeutic targets. Amongst others methods, docking simulations between two proteins known to interact can be a useful tool for the prediction of likely binding patches on a protein surface. From the analysis of the protein interfaces generated by a massive cross‐docking experiment using the 168 proteins of the Docking Benchmark 2.0, where all possible protein pairs, and not only experimental ones, have been docked together, we show that it is also possible to predict a protein's binding residues without having any prior knowledge regarding its potential interaction partners. Evaluating the performance of cross‐docking predictions using the area under the specificity‐sensitivity ROC curve (AUC) leads to an AUC value of 0.77 for the complete benchmark (compared to the 0.5 AUC value obtained for random predictions). Furthermore, a new clustering analysis performed on the binding patches that are scattered on the protein surface show that their distribution and growth will depend on the protein's functional group. Finally, in several cases, the binding‐site predictions resulting from the cross‐docking simulations will lead to the identification of an alternate interface, which corresponds to the interaction with a biomolecular partner that is not included in the original benchmark. Proteins 2016; 84:1408–1421. © 2016 The Authors Proteins: Structure, Function, and Bioinformatics Published by Wiley Periodicals, Inc.     

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.Proteins 2012; © 2012 Wiley Periodicals, Inc.     

Predicting protein complex geometries with a neural network

A major challenge of the protein docking problem is to define scoring functions that can distinguish near‐native protein complex geometries from a large number of non‐native geometries (decoys) generated with noncomplexed protein structures (unbound docking). In this study, we have constructed a neural network that employs the information from atom‐pair distance distributions of a large number of decoys to predict protein complex geometries. We found that docking prediction can be significantly improved using two different types of polar hydrogen atoms. To train the neural network, 2000 near‐native decoys of even distance distribution were used for each of the 185 considered protein complexes. The neural network normalizes the information from different protein complexes using an additional protein complex identity input neuron for each complex. The parameters of the neural network were determined such that they mimic a scoring funnel in the neighborhood of the native complex structure. The neural network approach avoids the reference state problem, which occurs in deriving knowledge‐based energy functions for scoring. We show that a distance‐dependent atom pair potential performs much better than a simple atom‐pair contact potential. We have compared the performance of our scoring function with other empirical and knowledge‐based scoring functions such as ZDOCK 3.0, ZRANK, ITScore‐PP, EMPIRE, and RosettaDock. In spite of the simplicity of the method and its functional form, our neural network‐based scoring function achieves a reasonable performance in rigid‐body unbound docking of proteins. Proteins 2010. © 2009 Wiley‐Liss, Inc.     

Constraints imposed by non‐functional protein–protein interactions on gene expression and proteome size

Crowded intracellular environments present a challenge for proteins to form functional specific complexes while reducing non‐functional interactions with promiscuous non‐functional partners. Here we show how the need to minimize the waste of resources to non‐functional interactions limits the proteome diversity and the average concentration of co‐expressed and co‐localized proteins. Using the results of high‐throughput Yeast 2‐Hybrid experiments, we estimate the characteristic strength of non‐functional protein–protein interactions. By combining these data with the strengths of specific interactions, we assess the fraction of time proteins spend tied up in non‐functional interactions as a function of their overall concentration. This allows us to sketch the phase diagram for baker's yeast cells using the experimentally measured concentrations and subcellular localization of their proteins. The positions of yeast compartments on the phase diagram are consistent with our hypothesis that the yeast proteome has evolved to operate closely to the upper limit of its size, whereas keeping individual protein concentrations sufficiently low to reduce non‐functional interactions. These findings have implication for conceptual understanding of intracellular compartmentalization, multicellularity and differentiation.     

Application of docking methodologies to modeled proteins

Protein docking is essential for structural characterization of protein interactions. Besides providing the structure of protein complexes, modeling of proteins and their complexes is important for understanding the fundamental principles and specific aspects of protein interactions. The accuracy of protein modeling, in general, is still less than that of the experimental approaches. Thus, it is important to investigate the applicability of docking techniques to modeled proteins. We present new comprehensive benchmark sets of protein models for the development and validation of protein docking, as well as a systematic assessment of free and template-based docking techniques on these sets. As opposed to previous studies, the benchmark sets reflect the real case modeling/docking scenario where the accuracy of the models is assessed by the modeling procedure, without reference to the native structure (which would be unknown in practical applications). We also expanded the analysis to include docking of protein pairs where proteins have different structural accuracy. The results show that, in general, the template-based docking is less sensitive to the structural inaccuracies of the models than the free docking. The near-native docking poses generated by the template-based approach, typically, also have higher ranks than those produces by the free docking (although the free docking is indispensable in modeling the multiplicity of protein interactions in a crowded cellular environment). The results show that docking techniques are applicable to protein models in a broad range of modeling accuracy. The study provides clear guidelines for practical applications of docking to protein models.     

Tissue specificity and the human protein interaction network

A protein interaction network describes a set of physical associations that can occur between proteins. However, within any particular cell or tissue only a subset of proteins is expressed and so only a subset of interactions can occur. Integrating interaction and expression data, we analyze here this interplay between protein expression and physical interactions in humans. Proteins only expressed in restricted cell types, like recently evolved proteins, make few physical interactions. Most tissue‐specific proteins do, however, bind to universally expressed proteins, and so can function by recruiting or modifying core cellular processes. Conversely, most ‘housekeeping’ proteins that are expressed in all cells also make highly tissue‐specific protein interactions. These results suggest a model for the evolution of tissue‐specific biology, and show that most, and possibly all, ‘housekeeping’ proteins actually have important tissue‐specific molecular interactions.     

Integrating statistical pair potentials into protein complex prediction

The biophysical study of protein-protein interactions and docking has important implications in our understanding of most complex cellular signaling processes. Most computational approaches to protein docking involve a tradeoff between the level of detail incorporated into the model and computational power required to properly handle that level of detail. In this work, we seek to optimize that balance by showing that we can reduce the complexity of model representation and thus make the computation tractable with minimal loss of predictive performance. We also introduce a pair-wise statistical potential suitable for docking that builds on previous work and show that this potential can be incorporated into our fast fourier transform-based docking algorithm ZDOCK. We use the Protein Docking Benchmark to illustrate the improved performance of this potential compared with less detailed other scoring functions. Furthermore, we show that the new potential performs well on antibody-antigen complexes, with most predictions clustering around the Complementarity Determining Regions of antibodies without any manual intervention.