Protein-protein docking: from interaction to interactome

Computational investigation for modeling the protein-protein interaction of TasA(28-261)-TapA(33-253): a decisive process in biofilm formation by Bacillus subtilis

Biofilms have a significant role in microbial persistence, antibiotic resistance, and chronic infections; consequently, there is a pressing need for development of novel "anti-biofilm strategies." One of the fundamental mechanisms involved in biofilm formation is protein-protein interactions of "amyloid-like proteins" (ALPs) in the extracellular matrix. Such interactions could be potential targets for development of novel anti-biofilm strategies; therefore, assessing the structural features of these interactions could be of great scientific value. Characterization of structural features the of protein-protein interaction with conventional structure biology tools including X-ray diffraction and nuclear magnetic resonance is technically challenging, expensive, and time-consuming. In contrast, modeling such interactions is time-efficient and economical, and might provide deeper understanding of structural basis of interactions. Although it is often acknowledged that molecular modeling methods have varying accuracy, their careful implementation with supplementary verification methods can provide valuable insight and directions for future studies. With this reasoning, during the present study, the protein-protein interaction of TasA_(28-261)-TapA_(33-253) (which is a decisive process for biofilm formation by Bacillus subtilis) was modeled using in silico approaches, viz., molecular modeling, protein-protein docking, and molecular dynamics simulations. Results obtained here identified amino acid residues present within intrinsically disordered regions of both proteins to be critical for interaction. These results were further supported with principal component analyses (PCA) and free energy landscape (FEL) analyses. Results presented here represent novel finding, and we hypothesize that amino acid residues identified during the present study could be targeted for inhibition of biofilm formation by B. subtilis.

Novel sampling strategies and a coarse-grained score function for docking homomers, flexible heteromers, and oligosaccharides using Rosetta in CAPRI rounds 37-45

Critical Assessment of PRediction of Interactions (CAPRI) rounds 37 through 45 introduced larger complexes, new macromolecules, and multistage assemblies. For these rounds, we used and expanded docking methods in Rosetta to model 23 target complexes. We successfully predicted 14 target complexes and recognized and refined near-native models generated by other groups for two further targets. Notably, for targets T110 and T136, we achieved the closest prediction of any CAPRI participant. We created several innovative approaches during these rounds. Since round 39 (target 122), we have used the new RosettaDock 4.0, which has a revamped coarse-grained energy function and the ability to perform conformer selection during docking with hundreds of pregenerated protein backbones. Ten of the complexes had some degree of symmetry in their interactions, so we tested Rosetta SymDock, realized its shortcomings, and developed the next-generation symmetric docking protocol, SymDock2, which includes docking of multiple backbones and induced-fit refinement. Since the last CAPRI assessment, we also developed methods for modeling and designing carbohydrates in Rosetta, and we used them to successfully model oligosaccharide-protein complexes in round 41. Although the results were broadly encouraging, they also highlighted the pressing need to invest in (a) flexible docking algorithms with the ability to model loop and linker motions and in (b) new sampling and scoring methods for oligosaccharide-protein interactions.

Insights into Actin Polymerization and Nucleation Using a Coarse-Grained Model

We studied actin filament polymerization and nucleation with molecular dynamics simulations and a previously established coarse-grained model having each residue represented by a single interaction site located at the C_α atom. We approximate each actin protein as a fully or partially rigid unit to identify the equilibrium structural ensemble of interprotein complexes. Monomers in the F-actin configuration bound to both barbed and pointed ends of a short F-actin filament at the anticipated locations for polymerization. Binding at both ends occurred with similar affinity. Contacts between residues of the incoming subunit and the short filament were consistent with expectation from models based on crystallography, x-ray diffraction, and cryo-electron microscopy. Binding at the barbed and pointed end also occurred at an angle with respect to the polymerizable bound structure, and the angle range depended on the flexibility of the D-loop. Additional barbed end bound states were seen when the incoming subunit was in the G-actin form. Consistent with an activation barrier for pointed end polymerization, G-actin did not bind at an F-actin pointed end. In all cases, binding at the barbed end also occurred in a configuration similar to the antiparallel (lower) dimer. Individual monomers bound each other in a short-pitch helix complex in addition to other configurations, with several of them apparently nonproductive for polymerization. Simulations with multiple monomers in the F-actin form show assembly into filaments as well as transient aggregates at the barbed end. We discuss the implications of these observations on the kinetic pathway of actin filament nucleation and polymerization and possibilities for future improvements of the coarse-grained model.

Structural Biology in the Multi-Omics Era

Rapid developments in cryogenic electron microscopy have opened new avenues to probe the structures of protein assemblies in their near native states. Recent studies have begun applying single -particle analysis to heterogeneous mixtures, revealing the potential of structural-omics approaches that combine the power of mass spectrometry and electron microscopy. Here we highlight advances and challenges in sample preparation, data processing, and molecular modeling for handling increasingly complex mixtures. Such advances will help structural-omics methods extend to cellular-level models of structural biology.

HawkDock: a web server to predict and analyze the protein-protein complex based on computational docking and MM/GBSA

