DOCKGROUND system of databases for protein recognition studies: unbound structures for docking

ComDock: A novel approach for protein-protein docking with an efficient fusing strategy

Protein-protein interaction plays an important role in studying the mechanism of protein functions from the structural perspective. Molecular docking is a powerful approach to detect protein-protein complexes using computational tools, due to the high cost and time-consuming of the traditional experimental methods. Among existing technologies, the template-based method utilizes the structural information of known homologous 3D complexes as available and reliable templates to achieve high accuracy and low computational complexity. However, the performance of the template-based method depends on the quality and quantity of templates. When insufficient or even no templates, the ab initio docking method is necessary and largely enriches the docking conformations. Therefore, it's a feasible strategy to fuse the effectivity of the template-based model and the universality of ab initio model to improve the docking performance. In this study, we construct a new, diverse, comprehensive template library derived from PDB, containing 77,685 complexes. We propose a template-based method (named TemDock), which retrieves the evolutionary relationship between the target sequence and samples in the template library and transfers similar structural information. Then, the target structure is built by superposing on the homologous template complex with TM-align. Moreover, we develop a consensus-based method (named ComDock) to integrate our TemDock and an existing ab initio method (ZDOCK). On 105 targets with templates from Benchmark 5.0, the TemDock and ComDock achieve a success rate of 68.57 % and 71.43 % in the top 10 conformations, respectively. Compared with the HDOCK, ComDock obtains better I-RMSD of hit configurations on 9 targets and more hit models in the top 100 conformations. As an efficient method for protein-protein docking, the ComDock is expected to study protein-protein recognition and reveal the various biological passways that are critical for developing drug discovery. The final results are stored at https://github.com/guofei-tju/mqz_ComDock_docking.

An expanded benchmark for antibody-antigen docking and affinity prediction reveals insights into antibody recognition determinants

Accurate predictive modeling of antibody-antigen complex structures and structure-based antibody design remain major challenges in computational biology, with implications for biotherapeutics, immunity, and vaccines. Through a systematic search for high-resolution structures of antibody-antigen complexes and unbound antibody and antigen structures, in conjunction with identification of experimentally determined binding affinities, we have assembled a non-redundant set of test cases for antibody-antigen docking and affinity prediction. This benchmark more than doubles the number of antibody-antigen complexes and corresponding affinities available in our previous benchmarks, providing an unprecedented view of the determinants of antibody recognition and insights into molecular flexibility. Initial assessments of docking and affinity prediction tools highlight the challenges posed by this diverse set of cases, which includes camelid nanobodies, therapeutic monoclonal antibodies, and broadly neutralizing antibodies targeting viral glycoproteins. This dataset will enable development of advanced predictive modeling and design methods for this therapeutically relevant class of protein-protein interactions.

Decoding Protein-protein Interactions: An Overview

Drug discovery has focused on the paradigm "one drug, one target" for a long time. However, small molecules can act at multiple macromolecular targets, which serves as the basis for drug repurposing. In an effort to expand the target space, and given advances in X-ray crystallography, protein-protein interactions have become an emerging focus area of drug discovery enterprises. Proteins interact with other biomolecules and it is this intricate network of interactions that determines the behavior of the system and its biological processes. In this review, we briefly discuss networks in disease, followed by computational methods for protein-protein complex prediction. Computational methodologies and techniques employed towards objectives such as protein-protein docking, protein-protein interactions, and interface predictions are described extensively. Docking aims at producing a complex between proteins, while interface predictions identify a subset of residues on one protein that could interact with a partner, and protein-protein interaction sites address whether two proteins interact. In addition, approaches to predict hot spots and binding sites are presented along with a representative example of our internal project on the chemokine CXC receptor 3 B-isoform and predictive modeling with IP10 and PF4.

Dockground Tool for Development and Benchmarking of Protein Docking Procedures