Protein–protein interactions (PPIs) play an important role in the different functions of cells, but accurate prediction of the three-dimensional structures for PPIs is still a notoriously difficult task. In this study, HawkDock, a free and open accessed web server, was developed to predict and analyze the structures of PPIs. In the HawkDock server, the ATTRACT docking algorithm, the HawkRank scoring function developed in our group and the MM/GBSA free energy decomposition analysis were seamlessly integrated into a multi-functional platform. The structures of PPIs were predicted by combining the ATTRACT docking and the HawkRank re-scoring, and the key residues for PPIs were highlighted by the MM/GBSA free energy decomposition. The molecular visualization was supported by 3Dmol.js. For the structural modeling of PPIs, HawkDock could achieve a better performance than ZDOCK 3.0.2 in the benchmark testing. For the prediction of key residues, the important residues that play an essential role in PPIs could be identified in the top 10 residues for ∼81.4% predicted models and ∼95.4% crystal structures in the benchmark dataset. To sum up, the HawkDock server is a powerful tool to predict the binding structures and identify the key residues of PPIs. The HawkDock server is accessible free of charge at http://cadd.zju.edu.cn/hawkdock/.

Interaction of a Model Hydrophobic Drug Dimethylcurcumin with Albumin Nanoparticles

The aim of present study was to investigate the binding interactions of a model hydrophobic molecule, dimethylcurcumin (DMC) with nanoparticle form of bovine serum albumin (BSA) using fluorescence spectroscopy techniques. For this, BSA nanoparticles (size = 62.0 ± 3.5 nm, molecular weight = 11,243 ± 3445 kD) prepared by thermal denaturation method was mixed with DMC in solution and monitored for fluorescence emission of tryptophan (Trp) residue as well as DMC separately. The emission maximum of DMC in nanoparticles form exhibited more blue sift and quenched the excited state of tryptophan (Trp) by six fold higher than in the native form of BSA. By analyzing Trp fluorescence, the mean binding constant (K) estimated for the interaction of DMC with native and nanoparticles forms of BSA was 2.7 ± 0.4 × 10⁴ M^-1 and 1.5 ± 0.5 × 10⁵ M^-1 respectively. Together these results suggested that DMC experienced a more rigid environment in nanoparticles than in native form of BSA. Additionally the above determined K values were in agreement with those reported previously by absorption techniques. Further direct energy transfer was observed between Trp and DMC, using which the distance (r) calculated between them was 28.25 ± 0.27 Ǻ in BSA native. Similar analysis involving BSA nanoparticle and DMC revealed a distance of 24.25 ± 1.05 Ǻ between the hydrophobic core and the ligand. Finally interaction of DMC with BSA was validated through molecular docking studies, which indicated sub-domain IIA as the binding site of DMC. Thus it is concluded that intrinsic fluorescence of protein can be utilized to study the interaction of its different physical forms with any hydrophobic ligand.

Ambiguity Coding Allows Accurate Inference of Evolutionary Parameters from Alignments in an Aggregated State-Space

How can we best learn the history of a protein’s evolution? Ideally, a model of sequence evolution should capture both the process that generates genetic variation and the functional constraints determining which changes are fixed. However, in practical terms the most suitable approach may simply be the one that combines the convenience of easily available input data with the ability to return useful parameter estimates. For example, we might be interested in a measure of the strength of selection (typically obtained using a codon model) or an ancestral structure (obtained using structural modeling based on inferred amino acid sequence and side chain configuration).

But what if data in the relevant state-space are not readily available? We show that it is possible to obtain accurate estimates of the outputs of interest using an established method for handling missing data. Encoding observed characters in an alignment as ambiguous representations of characters in a larger state-space allows the application of models with the desired features to data that lack the resolution that is normally required. This strategy is viable because the evolutionary path taken through the observed space contains information about states that were likely visited in the “unseen” state-space. To illustrate this, we consider two examples with amino acid sequences as input. We show that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{upgreek} \usepackage{mathrsfs} \setlength{\oddsidemargin}{-69pt} \begin{document} }{}$$\omega$$\end{document}, a parameter describing the relative strength of selection on nonsynonymous and synonymous changes, can be estimated in an unbiased manner using an adapted version of a standard 61-state codon model. Using simulated and empirical data, we find that ancestral amino acid side chain configuration can be inferred by applying a 55-state empirical model to 20-state amino acid data. Where feasible, combining inputs from both ambiguity-coded and fully resolved data improves accuracy. Adding structural information to as few as 12.5% of the sequences in an amino acid alignment results in remarkable ancestral reconstruction performance compared to a benchmark that considers the full rotamer state information. These examples show that our methods permit the recovery of evolutionary information from sequences where it has previously been inaccessible. [Ancestral reconstruction; natural selection; protein structure; state-spaces; substitution models.]

New Peptide-Based Pharmacophore Activates 20S Proteasome

The proteasome is a pivotal element of controlled proteolysis, responsible for the catabolic arm of proteostasis. By inducing apoptosis, small molecule inhibitors of proteasome peptidolytic activities are successfully utilized in treatment of blood cancers. However, the clinical potential of proteasome activation remains relatively unexplored. In this work, we introduce short TAT peptides derived from HIV-1 Tat protein and modified with synthetic turn-stabilizing residues as proteasome agonists. Molecular docking and biochemical studies point to the α1/α2 pocket of the core proteasome α ring as the binding site of TAT peptides. We postulate that the TATs' pharmacophore consists of an N-terminal basic pocket-docking "activation anchor" connected via a β turn inducer to a C-terminal "specificity clamp" that binds on the proteasome α surface. By allosteric effects-including destabilization of the proteasomal gate-the compounds substantially augment activity of the core proteasome in vitro. Significantly, this activation is preserved in the lysates of cultured cells treated with the compounds. We propose that the proteasome-stimulating TAT pharmacophore provides an attractive lead for future clinical use.

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.

Challenges and opportunities of automated protein-protein docking: HDOCK server vs human predictions in CAPRI Rounds 38-46

Protein-protein docking plays an important role in the computational prediction of the complex structure between two proteins. For years, a variety of docking algorithms have been developed, as witnessed by the critical assessment of prediction interactions (CAPRI) experiments. However, despite their successes, many docking algorithms often require a series of manual operations like modeling structures from sequences, incorporating biological information, and selecting final models. The difficulties in these manual steps have significantly limited the applications of protein-protein docking, as most of the users in the community are nonexperts in docking. Therefore, automated docking like a web server, which can give a comparable performance to human docking protocol, is pressingly needed. As such, we have participated in the blind CAPRI experiments for Rounds 38-45 and CASP13-CAPRI challenge for Round 46 with both our HDOCK automated docking web server and human docking protocol. It was shown that our HDOCK server achieved an "acceptable" or higher CAPRI-rated model in the top 10 submitted predictions for 65.5% and 59.1% of the targets in the docking experiments of CAPRI and CASP13-CAPRI, respectively, which are comparable to 66.7% and 54.5% for human docking protocol. Similar trends can also be observed in the scoring experiments. These results validated our HDOCK server as an efficient automated docking protocol for nonexpert users. Challenges and opportunities of automated docking are also discussed.

How to choose templates for modeling of protein complexes: Insights from benchmarking template-based docking

Comparative docking is based on experimentally determined structures of protein-protein complexes (templates), following the paradigm that proteins with similar sequences and/or structures form similar complexes. Modeling utilizing structure similarity of target monomers to template complexes significantly expands structural coverage of the interactome. Template-based docking by structure alignment can be performed for the entire structures or by aligning targets to the bound interfaces of the experimentally determined complexes. Systematic benchmarking of docking protocols based on full and interface structure alignment showed that both protocols perform similarly, with top 1 docking success rate 26%. However, in terms of the models' quality, the interface-based docking performed marginally better. The interface-based docking is preferable when one would suspect a significant conformational change in the full protein structure upon binding, for example, a rearrangement of the domains in multidomain proteins. Importantly, if the same structure is selected as the top template by both full and interface alignment, the docking success rate increases 2-fold for both top 1 and top 10 predictions. Matching structural annotations of the target and template proteins for template detection, as a computationally less expensive alternative to structural alignment, did not improve the docking performance. Sophisticated remote sequence homology detection added templates to the pool of those identified by structure-based alignment, suggesting that for practical docking, the combination of the structure alignment protocols and the remote sequence homology detection may be useful in order to avoid potential flaws in generation of the structural templates library.

A simple and rapid pipeline for identification of receptor-binding sites on the surface proteins of pathogens

Ligand-receptor interactions play a crucial role in the plethora of biological processes. Several methods have been established to reveal ligand-receptor interface, however, the majority of methods are time-consuming, laborious and expensive. Here we present a straightforward and simple pipeline to identify putative receptor-binding sites on the pathogen ligands. Two model ligands (bait proteins), domain III of protein E of West Nile virus and NadA of Neisseria meningitidis, were incubated with the proteins of human brain microvascular endothelial cells immobilized on nitrocellulose or PVDF membrane, the complex was trypsinized on-membrane, bound peptides of the bait proteins were recovered and detected on MALDI-TOF. Two peptides of DIII (~916 Da and ~2003 Da) and four peptides of NadA (~1453 Da, ~1810 Da, ~2051 Da and ~2433 Da) were identified as plausible receptor-binders. Further, binding of the identified peptides to the proteins of endothelial cells was corroborated using biotinylated synthetic analogues in ELISA and immunocytochemistry. Experimental pipeline presented here can be upscaled easily to map receptor-binding sites on several ligands simultaneously. The approach is rapid, cost-effective and less laborious. The proposed experimental pipeline could be a simpler alternative or complementary method to the existing techniques used to reveal amino-acids involved in the ligand-receptor interface.

Domain-mediated interactions for protein subfamily identification

Within a protein family, proteins with the same domain often exhibit different cellular functions, despite the shared evolutionary history and molecular function of the domain. We hypothesized that domain-mediated interactions (DMIs) may categorize a protein family into subfamilies because the diversified functions of a single domain often depend on interacting partners of domains. Here we systematically identified DMI subfamilies, in which proteins share domains with DMI partners, as well as with various functional and physical interaction networks in individual species. In humans, DMI subfamily members are associated with similar diseases, including cancers, and are frequently co-associated with the same diseases. DMI information relates to the functional and evolutionary subdivisions of human kinases. In yeast, DMI subfamilies contain proteins with similar phenotypic outcomes from specific chemical treatments. Therefore, the systematic investigation here provides insights into the diverse functions of subfamilies derived from a protein family with a link-centric approach and suggests a useful resource for annotating the functions and phenotypic outcomes of proteins.

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.

Pushing the accuracy limit of shape complementarity for protein-protein docking

Background

Protein-protein docking is a valuable computational approach for investigating protein-protein interactions. Shape complementarity is the most basic component of a scoring function and plays an important role in protein-protein docking. Despite significant progresses, shape representation remains an open question in the development of protein-protein docking algorithms, especially for grid-based docking approaches.