Databases of protein-protein complexes are essential for the development of protein modeling/docking techniques. Such databases provide a knowledge base for docking algorithms, intermolecular potentials, search procedures, scoring functions, and refinement protocols. Development of docking techniques requires systematic validation of the modeling protocols on carefully curated benchmark sets of complexes. We present a description and a guide to the DOCKGROUND resource ( http://dockground.compbio.ku.edu ) for structural modeling of protein interactions. The resource integrates various datasets of protein complexes and other data for the development and testing of protein docking techniques. The sets include bound complexes, experimentally determined unbound, simulated unbound, model-model complexes, and docking decoys. The datasets are available to the user community through a Web interface.

Soft regions of protein surface are potent for stable dimer formation

By having knowledge about the characteristics of protein interaction interfaces, we will be able to manipulate protein complexes for therapies. Dimer state is considered as the primary alphabet of the most proteins' quaternary structure. The properties of binding interface between subunits and of noninterface region define the specificity and stability of the intended protein complex. Considering some topological properties and amino acids' affinity for binding in interfaces of protein dimers, we construct the interface-specific recurrence plots. The data obtained from recurrence quantitative analysis, and accessibility-related metrics help us to classify the protein dimers into four distinct classes. Some mechanical properties of binding interfaces are computed for each predefined class of the dimers. The computed mechanical characteristics of binding patch region are compared with those of nonbinding region of proteins. Our observations indicate that the mechanical properties of protein binding sites have a decisive impact on determining the dimer stability. We introduce a new concept in analyzing protein structure by considering mechanical properties of protein structure. We conclude that the interface region between subunits of stable dimers is usually mechanically softer than the interface of unstable protein dimers. AbbreviationsAABaverage affinity for bindingANManisotropic network modelAPCaffinity propagation clusteringASAaccessible surface areaCCDinter residues distanceCSCcomplex stability codeDMdistance matrixΔG_dissPISA-computed dissociation free energyGNMGaussian normal mode analysisNMAnormal mode analysisPBPprotein binding patchPISAproteins, interfaces, structures and assembliesrASArelative accessible area in respect to unfolded state of residuesRMrecurrence matrixrPrelative protrusionRPrecurrence plotRQArecurrence quantitative analysisSEMstandard error of meanCommunicated by Ramaswamy H. Sarma.

Computational Feasibility of an Exhaustive Search of Side-Chain Conformations in Protein-Protein Docking

Protein-protein docking procedures typically perform the global scan of the proteins relative positions, followed by the local refinement of the putative matches. Because of the size of the search space, the global scan is usually implemented as rigid-body search, using computationally inexpensive intermolecular energy approximations. An adequate refinement has to take into account structural flexibility. Since the refinement performs conformational search of the interacting proteins, it is extremely computationally challenging, given the enormous amount of the internal degrees of freedom. Different approaches limit the search space by restricting the search to the side chains, rotameric states, coarse-grained structure representation, principal normal modes, and so on. Still, even with the approximations, the refinement presents an extreme computational challenge due to the very large number of the remaining degrees of freedom. Given the complexity of the search space, the advantage of the exhaustive search is obvious. The obstacle to such search is computational feasibility. However, the growing computational power of modern computers, especially due to the increasing utilization of Graphics Processing Unit (GPU) with large amount of specialized computing cores, extends the ranges of applicability of the brute-force search methods. This proof-of-concept study demonstrates computational feasibility of an exhaustive search of side-chain conformations in protein pocking. The procedure, implemented on the GPU architecture, was used to generate the optimal conformations in a large representative set of protein-protein complexes. © 2018 Wiley Periodicals, Inc.

ProPOSE: Direct Exhaustive Protein-Protein Docking with Side Chain Flexibility

Despite decades of development, protein-protein docking remains a largely unsolved problem. The main difficulties are the immense space spanned by the translational and rotational degrees of freedom and the prediction of the conformational changes of proteins upon binding. FFT is generally the preferred method to exhaustively explore the translation-rotation space at a fine grid resolution, albeit with the trade-off of approximating force fields with correlation functions. This work presents a direct search alternative that samples the states in Cartesian space at the same resolution and computational cost as standard FFT methods. Operating in real space allows the use of standard force field functional forms used in typical non-FFT methods as well as the implementation of strategies for focused exploration of conformational flexibility. Currently, a few misplaced side chains can cause docking programs to fail. This work specifically addresses the problem of side chain rearrangements upon complex formation. Based on the observation that most side chains retain their unbound conformation upon binding, each rigidly docked pose is initially scored ignoring up to a limited number of side chain overlaps which are resolved in subsequent repacking and minimization steps. On test systems where side chains are altered and backbones held in their bound state, this implementation provides significantly better native pose recovery and higher quality (lower RMSD) predictions when compared with five of the most popular docking programs. The method is implemented in the software program ProPOSE (Protein Pose Optimization by Systematic Enumeration).

Development of a new benchmark for assessing the scoring functions applicable to protein–protein interactions

Aim: Scoring functions are important component of protein–protein docking methods. They need to be evaluated on high-quality benchmarks to reveal their strengths and weaknesses. Evaluation results obtained on such benchmarks can provide valuable guidance for developing more advanced scoring functions. Methodology & results: In our comparative assessment of scoring functions for protein–protein interactions benchmark, the performance of a scoring function was characterized by ‘docking power’ and ‘scoring power’. A high-quality dataset of 273 protein–protein complexes was compiled and employed in both tests. Four scoring functions, including FASTCONTACT, ZRANK, dDFIRE and ATTRACT were tested as demonstration. ZRANK and ATTRACT exhibited encouraging performance in the docking power test. However, all four scoring functions failed badly in the scoring power test. Conclusion: Our comparative assessment of scoring functions for protein–protein interaction benchmark is created especially for assessing the scoring functions applicable to protein–protein interactions. It is different from other benchmarks for assessing protein–protein docking methods. Our benchmark is available to the public at www.pdbbind-cn.org/download/CASF-PPI/ .

Partner-Specific Prediction of Protein-Dimer Stability from Unbound Structure of Monomer

Protein complexes play deterministic roles in live entities in sensing, compiling, controlling, and responding to external and internal stimuli. Thermodynamic stability is an important property of protein complexes; having knowledge about complex stability helps us to understand the basics of protein assembly-related diseases and the mechanism of protein assembly clearly. Enormous protein-protein interactions, detected by high-throughput methods, necessitate finding fast methods for predicting the stability of protein assemblies in a quantitative and qualitative manner. The existing methods of predicting complex stability need knowledge about the three-dimensional (3D) structure of the intended protein complex. Here, we introduce a new method for predicting dissociation free energy of subunits by analyzing the structural and topological properties of a protein binding patch on a single subunit of the desired protein complex. The method needs the 3D structure of just one subunit and the information about the position of the intended binding site on the surface of that subunit to predict dimer stability in a classwise manner. The patterns of structural and topological properties of a protein binding patch are decoded by recurrence quantification analysis. Nonparametric discrimination is then utilized to predict the stability class of the intended dimer with accuracy greater than 85%.

Natural language processing in text mining for structural modeling of protein complexes

Background

Structural modeling of protein-protein interactions produces a large number of putative configurations of the protein complexes. Identification of the near-native models among them is a serious challenge. Publicly available results of biomedical research may provide constraints on the binding mode, which can be essential for the docking. Our text-mining (TM) tool, which extracts binding site residues from the PubMed abstracts, was successfully applied to protein docking (Badal et al., PLoS Comput Biol, 2015; 11: e1004630). Still, many extracted residues were not relevant to the docking.

Results

We present an extension of the TM tool, which utilizes natural language processing (NLP) for analyzing the context of the residue occurrence. The procedure was tested using generic and specialized dictionaries. The results showed that the keyword dictionaries designed for identification of protein interactions are not adequate for the TM prediction of the binding mode. However, our dictionary designed to distinguish keywords relevant to the protein binding sites led to considerable improvement in the TM performance. We investigated the utility of several methods of context analysis, based on dissection of the sentence parse trees. The machine learning-based NLP filtered the pool of the mined residues significantly more efficiently than the rule-based NLP. Constraints generated by NLP were tested in docking of unbound proteins from the DOCKGROUND X-ray benchmark set 4. The output of the global low-resolution docking scan was post-processed, separately, by constraints from the basic TM, constraints re-ranked by NLP, and the reference constraints. The quality of a match was assessed by the interface root-mean-square deviation. The results showed significant improvement of the docking output when using the constraints generated by the advanced TM with NLP.

Conclusions

The basic TM procedure for extracting protein-protein binding site residues from the PubMed abstracts was significantly advanced by the deep parsing (NLP techniques for contextual analysis) in purging of the initial pool of the extracted residues. Benchmarking showed a substantial increase of the docking success rate based on the constraints generated by the advanced TM with NLP.

Electronic supplementary material

The online version of this article (10.1186/s12859-018-2079-4) contains supplementary material, which is available to authorized users.

Dockground: A comprehensive data resource for modeling of protein complexes

Characterization of life processes at the molecular level requires structural details of protein interactions. The number of experimentally determined structures of protein-protein complexes accounts only for a fraction of known protein interactions. This gap in structural description of the interactome has to be bridged by modeling. An essential part of the development of structural modeling/docking techniques for protein interactions is databases of protein-protein complexes. They are necessary for studying protein interfaces, providing a knowledge base for docking algorithms, and developing intermolecular potentials, search procedures, and scoring functions. Development of protein-protein docking techniques requires thorough benchmarking of different parts of the docking protocols on carefully curated sets of protein-protein complexes. We present a comprehensive description of the Dockground resource (http://dockground.compbio.ku.edu) for structural modeling of protein interactions, including previously unpublished unbound docking benchmark set 4, and the X-ray docking decoy set 2. The resource offers a variety of interconnected datasets of protein-protein complexes and other data for the development and testing of different aspects of protein docking methodologies. Based on protein-protein complexes extracted from the PDB biounit files, Dockground offers sets of X-ray unbound, simulated unbound, model, and docking decoy structures. All datasets are freely available for download, as a whole or selecting specific structures, through a user-friendly interface on one integrated website.

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.

Challenges in structural approaches to cell modeling

Computational modeling is essential for structural characterization of biomolecular mechanisms across the broad spectrum of scales. Adequate understanding of biomolecular mechanisms inherently involves our ability to model them. Structural modeling of individual biomolecules and their interactions has been rapidly progressing. However, in terms of the broader picture, the focus is shifting toward larger systems, up to the level of a cell. Such modeling involves a more dynamic and realistic representation of the interactomes in vivo, in a crowded cellular environment, as well as membranes and membrane proteins, and other cellular components. Structural modeling of a cell complements computational approaches to cellular mechanisms based on differential equations, graph models, and other techniques to model biological networks, imaging data, etc. Structural modeling along with other computational and experimental approaches will provide a fundamental understanding of life at the molecular level and lead to important applications to biology and medicine. A cross section of diverse approaches presented in this review illustrates the developing shift from the structural modeling of individual molecules to that of cell biology. Studies in several related areas are covered: biological networks; automated construction of three-dimensional cell models using experimental data; modeling of protein complexes; prediction of non-specific and transient protein interactions; thermodynamic and kinetic effects of crowding; cellular membrane modeling; and modeling of chromosomes. The review presents an expert opinion on the current state-of-the-art in these various aspects of structural modeling in cellular biology, and the prospects of future developments in this emerging field.

SDRL: a sequence-dependent protein side-chain rotamer library

Since the introduction of the first protein side-chain rotamer library (RL) almost half a century ago, RLs have been components of many programs and algorithms in structural bioinformatics. Based on the dependence of side-chain dihedral angles on the local backbone, three types of RLs have been identified: backbone-independent, secondary-structure-dependent and backbone-dependent. In all previous studies, the effect of sequence specificity on side-chain conformational preferences was neglected. In the effort to develop a new class of RLs, we considered that the side-chain conformation of the central residue in each triplet on a protein backbone depends on the sequence of the triplet; therefore, we developed a sequence-dependent rotamer library (SDRL). To accomplish this, 400 possible triplet sequences for 18 natural amino acids as the central residue, which corresponds to 7200 triplet sequences in total, were considered. Searching the set of 11 546 selected PDB entries for the 7200 triplet sequences resulted in 2 364 541 instances occurring for 18 amino acids. Our results show that Leu and Val experience minimal impact from the adjacent residues in adopting side-chain conformations. Cys, Ile, Trp, His, Asp, Met, Glu, Gln, Arg and Lys, on the other hand, adopt their side-chain conformations mostly based on the adjacent residues on the backbone. The remaining residue types were moderately dependent on the adjacent residues. Using the new library, side-chain repacking algorithms can find preferred conformations of each residue more easily than with other backbone-independent RLs.

Text Mining for Protein Docking

The rapidly growing amount of publicly available information from biomedical research is readily accessible on the Internet, providing a powerful resource for predictive biomolecular modeling. The accumulated data on experimentally determined structures transformed structure prediction of proteins and protein complexes. Instead of exploring the enormous search space, predictive tools can simply proceed to the solution based on similarity to the existing, previously determined structures. A similar major paradigm shift is emerging due to the rapidly expanding amount of information, other than experimentally determined structures, which still can be used as constraints in biomolecular structure prediction. Automated text mining has been widely used in recreating protein interaction networks, as well as in detecting small ligand binding sites on protein structures. Combining and expanding these two well-developed areas of research, we applied the text mining to structural modeling of protein-protein complexes (protein docking). Protein docking can be significantly improved when constraints on the docking mode are available. We developed a procedure that retrieves published abstracts on a specific protein-protein interaction and extracts information relevant to docking. The procedure was assessed on protein complexes from Dockground (http://dockground.compbio.ku.edu). The results show that correct information on binding residues can be extracted for about half of the complexes. The amount of irrelevant information was reduced by conceptual analysis of a subset of the retrieved abstracts, based on the bag-of-words (features) approach. Support Vector Machine models were trained and validated on the subset. The remaining abstracts were filtered by the best-performing models, which decreased the irrelevant information for ~ 25% complexes in the dataset. The extracted constraints were incorporated in the docking protocol and tested on the Dockground unbound benchmark set, significantly increasing the docking success rate.

Protein interactions are central for many cellular processes. Physical characterization of these interactions is essential for understanding of life processes and applications in biology and medicine. Because of the inherent limitations of experimental techniques and rapid development of computational power and methodology, computer modeling is a tool of choice in many studies. Publicly available information from biomedical research is readily accessible on the Internet, providing a powerful resource for modeling of proteins and protein complexes. A major paradigm shift in modeling of protein complexes is emerging due to the rapidly expanding amount of such information, which can be used as modeling constraints. Text mining has been widely used in recreating networks of protein interactions, as well as in detecting small molecule binding sites on proteins. Combining and expanding these two well-developed areas of research, we applied the text mining to physical modeling of protein complexes (protein docking). Our procedure retrieves published abstracts on a protein-protein interaction and extracts the relevant information. The results show that correct information on binding can be obtained for about half of protein complexes. The extracted constraints were incorporated in a modeling procedure, significantly improving its performance.

Simulated unbound structures for benchmarking of protein docking in the DOCKGROUND resource

Background

Proteins play an important role in biological processes in living organisms. Many protein functions are based on interaction with other proteins. The structural information is important for adequate description of these interactions. Sets of protein structures determined in both bound and unbound states are essential for benchmarking of the docking procedures. However, the number of such proteins in PDB is relatively small. A radical expansion of such sets is possible if the unbound structures are computationally simulated.

Results

The Dockground public resource provides data to improve our understanding of protein–protein interactions and to assist in the development of better tools for structural modeling of protein complexes, such as docking algorithms and scoring functions. A large set of simulated unbound protein structures was generated from the bound structures. The modeling protocol was based on 1 ns Langevin dynamics simulation. The simulated structures were validated on the ensemble of experimentally determined unbound and bound structures. The set is intended for large scale benchmarking of docking algorithms and scoring functions.

Conclusions

A radical expansion of the unbound protein docking benchmark set was achieved by simulating the unbound structures. The simulated unbound structures were selected according to criteria from systematic comparison of experimentally determined bound and unbound structures. The set is publicly available at http://dockground.compbio.ku.edu.

Protein-protein docking: from interaction to interactome

The protein-protein docking problem is one of the focal points of activity in computational biophysics and structural biology. The three-dimensional structure of a protein-protein complex, generally, is more difficult to determine experimentally than the structure of an individual protein. Adequate computational techniques to model protein interactions are important because of the growing number of known protein structures, particularly in the context of structural genomics. Docking offers tools for fundamental studies of protein interactions and provides a structural basis for drug design. Protein-protein docking is the prediction of the structure of the complex, given the structures of the individual proteins. In the heart of the docking methodology is the notion of steric and physicochemical complementarity at the protein-protein interface. Originally, mostly high-resolution, experimentally determined (primarily by x-ray crystallography) protein structures were considered for docking. However, more recently, the focus has been shifting toward lower-resolution modeled structures. Docking approaches have to deal with the conformational changes between unbound and bound structures, as well as the inaccuracies of the interacting modeled structures, often in a high-throughput mode needed for modeling of large networks of protein interactions. The growing number of docking developers is engaged in the community-wide assessments of predictive methodologies. The development of more powerful and adequate docking approaches is facilitated by rapidly expanding information and data resources, growing computational capabilities, and a deeper understanding of the fundamental principles of protein interactions.

Protein models docking benchmark 2

Structural characterization of protein-protein interactions is essential for our ability to understand life processes. However, only a fraction of known proteins have experimentally determined structures. Such structures provide templates for modeling of a large part of the proteome, where individual proteins can be docked by template-free or template-based techniques. Still, the sensitivity of the docking methods to the inherent inaccuracies of protein models, as opposed to the experimentally determined high-resolution structures, remains largely untested, primarily due to the absence of appropriate benchmark set(s). Structures in such a set should have predefined inaccuracy levels and, at the same time, resemble actual protein models in terms of structural motifs/packing. The set should also be large enough to ensure statistical reliability of the benchmarking results. We present a major update of the previously developed benchmark set of protein models. For each interactor, six models were generated with the model-to-native C(α) RMSD in the 1 to 6 Å range. The models in the set were generated by a new approach, which corresponds to the actual modeling of new protein structures in the "real case scenario," as opposed to the previous set, where a significant number of structures were model-like only. In addition, the larger number of complexes (165 vs. 63 in the previous set) increases the statistical reliability of the benchmarking. We estimated the highest accuracy of the predicted complexes (according to CAPRI criteria), which can be attained using the benchmark structures. The set is available at http://dockground.bioinformatics.ku.edu.

Fractal Dimensions of Macromolecular Structures

Quantifying the properties of macromolecules is a prerequisite for understanding their roles in biochemical processes. One of the less-explored geometric features of macromolecules is molecular surface irregularity, or 'roughness', which can be measured in terms of fractal dimension (D). In this study, we demonstrate that surface roughness correlates with ligand binding potential. We quantified the surface roughnesses of biological macromolecules in a large-scale survey that revealed D values between 2.0 and 2.4. The results of our study imply that surface patches involved in molecular interactions, such as ligand-binding pockets and protein-protein interfaces, exhibit greater local fluctuations in their fractal dimensions than 'inert' surface areas. We expect approximately 22 % of a protein's surface outside of the crystallographically known ligand binding sites to be ligandable. These findings provide a fresh perspective on macromolecular structure and have considerable implications for drug design as well as chemical and systems biology.

Protein models: the Grand Challenge of protein docking

Characterization of life processes at the molecular level requires structural details of protein-protein interactions (PPIs). The number of experimentally determined protein structures accounts only for a fraction of known proteins. This gap has to be bridged by modeling, typically using experimentally determined structures as templates to model related proteins. The fraction of experimentally determined PPI structures is even smaller than that for the individual proteins, due to a larger number of interactions than the number of individual proteins, and a greater difficulty of crystallizing protein-protein complexes. The approaches to structural modeling of PPI (docking) often have to rely on modeled structures of the interactors, especially in the case of large PPI networks. Structures of modeled proteins are typically less accurate than the ones determined by X-ray crystallography or nuclear magnetic resonance. Thus the utility of approaches to dock these structures should be assessed by thorough benchmarking, specifically designed for protein models. To be credible, such benchmarking has to be based on carefully curated sets of structures with levels of distortion typical for modeled proteins. This article presents such a suite of models built for the benchmark set of the X-ray structures from the Dockground resource (http://dockground.bioinformatics.ku.edu) by a combination of homology modeling and Nudged Elastic Band method. For each monomer, six models were generated with predefined C(α) root mean square deviation from the native structure (1, 2, …, 6 Å). The sets and the accompanying data provide a comprehensive resource for the development of docking methodology for modeled proteins.

Replica exchange improves sampling in low-resolution docking stage of RosettaDock

Many protein-protein docking protocols are based on a shotgun approach, in which thousands of independent random-start trajectories minimize the rigid-body degrees of freedom. Another strategy is enumerative sampling as used in ZDOCK. Here, we introduce an alternative strategy, ReplicaDock, using a small number of long trajectories of temperature replica exchange. We compare replica exchange sampling as low-resolution stage of RosettaDock with RosettaDock's original shotgun sampling as well as with ZDOCK. A benchmark of 30 complexes starting from structures of the unbound binding partners shows improved performance for ReplicaDock and ZDOCK when compared to shotgun sampling at equal or less computational expense. ReplicaDock and ZDOCK consistently reach lower energies and generate significantly more near-native conformations than shotgun sampling. Accordingly, they both improve typical metrics of prediction quality of complex structures after refinement. Additionally, the refined ReplicaDock ensembles reach significantly lower interface energies and many previously hidden features of the docking energy landscape become visible when ReplicaDock is applied.

An information-theoretic classification of amino acids for the assessment of interfaces in protein-protein docking

Docking represents a versatile and powerful method to predict the geometry of protein-protein complexes. However, despite significant methodical advances, the identification of good docking solutions among a large number of false solutions still remains a difficult task. We have previously demonstrated that the formalism of mutual information (MI) from information theory can be adapted to protein docking, and we have now extended this approach to enhance its robustness and applicability. A large dataset consisting of 22,934 docking decoys derived from 203 different protein-protein complexes was used for an MI-based optimization of reduced amino acid alphabets representing the protein-protein interfaces. This optimization relied on a clustering analysis that allows one to estimate the mutual information of whole amino acid alphabets by considering all structural features simultaneously, rather than by treating them individually. This clustering approach is fast and can be applied in a similar fashion to the generation of reduced alphabets for other biological problems like fold recognition, sequence data mining, or secondary structure prediction. The reduced alphabets derived from the present work were converted into a scoring function for the evaluation of docking solutions, which is available for public use via the web service score-MI: http://score-MI.biochem.uni-erlangen.de.

Protein-protein alternative binding modes do not overlap

Proteins often bind other proteins in more than one way. Thus alternative binding modes is an essential feature of protein interactions. Such binding modes may be detected by X-ray crystallography and thus reflected in Protein Data Bank. The alternative binding is often observed not for the protein itself but for its structural homolog. The results of this study based on the analysis of a comprehensive set of co-crystallized protein-protein complexes show that the alternative binding modes generally do not overlap, but are spatially separated. This effect is based on molecular recognition characteristics of the protein structures. The results are also in excellent agreement with the intermolecular energy funnel size estimates obtained previously by an independent methodology. The results provide an important insight into the principles of protein association, as well as potential guidelines for modeling of protein complexes and the design of protein interfaces.

Ensemble-based characterization of unbound and bound states on protein energy landscape

Physicochemical description of numerous cell processes is fundamentally based on the energy landscapes of protein molecules involved. Although the whole energy landscape is difficult to reconstruct, increased attention to particular targets has provided enough structures for mapping functionally important subspaces associated with the unbound and bound protein structures. The subspace mapping produces a discrete representation of the landscape, further called energy spectrum. We compiled and characterized ensembles of bound and unbound conformations of six small proteins and explored their spectra in implicit solvent. First, the analysis of the unbound-to-bound changes points to conformational selection as the binding mechanism for four proteins. Second, results show that bound and unbound spectra often significantly overlap. Moreover, the larger the overlap the smaller the root mean square deviation (RMSD) between the bound and unbound conformational ensembles. Third, the center of the unbound spectrum has a higher energy than the center of the corresponding bound spectrum of the dimeric and multimeric states for most of the proteins. This suggests that the unbound states often have larger entropy than the bound states. Fourth, the exhaustively long minimization, making small intrarotamer adjustments (all-atom RMSD ≤ 0.7 Å), dramatically reduces the distance between the centers of the bound and unbound spectra as well as the spectra extent. It condenses unbound and bound energy levels into a thin layer at the bottom of the energy landscape with the energy spacing that varies between 0.8-4.6 and 3.5-10.5 kcal/mol for the unbound and bound states correspondingly. Finally, the analysis of protein energy fluctuations showed that protein vibrations itself can excite the interstate transitions, including the unbound-to-bound ones.

Low-resolution structural modeling of protein interactome

Structural characterization of protein-protein interactions across the broad spectrum of scales is key to our understanding of life at the molecular level. Low-resolution approach to protein interactions is needed for modeling large interaction networks, given the significant level of uncertainties in large biomolecular systems and the high-throughput nature of the task. Since only a fraction of protein structures in interactome are determined experimentally, protein docking approaches are increasingly focusing on modeled proteins. Current rapid advancement of template-based modeling of protein-protein complexes is following a long standing trend in structure prediction of individual proteins. Protein-protein templates are already available for almost all interactions of structurally characterized proteins, and about one third of such templates are likely correct.

Structure fluctuations and conformational changes in protein binding

Structure fluctuations and conformational changes accompany all biological processes involving macromolecules. The paper presents a classification of protein residues based on the normalized equilibrium fluctuations of the residue centers of mass in proteins and a statistical analysis of conformation changes in the side-chains upon binding. Normal mode analysis and an elastic network model were applied to a set of protein complexes to calculate the residue fluctuations and develop the residue classification. Comparison with a classification based on normalized B-factors suggests that the B-factors may underestimate protein flexibility in solvent. Our classification shows that protein loops and disordered fragments are enriched with highly fluctuating residues and depleted with weakly fluctuating residues. Strategies for engineering thermostable proteins are discussed. To calculate the dihedral angles distribution functions, the configuration space was divided into cells by a cubic grid. The effect of protein association on the distribution functions depends on the amino acid type and a grid step in the dihedral angles space. The changes in the dihedral angles increase from the near-backbone dihedral angle to the most distant one, for most residues. On average, one fifth of the interface residues change the rotamer state upon binding, whereas the rest of the interface residues undergo local readjustments within the same rotamer.

A nonredundant structure dataset for benchmarking protein-RNA computational docking

Protein-RNA interactions play an important role in many biological processes. The ability to predict the molecular structures of protein-RNA complexes from docking would be valuable for understanding the underlying chemical mechanisms. We have developed a novel nonredundant benchmark dataset for protein-RNA docking and scoring. The diverse dataset of 72 targets consists of 52 unbound-unbound test complexes, and 20 unbound-bound test complexes. Here, unbound-unbound complexes refer to cases in which both binding partners of the cocrystallized complex are either in apo form or in a conformation taken from a different protein-RNA complex, whereas unbound-bound complexes are cases in which only one of the two binding partners has another experimentally determined conformation. The dataset is classified into three categories according to the interface root mean square deviation and the percentage of native contacts in the unbound structures: 49 easy, 16 medium, and 7 difficult targets. The bound and unbound cases of the benchmark dataset are expected to benefit the development and improvement of docking and scoring algorithms for the docking community. All the easy-to-view structures are freely available to the public at http://zoulab.dalton.missouri.edu/RNAbenchmark/.

Correlation analysis of the side-chains conformational distribution in bound and unbound proteins

BACKGROUND

Protein interactions play a key role in life processes. Characterization of conformational properties of protein-protein interactions is important for understanding the mechanisms of protein association. The rapidly increasing amount of experimentally determined structures of proteins and protein-protein complexes provides foundation for research on protein interactions and complex formation. The knowledge of the conformations of the surface side chains is essential for modeling of protein complexes. The purpose of this study was to analyze and compare dihedral angle distribution functions of the side chains at the interface and non-interface areas in bound and unbound proteins.

RESULTS

To calculate the dihedral angle distribution functions, the configuration space was divided into grid cells. Statistical analysis showed that the similarity between bound and unbound interface and non-interface surface depends on the amino acid type and the grid resolution. The correlation coefficients between the distribution functions increased with the grid spacing increase for all amino acid types. The Manhattan distance showing the degree of dissimilarity between the distribution functions decreased accordingly. Short residues with one or two dihedral angles had higher correlations and smaller Manhattan distances than the longer residues. Met and Arg had the slowest growth of the correlation coefficient with the grid spacing increase. The correlations between the interface and non-interface distribution functions had a similar dependence on the grid resolution in both bound and unbound states. The interface and non-interface differences between bound and unbound distribution functions, caused by biological protein-protein interactions or crystal contacts, disappeared at the 70° grid spacing for interfaces and 30° for non-interface surface, which agrees with an average span of the side-chain rotamers.

CONCLUSIONS

The two-fold difference in the critical grid spacing indicates larger conformational changes upon binding at the interface than at the rest of the surface. At the same time, transitions between rotamers induced by interactions across the interface or the crystal packing are rare, with most side chains having local readjustments that do not change the rotameric state. The analysis is important for better understanding of protein interactions and development of flexible docking approaches.

Biophysical and computational fragment-based approaches to targeting protein-protein interactions: applications in structure-guided drug discovery

Drug discovery has classically targeted the active sites of enzymes or ligand-binding sites of receptors and ion channels. In an attempt to improve selectivity of drug candidates, modulation of protein-protein interfaces (PPIs) of multiprotein complexes that mediate conformation or colocation of components of cell-regulatory pathways has become a focus of interest. However, PPIs in multiprotein systems continue to pose significant challenges, as they are generally large, flat and poor in distinguishing features, making the design of small molecule antagonists a difficult task. Nevertheless, encouragement has come from the recognition that a few amino acids - so-called hotspots - may contribute the majority of interaction-free energy. The challenges posed by protein-protein interactions have led to a wellspring of creative approaches, including proteomimetics, stapled α-helical peptides and a plethora of antibody inspired molecular designs. Here, we review a more generic approach: fragment-based drug discovery. Fragments allow novel areas of chemical space to be explored more efficiently, but the initial hits have low affinity. This means that they will not normally disrupt PPIs, unless they are tethered, an approach that has been pioneered by Wells and co-workers. An alternative fragment-based approach is to stabilise the uncomplexed components of the multiprotein system in solution and employ conventional fragment-based screening. Here, we describe the current knowledge of the structures and properties of protein-protein interactions and the small molecules that can modulate them. We then describe the use of sensitive biophysical methods - nuclear magnetic resonance, X-ray crystallography, surface plasmon resonance, differential scanning fluorimetry or isothermal calorimetry - to screen and validate fragment binding. Fragment hits can subsequently be evolved into larger molecules with higher affinity and potency. These may provide new leads for drug candidates that target protein-protein interactions and have therapeutic value.

Rotamer libraries and probabilities of transition between rotamers for the side chains in protein-protein binding

Conformational changes in the side chains are essential for protein-protein binding. Rotameric states and unbound- to-bound conformational changes in the surface residues were systematically studied on a representative set of protein complexes. The side-chain conformations were mapped onto dihedral angles space. The variable threshold algorithm was developed to cluster the dihedral angle distributions and to derive rotamers, defined as the most probable conformation in a cluster. Six rotamer libraries were generated: full surface, surface noninterface, and surface interface-each for bound and unbound states. The libraries were used to calculate the probabilities of the rotamer transitions upon binding. The stability of amino acids was quantified based on the transition maps. The noninterface residues' stability was higher than that of the interface. Long side chains with three or four dihedral angles were less stable than the shorter ones. The transitions between the rotamers at the interface occurred more frequently than on the noninterface surface. Most side chains changed conformation within the same rotamer or moved to an adjacent rotamer. The highest percentage of the transitions was observed primarily between the two most occupied rotamers. The probability of the transition between rotamers increased with the decrease of the rotamer stability. The analysis revealed characteristics of the surface side-chain conformational transitions that can be utilized in flexible docking protocols.

Templates are available to model nearly all complexes of structurally characterized proteins

Traditional approaches to protein-protein docking sample the binding modes with no regard to similar experimentally determined structures (templates) of protein-protein complexes. Emerging template-based docking approaches utilize such similar complexes to determine the docking predictions. The docking problem assumes the knowledge of the participating proteins' structures. Thus, it provides the possibility of aligning the structures of the proteins and the template complexes. The progress in the development of template-based docking and the vast experience in template-based modeling of individual proteins show that, generally, such approaches are more reliable than the free modeling. The key aspect of this modeling paradigm is the availability of the templates. The current common perception is that due to the difficulties in experimental structure determination of protein-protein complexes, the pool of docking templates is insignificant, and thus a broad application of template-based docking is possible only at some future time. The results of our large scale, systematic study show that, surprisingly, in spite of the limited number of protein-protein complexes in the Protein Data Bank, docking templates can be found for complexes representing almost all the known protein-protein interactions, provided the components themselves have a known structure or can be homology-built. About one-third of the templates are of good quality when they are compared to experimental structures in test sets extracted from the Protein Data Bank and would be useful starting points in modeling the complexes. This finding dramatically expands our ability to model protein interactions, and has far-reaching implications for the protein docking field in general.

Protein docking by the interface structure similarity: how much structure is needed?

The increasing availability of co-crystallized protein-protein complexes provides an opportunity to use template-based modeling for protein-protein docking. Structure alignment techniques are useful in detection of remote target-template similarities. The size of the structure involved in the alignment is important for the success in modeling. This paper describes a systematic large-scale study to find the optimal definition/size of the interfaces for the structure alignment-based docking applications. The results showed that structural areas corresponding to the cutoff values <12 Å across the interface inadequately represent structural details of the interfaces. With the increase of the cutoff beyond 12 Å, the success rate for the benchmark set of 99 protein complexes, did not increase significantly for higher accuracy models, and decreased for lower-accuracy models. The 12 Å cutoff was optimal in our interface alignment-based docking, and a likely best choice for the large-scale (e.g., on the scale of the entire genome) applications to protein interaction networks. The results provide guidelines for the docking approaches, including high-throughput applications to modeled structures.

Comprehensive, atomic-level characterization of structurally characterized protein-protein interactions: the PICCOLO database

Background

Structural studies are increasingly providing huge amounts of information on multi-protein assemblies. Although a complete understanding of cellular processes will be dependent on an explicit characterization of the intermolecular interactions that underlie these assemblies and mediate molecular recognition, these are not well described by standard representations.

Results

Here we present PICCOLO, a comprehensive relational database capturing the details of structurally characterized protein-protein interactions. Interactions are described at the level of interacting pairs of atoms, residues and polypeptide chains, with the physico-chemical nature of the interactions being characterized. Distance and angle terms are used to distinguish 12 different interaction types, including van der Waals contacts, hydrogen bonds and hydrophobic contacts. The explicit aim of PICCOLO is to underpin large-scale analyses of the properties of protein-protein interfaces. This is exemplified by an analysis of residue propensity and interface contact preferences derived from a much larger data set than previously reported. However, PICCOLO also supports detailed inspection of particular systems of interest.

Conclusions

The current PICCOLO database comprises more than 260 million interacting atom pairs from 38,202 protein complexes. A web interface for the database is available at http://www-cryst.bioc.cam.ac.uk/piccolo.

Application of information theory to feature selection in protein docking

In the era of structural genomics, the prediction of protein interactions using docking algorithms is an important goal. The success of this method critically relies on the identification of good docking solutions among a vast excess of false solutions. We have adapted the concept of mutual information (MI) from information theory to achieve a fast and quantitative screening of different structural features with respect to their ability to discriminate between physiological and nonphysiological protein interfaces. The strategy includes the discretization of each structural feature into distinct value ranges to optimize its mutual information. We have selected 11 structural features and two datasets to demonstrate that the MI is dimensionless and can be directly compared for diverse structural features and between datasets of different sizes. Conversion of the MI values into a simple scoring function revealed that those features with a higher MI are actually more powerful for the identification of good docking solutions. Thus, an MI-based approach allows the rapid screening of structural features with respect to their information content and should therefore be helpful for the design of improved scoring functions in future. In addition, the concept presented here may also be adapted to related areas that require feature selection for biomolecules or organic ligands.

DECK: Distance and environment-dependent, coarse-grained, knowledge-based potentials for protein-protein docking

Background

Computational approaches to protein-protein docking typically include scoring aimed at improving the rank of the near-native structure relative to the false-positive matches. Knowledge-based potentials improve modeling of protein complexes by taking advantage of the rapidly increasing amount of experimentally derived information on protein-protein association. An essential element of knowledge-based potentials is defining the reference state for an optimal description of the residue-residue (or atom-atom) pairs in the non-interaction state.

Results

The study presents a new Distance- and Environment-dependent, Coarse-grained, Knowledge-based (DECK) potential for scoring of protein-protein docking predictions. Training sets of protein-protein matches were generated based on bound and unbound forms of proteins taken from the DOCKGROUND resource. Each residue was represented by a pseudo-atom in the geometric center of the side chain. To capture the long-range and the multi-body interactions, residues in different secondary structure elements at protein-protein interfaces were considered as different residue types. Five reference states for the potentials were defined and tested. The optimal reference state was selected and the cutoff effect on the distance-dependent potentials investigated. The potentials were validated on the docking decoys sets, showing better performance than the existing potentials used in scoring of protein-protein docking results.

Conclusions

A novel residue-based statistical potential for protein-protein docking was developed and validated on docking decoy sets. The results show that the scoring function DECK can successfully identify near-native protein-protein matches and thus is useful in protein docking. In addition to the practical application of the potentials, the study provides insights into the relative utility of the reference states, the scope of the distance dependence, and the coarse-graining of the potentials.

Docking by structural similarity at protein-protein interfaces

Rapid accumulation of experimental data on protein-protein complexes drives the paradigm shift in protein docking from "traditional," template free approaches to template based techniques. Homology docking algorithms based on sequence similarity between target and template complexes can account for up to 20% of known protein-protein interactions. When highly homologous templates for the target complex are not available, but the structure of the target monomers is known, docking by local structural alignment may provide an adequate solution. Such an algorithm was developed based on the structural comparison of monomers to cocrystallized interfaces. A library of the interfaces was generated from cocrystallized protein-protein complexes in PDB. The partial structure alignment algorithm was validated on the DOCKGROUND benchmark sets. The optimal performance of the partial (interface) structure alignment was achieved with the interface residues defined by 12 Å distance across the interface. Overall, the partial structure alignment yielded more accurate models than the full structure alignment. Most templates identified by the partial structure alignment had low sequence identity to the target, which makes them hard to detect by sequence-based methods. The results indicate that the structure alignment techniques provide a much needed addition to the docking arsenal, with the combined structure alignment and template free docking success rate significantly surpassing that of the free docking alone.

Optimization of pyDock for the new CAPRI challenges: Docking of homology-based models, domain-domain assembly and protein-RNA binding

We describe here our results in the last CAPRI edition. We have participated in all targets, both as predictors and as scorers, using our pyDock docking methodology. The new challenges (homology-based modeling of the interacting subunits, domain-domain assembling, and protein-RNA interactions) have pushed our computer tools to the limits and have encouraged us to devise new docking approaches. Overall, the results have been quite successful, in line with previous editions, especially considering the high difficulty of some of the targets. Our docking approaches succeeded in five targets as predictors or as scorers (T29, T34, T35, T41, and T42). Moreover, with the inclusion of available information on the residues expected to be involved in the interaction, our protocol would have also succeeded in two additional cases (T32 and T40). In the remaining targets (except T37), results were equally poor for most of the groups. We submitted the best model (in ligand RMSD) among scorers for the unbound-bound target T29, the second best model among scorers for the protein-RNA target T34, and the only correct model among predictors for the domain assembly target T35. In summary, our excellent results for the new proposed challenges in this CAPRI edition showed the limitations and applicability of our approaches and encouraged us to continue developing methodologies for automated biomolecular docking.

Side-chain conformational changes upon Protein-Protein Association

Conformational changes upon protein-protein association are the key element of the binding mechanism. The study presents a systematic large-scale analysis of such conformational changes in the side chains. The results indicate that short and long side chains have different propensities for the conformational changes. Long side chains with three or more dihedral angles are often subject to large conformational transition. Shorter residues with one or two dihedral angles typically undergo local conformational changes not leading to a conformational transition. A relationship between the local readjustments and the equilibrium fluctuations of a side chain around its unbound conformation is suggested. Most of the side chains undergo larger changes in the dihedral angle most distant from the backbone. The frequencies of the core-to-surface interface transitions of six nonpolar residues and Tyr are larger than the frequencies of the opposite surface-to-core transitions. The binding increases both polar and nonpolar interface areas. However, the increase of the nonpolar area is larger for all considered classes of protein complexes, suggesting that the protein association perturbs the unbound interfaces to increase the hydrophobic contribution to the binding free energy. To test modeling approaches to side-chain flexibility in protein docking, conformational changes in the X-ray set were compared with those in the docking decoy sets. The results lead to a better understanding of the conformational changes in proteins and suggest directions for efficient conformational sampling in docking protocols.

Protein-protein docking benchmark version 4.0

We updated our protein-protein docking benchmark to include complexes that became available since our previous release. As before, we only considered high-resolution complex structures that are nonredundant at the family-family pair level, for which the X-ray or NMR unbound structures of the constituent proteins are also available. Benchmark 4.0 adds 52 new complexes to the 124 cases of Benchmark 3.0, representing an increase of 42%. Thus, benchmark 4.0 provides 176 unbound-unbound cases that can be used for protein-protein docking method development and assessment. Seventeen of the newly added cases are enzyme-inhibitor complexes, and we found no new antigen-antibody complexes. Classifying the new cases according to expected difficulty for protein-protein docking algorithms gives 33 rigid body cases, 11 cases of medium difficulty, and 8 cases that are difficult. Benchmark 4.0 listings and processed structure files are publicly accessible at http://zlab.umassmed.edu/benchmark/.

Sequence composition and environment effects on residue fluctuations in protein structures

Structure fluctuations in proteins affect a broad range of cell phenomena, including stability of proteins and their fragments, allosteric transitions, and energy transfer. This study presents a statistical-thermodynamic analysis of relationship between the sequence composition and the distribution of residue fluctuations in protein-protein complexes. A one-node-per-residue elastic network model accounting for the nonhomogeneous protein mass distribution and the interatomic interactions through the renormalized inter-residue potential is developed. Two factors, a protein mass distribution and a residue environment, were found to determine the scale of residue fluctuations. Surface residues undergo larger fluctuations than core residues in agreement with experimental observations. Ranking residues over the normalized scale of fluctuations yields a distinct classification of amino acids into three groups: (i) highly fluctuating-Gly, Ala, Ser, Pro, and Asp, (ii) moderately fluctuating-Thr, Asn, Gln, Lys, Glu, Arg, Val, and Cys, and (iii) weakly fluctuating-Ile, Leu, Met, Phe, Tyr, Trp, and His. The structural instability in proteins possibly relates to the high content of the highly fluctuating residues and a deficiency of the weakly fluctuating residues in irregular secondary structure elements (loops), chameleon sequences, and disordered proteins. Strong correlation between residue fluctuations and the sequence composition of protein loops supports this hypothesis. Comparing fluctuations of binding site residues (interface residues) with other surface residues shows that, on average, the interface is more rigid than the rest of the protein surface and Gly, Ala, Ser, Cys, Leu, and Trp have a propensity to form more stable docking patches on the interface. The findings have broad implications for understanding mechanisms of protein association and stability of protein structures.

Protein-protein docking by shape-complementarity and property matching

We present a computational approach to protein-protein docking based on surface shape complementarity ("ProBinder"). Within this docking approach, we implemented a new surface decomposition method that considers local shape features on the protein surface. This new surface shape decomposition results in a deterministic representation of curvature features on the protein surface, such as "knobs," "holes," and "flats" together with their point normals. For the actual docking procedure, we used geometric hashing, which allows for the rapid, translation-, and rotation-free comparison of point coordinates. Candidate solutions were scored based on knowledge-based potentials and steric criteria. The potentials included electrostatic complementarity, desolvation energy, amino acid contact preferences, and a van-der-Waals potential. We applied ProBinder to a diverse test set of 68 bound and 30 unbound test cases compiled from the Dockground database. Sixty-four percent of the protein-protein test complexes were ranked with an root mean square deviation (RMSD) < 5 A to the target solution among the top 10 predictions for the bound data set. In 82% of the unbound samples, docking poses were ranked within the top ten solutions with an RMSD < 10 A to the target solution.

Hydrophilicity matching - a potential prerequisite for the formation of protein-protein complexes in the cell

A binding event between two proteins typically consists of a diffusional search of binding partners for one another, followed by a specific recognition of the compatible binding sites resulting in the formation of the complex. However, it is unclear how binding partners find each other in the context of the crowded, constantly fluctuating, and interaction-rich cellular environment. Here we examine the non-specific component of protein-protein interactions, which refers to those physicochemical properties of the binding partners that are independent of the exact details of their binding sites, but which can affect their localization or diffusional search for one another. We show that, for a large set of high-resolution experimental 3D structures of binary, transient protein complexes taken from the DOCKGROUND database, the binding partners display a surprising, statistically significant similarity in terms of their total hydration free energies normalized by a size-dependent variable. We hypothesize that colocalization of binding partners, even within individual cellular compartments such as the cytoplasm, may be influenced by their relative hydrophilicity, potentially in response to local hydrophilic gradients.

Accuracy of protein-protein binding sites in high-throughput template-based modeling

The accuracy of protein structures, particularly their binding sites, is essential for the success of modeling protein complexes. Computationally inexpensive methodology is required for genome-wide modeling of such structures. For systematic evaluation of potential accuracy in high-throughput modeling of binding sites, a statistical analysis of target-template sequence alignments was performed for a representative set of protein complexes. For most of the complexes, alignments containing all residues of the interface were found. The full interface alignments were obtained even in the case of poor alignments where a relatively small part of the target sequence (as low as 40%) aligned to the template sequence, with a low overall alignment identity (<30%). Although such poor overall alignments might be considered inadequate for modeling of whole proteins, the alignment of the interfaces was strong enough for docking. In the set of homology models built on these alignments, one third of those ranked 1 by a simple sequence identity criteria had RMSD<5 Å, the accuracy suitable for low-resolution template free docking. Such models corresponded to multi-domain target proteins, whereas for single-domain proteins the best models had 5 Å<RMSD<10 Å, the accuracy suitable for less sensitive structure-alignment methods. Overall, ∼50% of complexes with the interfaces modeled by high-throughput techniques had accuracy suitable for meaningful docking experiments. This percentage will grow with the increasing availability of co-crystallized protein-protein complexes.

Protein-protein interactions play a central role in life processes at the molecular level. The structural information on these interactions is essential for our understanding of these processes and our ability to design drugs to cure diseases. Limitations of experimental techniques to determine the structure of protein-protein complexes leave the vast majority of these complexes to be determined by computational modeling. The modeling is also important for revealing the mechanisms of the complex formation. The 3D modeling of protein complexes (protein docking) relies on the structure of the individual proteins for the prediction of their assembly. Thus the structural accuracy of the individual proteins, which often are models themselves, is critical for the docking. For the docking purposes, the accuracy of the binding sites is obviously essential, whereas the accuracy of the non-binding regions is less critical. In our study, we systematically analyze the accuracy of the binding sites in protein models produced by high-throughput techniques suitable for large-scale (e.g., genome-wide) studies. The results indicate that this accuracy is adequate for the low- to medium-resolution docking of a significant part of known protein-protein complexes.