Results

We have proposed a new pairwise shape-based scoring function (LSC) for protein-protein docking which adopts an exponential form to take into account long-range interactions between protein atoms. The LSC scoring function was incorporated into our FFT-based docking program and evaluated for both bound and unbound docking on the protein docking benchmark 4.0. It was shown that our LSC achieved a significantly better performance than four other similar docking methods, ZDOCK 2.1, MolFit/G, GRAMM, and FTDock/G, in both success rate and number of hits. When considering the top 10 predictions, LSC obtained a success rate of 51.71% and 6.82% for bound and unbound docking, respectively, compared to 42.61% and 4.55% for the second-best program ZDOCK 2.1. LSC also yielded an average of 8.38 and 3.94 hits per complex in the top 1000 predictions for bound and unbound docking, respectively, followed by 6.38 and 2.96 hits for the second-best ZDOCK 2.1.

Conclusions

The present LSC method will not only provide an initial-stage docking approach for post-docking processes but also have a general implementation for accurate representation of other energy terms on grids in protein-protein docking. The software has been implemented in our HDOCK web server at http://hdock.phys.hust.edu.cn/.

More efficient screening of protein-protein complex model structures for reducing the number of candidates

Rigid-body protein-protein docking is very efficient in generating tens of thousands of docked complex models (decoys) in a very short time without considering structure change upon binding, but typical docking scoring functions are not necessarily sufficiently accurate to narrow these decoys down to a small number of plausible candidates. Flexible refinements and sophisticated evaluation of the decoys are thus required to achieve more accurate prediction. Since this process is time-consuming, an efficient screening method to reduce the number of decoys is necessary immediately following rigid-body dockings. We attempted to develop an efficient screening method by clustering decoys generated by the rigid-body docking ZDOCK. We introduced the three metrics ligand-root-mean-square deviation (L-RMSD), interface-ligand-RMSD (iL-RMSD), and the fraction of common contacts (FCC), and examined various ranges of cut-offs for clusters to determine the best set of clustering parameters. Although the employed clustering algorithm is simple, it successfully reduced the number of decoys. Using iL-RMSD with a cut-off radius of 8 Å, the number of decoys that contain at least one near-native model with 90% probability decreased from 4,808 to 320, a 93% reduction in the original number of decoys. Using FCC for the clustering step, the top 1,000 success rates, defined as the probability that the top 1,000 models contain at least one near-native structure, reached 97%. We conclude that the proposed method is very efficient in selecting a small number of decoys that include near-native decoys.

Critical assessment of methods of protein structure prediction (CASP)-Round XIII

CASP (critical assessment of structure prediction) assesses the state of the art in modeling protein structure from amino acid sequence. The most recent experiment (CASP13 held in 2018) saw dramatic progress in structure modeling without use of structural templates (historically "ab initio" modeling). Progress was driven by the successful application of deep learning techniques to predict inter-residue distances. In turn, these results drove dramatic improvements in three-dimensional structure accuracy: With the proviso that there are an adequate number of sequences known for the protein family, the new methods essentially solve the long-standing problem of predicting the fold topology of monomeric proteins. Further, the number of sequences required in the alignment has fallen substantially. There is also substantial improvement in the accuracy of template-based models. Other areas-model refinement, accuracy estimation, and the structure of protein assemblies-have again yielded interesting results. CASP13 placed increased emphasis on the use of sparse data together with modeling and chemical crosslinking, SAXS, and NMR all yielded more mature results. This paper summarizes the key outcomes of CASP13. The special issue of PROTEINS contains papers describing the CASP13 assessments in each modeling category and contributions from the participants.

Efficient flexible backbone protein-protein docking for challenging targets

Motivation

Binding-induced conformational changes challenge current computational docking algorithms by exponentially increasing the conformational space to be explored. To restrict this search to relevant space, some computational docking algorithms exploit the inherent flexibility of the protein monomers to simulate conformational selection from pre-generated ensembles. As the ensemble size expands with increased flexibility, these methods struggle with efficiency and high false positive rates.

Results

Here, we develop and benchmark RosettaDock 4.0, which efficiently samples large conformational ensembles of flexible proteins and docks them using a novel, six-dimensional, coarse-grained score function. A strong discriminative ability allows an eight-fold higher enrichment of near-native candidate structures in the coarse-grained phase compared to RosettaDock 3.2. It adaptively samples 100 conformations each of the ligand and the receptor backbone while increasing computational time by only 20-80%. In local docking of a benchmark set of 88 proteins of varying degrees of flexibility, the expected success rate (defined as cases with ≥50% chance of achieving 3 near-native structures in the 5 top-ranked ones) for blind predictions after resampling is 77% for rigid complexes, 49% for moderately flexible complexes and 31% for highly flexible complexes. These success rates on flexible complexes are a substantial step forward from all existing methods. Additionally, for highly flexible proteins, we demonstrate that when a suitable conformer generation method exists, the method successfully docks the complex.

Availability and implementation

As a part of the Rosetta software suite, RosettaDock 4.0 is available at https://www.rosettacommons.org to all non-commercial users for free and to commercial users for a fee.

Supplementary information

Supplementary data are available at Bioinformatics online.

InterEvDock2: an expanded server for protein docking using evolutionary and biological information from homology models and multimeric inputs

Computational protein docking is a powerful strategy to predict structures of protein-protein interactions and provides crucial insights for the functional characterization of macromolecular cross-talks. We previously developed InterEvDock, a server for ab initio protein docking based on rigid-body sampling followed by consensus scoring using physics-based and statistical potentials, including the InterEvScore function specifically developed to incorporate co-evolutionary information in docking. InterEvDock2 is a major evolution of InterEvDock which allows users to submit input sequences – not only structures – and multimeric inputs and to specify constraints for the pairwise docking process based on previous knowledge about the interaction. For this purpose, we added modules in InterEvDock2 for automatic template search and comparative modeling of the input proteins. The InterEvDock2 pipeline was benchmarked on 812 complexes for which unbound homology models of the two partners and co-evolutionary information are available in the PPI4DOCK database. InterEvDock2 identified a correct model among the top 10 consensus in 29% of these cases (compared to 15–24% for individual scoring functions) and at least one correct interface residue among 10 predicted in 91% of these cases. InterEvDock2 is thus a unique protein docking server, designed to be useful for the experimental biology community. The InterEvDock2 web interface is available at http://bioserv.rpbs.univ-paris-diderot.fr/services/InterEvDock2/.

Modified Potential Functions Result in Enhanced Predictions of a Protein Complex by All-Atom Molecular Dynamics Simulations, Confirming a Stepwise Association Process for Native Protein-Protein Interactions

The relative prevalence of native protein-protein interactions (PPIs) are the cornerstone for understanding the structure, dynamics and mechanisms of function of protein complexes. In this study, we develop a scheme for scaling the protein-water interaction in the CHARMM36 force field, in order to better fit the solvation free energy of amino acids side-chain analogues. We find that the molecular dynamics simulation with the scaled force field, CHARMM36s, as well as a recently released version, CHARMM36m, effectively improve on the overly sticky association of proteins, such as ubiquitin. We investigate the formation of a heterodimer protein complex between the SAM domains of the EphA2 receptor and the SHIP2 enzyme by performing a combined total of 48 μs simulations with the different potential functions. While the native SAM heterodimer is only predicted at a low rate of 6.7% with the original CHARMM36 force field, the yield is increased to 16.7% with CHARMM36s, and to 18.3% with CHARMM36m. By analyzing the 25 native SAM complexes formed in the simulations, we find that their formation involves a preorientation guided by Coulomb interactions, consistent with an electrostatic steering mechanism. In 12 cases, the complex could directly transform to the native protein interaction surfaces with only small adjustments in domain orientation. In the other 13 cases, orientational and/or translational adjustments are needed to reach the native complex. Although the tendency for non-native complexes to dissociate has nearly doubled with the modified potential functions, a dissociation followed by a reassociation to the correct complex structure is still rare. Instead, the remaining non-native complexes undergo configurational changes/surface searching, which, however, rarely leads to native structures on a time scale of 250 ns. These observations provide a rich picture of the mechanisms of protein-protein complex formation and suggest that computational predictions of native complex PPIs could be improved further.

Applications of in Silico Methods for Design and Development of Drugs Targeting Protein-Protein Interactions

BACKGROUND

Identification of Protein-Protein Interactions (PPIs) is a major challenge in modern molecular biology and biochemistry research, due to the unquestionable role of proteins in cells, biological process and pathological states. Over the past decade, the PPIs have evolved from being considered a highly challenging field of research to being investigated and examined as targets for pharmacological intervention.

OBJECTIVE

Comprehension of protein interactions is crucial to known how proteins come together to build signalling pathways, to carry out their functions, or to cause diseases, when deregulated. Multiplicity and great amount of PPIs structures offer a huge number of new and potential targets for the treatment of different diseases.

METHODS

Computational techniques are becoming predominant in PPIs studies for their effectiveness, flexibility, accuracy and cost. As a matter of fact, there are effective in silico approaches which are able to identify PPIs and PPI site. Such methods for computational target prediction have been developed through molecular descriptors and data-mining procedures.

RESULTS

In this review, we present different types of interactions between protein-protein and the application of in silico methods for design and development of drugs targeting PPIs. We described computational approaches for the identification of possible targets on protein surface and to detect of stimulator/ inhibitor molecules.

CONCLUSION

A deeper study of the most recent bioinformatics methodologies for PPIs studies is vital for a better understanding of protein complexes and for discover new potential PPI modulators in therapeutic intervention.

Computational approaches to macromolecular interactions in the cell

Structural modeling of a cell is an evolving strategic direction in computational structural biology. It takes advantage of new powerful modeling techniques, deeper understanding of fundamental principles of molecular structure and assembly, and rapid growth of the amount of structural data generated by experimental techniques. Key modeling approaches to principal types of macromolecular assemblies in a cell already exist. The main challenge, along with the further development of these modeling approaches, is putting them together in a consistent, unified whole cell model. This opinion piece addresses the fundamental aspects of modeling macromolecular assemblies in a cell, and the state-of-the-art in modeling of the principal types of such assemblies.

Proteome-wide, Structure-Based Prediction of Protein-Protein Interactions/New Molecular Interactions Viewer

Determining the complete Arabidopsis (Arabidopsis thaliana) protein-protein interaction network is essential for understanding the functional organization of the proteome. Numerous small-scale studies and a couple of large-scale ones have elucidated a fraction of the estimated 300,000 binary protein-protein interactions in Arabidopsis. In this study, we provide evidence that a docking algorithm has the ability to identify real interactions using both experimentally determined and predicted protein structures. We ranked 0.91 million interactions generated by all possible pairwise combinations of 1,346 predicted structure models from an Arabidopsis predicted "structure-ome" and found a significant enrichment of real interactions for the top-ranking predicted interactions, as shown by cosubcellular enrichment analysis and yeast two-hybrid validation. Our success rate for computationally predicted, structure-based interactions was 63% of the success rate for published interactions naively tested using the yeast two-hybrid system and 2.7 times better than for randomly picked pairs of proteins. This study provides another perspective in interactome exploration and biological network reconstruction using protein structural information. We have made these interactions freely accessible through an improved Arabidopsis Interactions Viewer and have created community tools for accessing these and ∼2.8 million other protein-protein and protein-DNA interactions for hypothesis generation by researchers worldwide. The Arabidopsis Interactions Viewer is freely available at http://bar.utoronto.ca/interactions2/.

Inhibition of N-myristoyltransferase1 affects dengue virus replication

Dengue virus (DENV) causes dengue fever, a self‐limiting disease that could be fatal due to serious complications. No specific treatment is currently available and the preventative vaccine is only partially protective. To develop a potential drug target for dengue fever, we need to understand its biology and pathogenesis thoroughly. N‐myristoyltransferase (NMT) is an N‐terminal protein lipidation enzyme that catalyzes the covalent cotranslational attachment of fatty acids to the amino‐terminal glycine residue of a number of proteins, leading to the modulation of various signaling molecules. In this study, we investigated the interaction of dengue viral proteins with host NMT and its subsequent effect on DENV. Our bioinformatics, molecular docking, and far‐western blotting analyses demonstrated the interaction of viral envelope protein (E) with NMT. The gene expression of NMT was strongly elevated in a dependent manner during the viral replication phase in dendritic cells. Moreover, NMT gene silencing significantly inhibited DENV replication in dendritic cells. Further studies investigating the target cell types of other host factors are suggested.

Molecular Interaction-Based Exploration of the Broad Spectrum Efficacy of a Bacillus thuringiensis Insecticidal Chimeric Protein, Cry1AcF

Bacillus thuringiensis insecticidal proteins (Bt ICPs) are reliable and valuable options for pest management in crops. Protein engineering of Bt ICPs is a competitive alternative for resistance management in insects. The primary focus of the study was to reiterate the translational utility of a protein-engineered chimeric Cry toxin, Cry1AcF, for its broad spectrum insecticidal efficacy using molecular modeling and docking studies. In-depth bioinformatic analysis was undertaken for structure prediction of the Cry toxin as the ligand and aminopeptidase1 receptors (APN1) from Helicoverpa armigera (HaAPN1) and Spodoptera litura (SlAPN1) as receptors, followed by interaction studies using protein-protein docking tools. The study revealed feasible interactions between the toxin and the two receptors through H-bonding and hydrophobic interactions. Further, molecular dynamics simulations substantiated the stability of the interactions, proving the broad spectrum efficacy of Cry1AcF in controlling H. armigera and S. litura. These findings justify the utility of protein-engineered toxins in pest management.

Methods for Discovering and Targeting Druggable Protein-Protein Interfaces and Their Application to Repurposing

Drug repurposing is a creative and resourceful approach to increase the number of therapies by exploiting available and approved drugs. However, identifying new protein targets for previously approved drugs is challenging. Although new strategies have been developed for drug repurposing, there is broad agreement that there is room for further improvements. In this chapter, we review protein-protein interaction (PPI) interface-targeting strategies for drug repurposing applications. We discuss certain features, such as hot spot residue and hot region prediction and their importance in drug repurposing, and illustrate common methods used in PPI networks to identify drug off-targets. We also collect available online resources for hot spot prediction, binding pocket identification, and interface clustering which are effective resources in polypharmacology. Finally, we provide case studies showing the significance of protein interfaces and hot spots in drug repurposing.

Web Services for Molecular Docking Simulations

Docking process is one of the most significant activities for the analysis of protein-protein or protein-ligand complexes. These tools have become of unique importance when allocated in web services, collaborating scientifically with several areas of knowledge in an interdisciplinary way. Among the several web services dedicated to carrying out molecular docking simulations, we selected the DockThor web service. To illustrate the application of DockThor to protein-ligand docking simulations, we analyzed the docking of a ligand against the structure of epidermal growth factor receptor, an essential molecular marker in cancer research.

Gene ontology improves template selection in comparative protein docking

Structural characterization of protein-protein interactions is essential for our ability to study life processes at the molecular level. Computational modeling of protein complexes (protein docking) is important as the source of their structure and as a way to understand the principles of protein interaction. Rapidly evolving comparative docking approaches utilize target/template similarity metrics, which are often based on the protein structure. Although the structural similarity, generally, yields good performance, other characteristics of the interacting proteins (eg, function, biological process, and localization) may improve the prediction quality, especially in the case of weak target/template structural similarity. For the ranking of a pool of models for each target, we tested scoring functions that quantify similarity of Gene Ontology (GO) terms assigned to target and template proteins in three ontology domains-biological process, molecular function, and cellular component (GO-score). The scoring functions were tested in docking of bound, unbound, and modeled proteins. The results indicate that the combined structural and GO-terms functions improve the scoring, especially in the twilight zone of structural similarity, typical for protein models of limited accuracy.

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).

Bioinformatics Tools and Benchmarks for Computational Docking and 3D Structure Prediction of RNA-Protein Complexes

RNA-protein (RNP) interactions play essential roles in many biological processes, such as regulation of co-transcriptional and post-transcriptional gene expression, RNA splicing, transport, storage and stabilization, as well as protein synthesis. An increasing number of RNP structures would aid in a better understanding of these processes. However, due to the technical difficulties associated with experimental determination of macromolecular structures by high-resolution methods, studies on RNP recognition and complex formation present significant challenges. As an alternative, computational prediction of RNP interactions can be carried out. Structural models obtained by theoretical predictive methods are, in general, less reliable compared to models based on experimental measurements but they can be sufficiently accurate to be used as a basis for to formulating functional hypotheses. In this article, we present an overview of computational methods for 3D structure prediction of RNP complexes. We discuss currently available methods for macromolecular docking and for scoring 3D structural models of RNP complexes in particular. Additionally, we also review benchmarks that have been developed to assess the accuracy of these methods.

Evolution of In Silico Strategies for Protein-Protein Interaction Drug Discovery

The advent of advanced molecular modeling software, big data analytics, and high-speed processing units has led to the exponential evolution of modern drug discovery and better insights into complex biological processes and disease networks. This has progressively steered current research interests to understanding protein-protein interaction (PPI) systems that are related to a number of relevant diseases, such as cancer, neurological illnesses, metabolic disorders, etc. However, targeting PPIs are challenging due to their "undruggable" binding interfaces. In this review, we focus on the current obstacles that impede PPI drug discovery, and how recent discoveries and advances in in silico approaches can alleviate these barriers to expedite the search for potential leads, as shown in several exemplary studies. We will also discuss about currently available information on PPI compounds and systems, along with their usefulness in molecular modeling. Finally, we conclude by presenting the limits of in silico application in drug discovery and offer a perspective in the field of computer-aided PPI drug discovery.

Artificial intelligence in drug design

Thanks to the fast improvement of the computing power and the rapid development of the computational chemistry and biology, the computer-aided drug design techniques have been successfully applied in almost every stage of the drug discovery and development pipeline to speed up the process of research and reduce the cost and risk related to preclinical and clinical trials. Owing to the development of machine learning theory and the accumulation of pharmacological data, the artificial intelligence (AI) technology, as a powerful data mining tool, has cut a figure in various fields of the drug design, such as virtual screening, activity scoring, quantitative structure-activity relationship (QSAR) analysis, de novo drug design, and in silico evaluation of absorption, distribution, metabolism, excretion and toxicity (ADME/T) properties. Although it is still challenging to provide a physical explanation of the AI-based models, it indeed has been acting as a great power to help manipulating the drug discovery through the versatile frameworks. Recently, due to the strong generalization ability and powerful feature extraction capability, deep learning methods have been employed in predicting the molecular properties as well as generating the desired molecules, which will further promote the application of AI technologies in the field of drug design.

Inhibition of protein interactions: co-crystalized protein-protein interfaces are nearly as good as holo proteins in rigid-body ligand docking

Modulating protein interaction pathways may lead to the cure of many diseases. Known protein-protein inhibitors bind to large pockets on the protein-protein interface. Such large pockets are detected also in the protein-protein complexes without known inhibitors, making such complexes potentially druggable. The inhibitor-binding site is primary defined by the side chains that form the largest pocket in the protein-bound conformation. Low-resolution ligand docking shows that the success rate for the protein-bound conformation is close to the one for the ligand-bound conformation, and significantly higher than for the apo conformation. The conformational change on the protein interface upon binding to the other protein results in a pocket employed by the ligand when it binds to that interface. This proof-of-concept study suggests that rather than using computational pocket-opening procedures, one can opt for an experimentally determined structure of the target co-crystallized protein-protein complex as a starting point for drug design.

Binding free energy analysis of protein-protein docking model structures by evERdock

To aid the evaluation of protein-protein complex model structures generated by protein docking prediction (decoys), we previously developed a method to calculate the binding free energies for complexes. The method combines a short (2 ns) all-atom molecular dynamics simulation with explicit solvent and solution theory in the energy representation (ER). We showed that this method successfully selected structures similar to the native complex structure (near-native decoys) as the lowest binding free energy structures. In our current work, we applied this method (evERdock) to 100 or 300 model structures of four protein-protein complexes. The crystal structures and the near-native decoys showed the lowest binding free energy of all the examined structures, indicating that evERdock can successfully evaluate decoys. Several decoys that show low interface root-mean-square distance but relatively high binding free energy were also identified. Analysis of the fraction of native contacts, hydrogen bonds, and salt bridges at the protein-protein interface indicated that these decoys were insufficiently optimized at the interface. After optimizing the interactions around the interface by including interfacial water molecules, the binding free energies of these decoys were improved. We also investigated the effect of solute entropy on binding free energy and found that consideration of the entropy term does not necessarily improve the evaluations of decoys using the normal model analysis for entropy calculation.

Modeling and simulating networks of interdependent protein interactions

Protein interactions are fundamental building blocks of biochemical reaction systems underlying cellular functions. The complexity and functionality of these systems emerge not only from the protein interactions themselves but also from the dependencies between these interactions, as generated by allosteric effects or mutual exclusion due to steric hindrance. Therefore, formal models for integrating and utilizing information about interaction dependencies are of high interest. Here, we describe an approach for endowing protein networks with interaction dependencies using propositional logic, thereby obtaining constrained protein interaction networks ("constrained networks"). The construction of these networks is based on public interaction databases as well as text-mined information about interaction dependencies. We present an efficient data structure and algorithm to simulate protein complex formation in constrained networks. The efficiency of the model allows fast simulation and facilitates the analysis of many proteins in large networks. In addition, this approach enables the simulation of perturbation effects, such as knockout of single or multiple proteins and changes of protein concentrations. We illustrate how our model can be used to analyze a constrained human adhesome protein network, which is responsible for the formation of diverse and dynamic cell-matrix adhesion sites. By comparing protein complex formation under known interaction dependencies versus without dependencies, we investigate how these dependencies shape the resulting repertoire of protein complexes. Furthermore, our model enables investigating how the interplay of network topology with interaction dependencies influences the propagation of perturbation effects across a large biochemical system. Our simulation software CPINSim (for Constrained Protein Interaction Network Simulator) is available under the MIT license at http://github.com/BiancaStoecker/cpinsim and as a Bioconda package (https://bioconda.github.io).

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.

Modeling CAPRI targets 110-120 by template-based and free docking using contact potential and combined scoring function

The paper presents analysis of our template-based and free docking predictions in the joint CASP12/CAPRI37 round. A new scoring function for template-based docking was developed, benchmarked on the Dockground resource, and applied to the targets. The results showed that the function successfully discriminates the incorrect docking predictions. In correctly predicted targets, the scoring function was complemented by other considerations, such as consistency of the oligomeric states among templates, similarity of the biological functions, biological interface relevance, etc. The scoring function still does not distinguish well biological from crystal packing interfaces, and needs further development for the docking of bundles of α-helices. In the case of the trimeric targets, sequence-based methods did not find common templates, despite similarity of the structures, suggesting complementary use of structure- and sequence-based alignments in comparative docking. The results showed that if a good docking template is found, an accurate model of the interface can be built even from largely inaccurate models of individual subunits. Free docking however is very sensitive to the quality of the individual models. However, our newly developed contact potential detected approximate locations of the binding sites.

Modeling the assembly order of multimeric heteroprotein complexes

Protein-protein interactions are the cornerstone of numerous biological processes. Although an increasing number of protein complex structures have been determined using experimental methods, relatively fewer studies have been performed to determine the assembly order of complexes. In addition to the insights into the molecular mechanisms of biological function provided by the structure of a complex, knowing the assembly order is important for understanding the process of complex formation. Assembly order is also practically useful for constructing subcomplexes as a step toward solving the entire complex experimentally, designing artificial protein complexes, and developing drugs that interrupt a critical step in the complex assembly. There are several experimental methods for determining the assembly order of complexes; however, these techniques are resource-intensive. Here, we present a computational method that predicts the assembly order of protein complexes by building the complex structure. The method, named Path-LzerD, uses a multimeric protein docking algorithm that assembles a protein complex structure from individual subunit structures and predicts assembly order by observing the simulated assembly process of the complex. Benchmarked on a dataset of complexes with experimental evidence of assembly order, Path-LZerD was successful in predicting the assembly pathway for the majority of the cases. Moreover, when compared with a simple approach that infers the assembly path from the buried surface area of subunits in the native complex, Path-LZerD has the strong advantage that it can be used for cases where the complex structure is not known. The path prediction accuracy decreased when starting from unbound monomers, particularly for larger complexes of five or more subunits, for which only a part of the assembly path was correctly identified. As the first method of its kind, Path-LZerD opens a new area of computational protein structure modeling and will be an indispensable approach for studying protein complexes.

The computational prediction of protein assemblies

The function of proteins in the cell is almost always mediated by their interaction with different partners, including other proteins, nucleic acids or small organic molecules. The ability of identifying all of them is an essential step in our quest for understanding life at the molecular level. The inference of the protein complex composition and of its molecular details can also provide relevant clues for the development and the design of drugs. In this short review, I will discuss the computational aspects of the analysis and prediction of protein-protein assemblies and discuss some of the most recent developments as seen in the last Critical Assessment of Techniques for Protein Structure Prediction (CASP) experiment.

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.

Modeling EphB4-EphrinB2 protein-protein interaction using flexible docking of a short linear motif

Background

Many protein–protein interactions are mediated by a short linear motif. Usually, amino acid sequences of those motifs are known or can be predicted. It is much harder to experimentally characterize or predict their structure in the bound form. In this work, we test a possibility of using flexible docking of a short linear motif to predict the interaction interface of the EphB4-EphrinB2 complex (a system extensively studied for its significance in tumor progression).

Methods

In the modeling, we only use knowledge about the motif sequence and experimental structures of EphB4-EphrinB2 complex partners. The proposed protocol enables efficient modeling of significant conformational changes in the short linear motif fragment during molecular docking simulation. For the docking simulations, we use the CABS-dock method for docking fully flexible peptides to flexible protein receptors (available as a server at http://biocomp.chem.uw.edu.pl/CABSdock/). Based on the docking result, the protein–protein complex is reconstructed and refined.

Results

Using this novel protocol, we obtained an accurate EphB4-EphrinB2 interaction model.

Conclusions

The results show that the CABS-dock method may be useful as the primary docking tool in specific protein–protein docking cases similar to EphB4-EphrinB2 complex—that is, where a short linear motif fragment can be identified.