Protein-protein docking by fast generalized Fourier transforms on 5D rotational manifolds

Inhibitory effect of truncated isoforms on GPCR dimerization predicted by combinatorial computational strategy

G protein-coupled receptors (GPCRs) play a pivotal role in fundamental biological processes and disease development. GPCR isoforms, derived from alternative splicing, can exhibit distinct signaling patterns. Some highly-truncated isoforms can impact functional performance of full-length receptors, suggesting their intriguing regulatory roles. However, how these truncated isoforms interact with full-length counterparts remains largely unexplored. Here, we computationally investigated the interaction patterns of three human GPCRs from three different classes, ADORA1 (Class A), mGlu2 (Class C) and SMO (Class F) with their respective truncated isoforms because their homodimer structures have been experimentally determined, and they have truncated isoforms deposited and identified at protein level in Uniprot database. Combining the neural network-based AlphaFold2 and two physics-based protein-protein docking tools, we generated multiple complex structures and assessed the binding affinity in the context of atomistic molecular dynamics simulations. Our computational results suggested all the four studied truncated isoforms showed potent binding to their counterparts and overlapping interfaces with homodimers, indicating their strong potential to block homodimerization of their counterparts. Our study offers insights into functional significance of GPCR truncated isoforms and supports the ubiquity of their regulatory roles.

Computational Design of Peptide Assemblies

With the ongoing development of peptide self-assembling materials, there is growing interest in exploring novel functional peptide sequences. From short peptides to long polypeptides, as the functionality increases, the sequence space is also expanding exponentially. Consequently, attempting to explore all functional sequences comprehensively through experience and experiments alone has become impractical. By utilizing computational methods, especially artificial intelligence enhanced molecular dynamics (MD) simulation and de novo peptide design, there has been a significant expansion in the exploration of sequence space. Through these methods, a variety of supramolecular functional materials, including fibers, two-dimensional arrays, nanocages, etc., have been designed by meticulously controlling the inter- and intramolecular interactions. In this review, we first provide a brief overview of the current main computational methods and then focus on the computational design methods for various self-assembled peptide materials. Additionally, we introduce some representative protein self-assemblies to offer guidance for the design of self-assembling peptides.

Robust Design of Effective Allosteric Activators for Rsp5 E3 Ligase Using the Machine Learning Tool ProteinMPNN

We used the deep learning tool ProteinMPNN to redesign ubiquitin (Ub) as a specific and functionally stimulating/enhancing binder of the Rsp5 E3 ligase. We generated 20 extensively mutated─up to 37 of 76 residues─recombinant Ub variants (UbVs), named R1 to R20, displaying well-folded structures and high thermal stabilities. These UbVs can also form stable complexes with Rsp5, as predicted using AlphaFold2. Three of the UbVs bound to Rsp5 with low micromolar affinity, with R4 and R12 effectively enhancing the Rsp5 activity six folds. AlphaFold2 predicts that R4 and R12 bind to Rsp5's exosite in an identical manner to the Rsp5-Ub template, thereby allosterically activating Rsp5-Ub thioester formation. Thus, we present a virtual solution for rapidly and cost-effectively designing UbVs as functional modulators of Ub-related enzymes.

The ClusPro AbEMap web server for the prediction of antibody epitopes

Antibodies play an important role in the immune system by binding to molecules called antigens at their respective epitopes. These interfaces or epitopes are structural entities determined by the interactions between an antibody and an antigen, making them ideal systems to analyze by using docking programs. Since the advent of high-throughput antibody sequencing, the ability to perform epitope mapping using only the sequence of the antibody has become a high priority. ClusPro, a leading protein-protein docking server, together with its template-based modeling version, ClusPro-TBM, have been re-purposed to map epitopes for specific antibody-antigen interactions by using the Antibody Epitope Mapping server (AbEMap). ClusPro-AbEMap offers three different modes for users depending on the information available on the antibody as follows: (i) X-ray structure, (ii) computational/predicted model of the structure or (iii) only the amino acid sequence. The AbEMap server presents a likelihood score for each antigen residue of being part of the epitope. We provide detailed information on the server's capabilities for the three options and discuss how to obtain the best results. In light of the recent introduction of AlphaFold2 (AF2), we also show how one of the modes allows users to use their AF2-generated antibody models as input. The protocol describes the relative advantages of the server compared to other epitope-mapping tools, its limitations and potential areas of improvement. The server may take 45-90 min depending on the size of the proteins.

Predicting structures of large protein assemblies using combinatorial assembly algorithm and AlphaFold2

Deep learning models, such as AlphaFold2 and RosettaFold, enable high-accuracy protein structure prediction. However, large protein complexes are still challenging to predict due to their size and the complexity of interactions between multiple subunits. Here we present CombFold, a combinatorial and hierarchical assembly algorithm for predicting structures of large protein complexes utilizing pairwise interactions between subunits predicted by AlphaFold2. CombFold accurately predicted (TM-score > 0.7) 72% of the complexes among the Top-10 predictions in two datasets of 60 large, asymmetric assemblies. Moreover, the structural coverage of predicted complexes was 20% higher compared to corresponding PDB entries. We applied the method on complexes from Complex Portal with known stoichiometry but without known structure and obtained high-confidence predictions. CombFold supports the integration of distance restraints based on crosslinking mass spectrometry and fast enumeration of possible complex stoichiometries. CombFold's high accuracy makes it a promising tool for expanding structural coverage beyond monomeric proteins.

Critical Assessment of Methods for Predicting the 3D Structure of Proteins and Protein Complexes

Advances in a scientific discipline are often measured by small, incremental steps. In this review, we report on two intertwined disciplines in the protein structure prediction field, modeling of single chains and modeling of complexes, that have over decades emulated this pattern, as monitored by the community-wide blind prediction experiments CASP and CAPRI. However, over the past few years, dramatic advances were observed for the accurate prediction of single protein chains, driven by a surge of deep learning methodologies entering the prediction field. We review the mainscientific developments that enabled these recent breakthroughs and feature the important role of blind prediction experiments in building up and nurturing the structure prediction field. We discuss how the new wave of artificial intelligence-based methods is impacting the fields of computational and experimental structural biology and highlight areas in which deep learning methods are likely to lead to future developments, provided that major challenges are overcome.

Fast and versatile sequence-independent protein docking for nanomaterials design using RPXDock

Computationally designed multi-subunit assemblies have shown considerable promise for a variety of applications, including a new generation of potent vaccines. One of the major routes to such materials is rigid body sequence-independent docking of cyclic oligomers into architectures with point group or lattice symmetries. Current methods for docking and designing such assemblies are tailored to specific classes of symmetry and are difficult to modify for novel applications. Here we describe RPXDock, a fast, flexible, and modular software package for sequence-independent rigid-body protein docking across a wide range of symmetric architectures that is easily customizable for further development. RPXDock uses an efficient hierarchical search and a residue-pair transform (RPX) scoring method to rapidly search through multidimensional docking space. We describe the structure of the software, provide practical guidelines for its use, and describe the available functionalities including a variety of score functions and filtering tools that can be used to guide and refine docking results towards desired configurations.

Recent advances in predicting and modeling protein-protein interactions

Protein-protein interactions (PPIs) drive biological processes, and disruption of PPIs can cause disease. With recent breakthroughs in structure prediction and a deluge of genomic sequence data, computational methods to predict PPIs and model spatial structures of protein complexes are now approaching the accuracy of experimental approaches for permanent interactions and show promise for elucidating transient interactions. As we describe here, the key to this success is rich evolutionary information deciphered from thousands of homologous sequences that coevolve in interacting partners. This covariation signal, revealed by sophisticated statistical and machine learning (ML) algorithms, predicts physiological interactions. Accurate artificial intelligence (AI)-based modeling of protein structures promises to provide accurate 3D models of PPIs at a proteome-wide scale.

Protein-protein interfaces in molecular glue-induced ternary complexes: classification, characterization, and prediction

Molecular glues are a class of small molecules that stabilize the interactions between proteins. Naturally occurring molecular glues are present in many areas of biology where they serve as central regulators of signaling pathways. Importantly, several clinical compounds act as molecular glue degraders that stabilize interactions between E3 ubiquitin ligases and target proteins, leading to their degradation. Molecular glues hold promise as a new generation of therapeutic agents, including those molecular glue degraders that can redirect the protein degradation machinery in a precise way. However, rational discovery of molecular glues is difficult in part due to the lack of understanding of the protein-protein interactions they stabilize. In this review, we summarize the structures of known molecular glue-induced ternary complexes and the interface properties. Detailed analysis shows different mechanisms of ternary structure formation. Additionally, we also review computational approaches for predicting protein-protein interfaces and highlight the promises and challenges. This information will ultimately help inform future approaches for rational molecular glue discovery.

TRScore: a three-dimensional RepVGG-based scoring method for ranking protein docking models

MOTIVATION

Protein-protein interactions (PPI) play important roles in cellular activities. Due to the technical difficulty and high cost of experimental methods, there are considerable interests towards the development of computational approaches, such as protein docking, to decipher PPI patterns. One of the important and difficult aspects in protein docking is recognizing near-native conformations from a set of decoys, but unfortunately traditional scoring functions still suffer from limited accuracy. Therefore, new scoring methods are pressingly needed in methodological and/or practical implications.

RESULTS

We present a new deep learning-based scoring method for ranking protein-protein docking models based on a three-dimensional (3D) RepVGG network, named TRScore. To recognize near-native conformations from a set of decoys, TRScore voxelizes the protein-protein interface into a 3D grid labeled by the number of atoms in different physicochemical classes. Benefiting from the deep convolutional RepVGG architecture, TRScore can effectively capture the subtle differences between energetically favorable near-native models and unfavorable non-native decoys without needing extra information. TRScore was extensively evaluated on diverse test sets including protein-protein docking benchmark 5.0 update set, DockGround decoy set, as well as realistic CAPRI decoy set, and overall obtained a significant improvement over existing methods in cross validation and independent evaluations.

AVAILABILITY

Codes available at: https://github.com/BioinformaticsCSU/TRScore.

Residual behaviors and metabolic pathway of ethylparaben in Drosophila melanogaster

OBJECTIVE

Parabens are commonly used as preservatives in foodstuffs, cosmetics, and pharmaceutical products. The widespread use of parabens has led to their leaking into the environment. Concerns about the safety of parabens have recently increased due to their potential endocrine-disrupting effects as an emerging contaminant. Thus, it is necessary to study the metabolism of parabens in vivo.

METHODS

In this study, Drosophila melanogaster in males and females were exposed to ethylparaben (EP) concentration group (300 mg/L, 700 mg/L, and 1000 mg/L), and control group (0 mg/L) by the capillary feeding assay (CAFE). We quantified the activity of the detoxification-related carboxylesterase (CarE). The contents of EP metabolites in D. melanogaster, including p-hydroxybenzoic acid (PHBA), methylparaben (MP), and intact EP were carried out by high-performance liquid chromatography (HPLC). The regression model between EP metabolites (PHBA and MP) and CarE was developed using the Fourier series fitting method.

RESULTS

The general level of EP metabolites (PHBA, MP, and intact EP) accumulation was accounted for 5.6-11.5% in D. melanogaster. As EP accumulated, the activity of CarE increased, and the activity of CarE in females was higher than males, which is inconsistent with the result of EP intake dose. Additionally, there were significant differences in the proportion of EP metabolites between female and male flies, and the results of sex comparison were different depending on the EP treated groups and EP metabolites. In general, PHBA of EP hydrolytic product and MP of EP transesterification product in D. melanogaster were 41.4-63.9% and 10.4-24.6%, respectively. In terms of the rest of the EP existed in intact form and ranged from 22.4% to 34.0%. Moreover, the EP metabolites in the conjugated form were higher than those in the free form. The regression model between EP metabolites and CarE was established, showing that the CarE activity can be used to estimate the content of PHBA and MP.

CONCLUSION

The result indicates that the EP can accumulate in the body through food. Hydrolysis is the main metabolic pathway of EP in D. melanogaster, and transesterification is another metabolic pathway of EP. Additionally, the EP metabolites in flies mainly exist in conjugated form. Furthermore, the Fourier series fitting method model between EP metabolites and CarE, providing theoretical support to study the dose-effect relationship between metabolites of parabens and CarE. This study not only provides a mathematical basis for the safety evaluation of parabens, but also provides support for the further study of the toxicological effects of parabens.

Klotho upregulates the interaction between RANK and TRAF6 to facilitate RANKL-induced osteoclastogenesis via the NF-κB signaling pathway

Background

α-Klotho (Klotho) plays a wide range of roles in pathophysiological processes, such as low-turnover osteoporosis observed in klotho mutant mice (kl/kl mice). However, the precise function and underlying mechanism of klotho during osteoclastogenesis are not fully understood. Here, we investigated the effects of klotho on osteoclastogenesis induced by receptor activator of nuclear factor kappa-B ligand (RANKL).

Methods

The effects of klotho deficiency on osteoclastogenesis were explored using kl/kl mice both in vivo and in vitro. In in vitro experiments, lentivirus transfection, real-time quantitative PCR (RT-qPCR) analysis, western blot analysis, immunostaining, RNA-seq analysis, differential pathway analysis, Energy-based protein docking analysis and co-immunoprecipitation were used for deeply investigating the effects of klotho on RANKL-induced Osteoclastogenesis and the underlying mechanism.

Results

We found that klotho deficiency impaired osteoclastogenesis. Furthermore, in vitro studies revealed that klotho facilitated osteoclastogenesis and upregulated the expression of c-Fos and nuclear factor of activated T cells cytoplasmic 1 (NFATc1) during osteoclastogenesis. Mechanistically, we confirmed that klotho co-localized with nuclear factor kappa B (RANK) and facilitated the interaction between activated RANK and TNFR-associated factor 6 (TRAF6), thus klotho exerts its function in osteoclastogenesis through the activation of the NF-κB signaling pathway.

Conclusions

Klotho promotes RANKL-induced osteoclastogenesis through upregulating the interaction between RANK and TARF6, Targeting on klotho may be an attractive therapeutic method for osteopenic diseases.

Protein-Protein Docking: Past, Present, and Future

The biological significance of proteins attracted the scientific community in exploring their characteristics. The studies shed light on the interaction patterns and functions of proteins in a living body. Due to their practical difficulties, reliable experimental techniques pave the way for introducing computational methods in the interaction prediction. Automated methods reduced the difficulties but could not yet replace experimental studies as the field is still evolving. Interaction prediction problem being critical needs highly accurate results, but none of the existing methods could offer reliable performance that can parallel with experimental results yet. This article aims to assess the existing computational docking algorithms, their challenges, and future scope. Blind docking techniques are quite helpful when no information other than the individual structures are available. As more and more complex structures are being added to different databases, information-driven approaches can be a good alternative. Artificial intelligence, ruling over the major fields, is expected to take over this domain very shortly.

InterPepRank: Assessment of Docked Peptide Conformations by a Deep Graph Network

Peptide-protein interactions between a smaller or disordered peptide stretch and a folded receptor make up a large part of all protein-protein interactions. A common approach for modeling such interactions is to exhaustively sample the conformational space by fast-Fourier-transform docking, and then refine a top percentage of decoys. Commonly, methods capable of ranking the decoys for selection fast enough for larger scale studies rely on first-principle energy terms such as electrostatics, Van der Waals forces, or on pre-calculated statistical potentials. We present InterPepRank for peptide-protein complex scoring and ranking. InterPepRank is a machine learning-based method which encodes the structure of the complex as a graph; with physical pairwise interactions as edges and evolutionary and sequence features as nodes. The graph network is trained to predict the LRMSD of decoys by using edge-conditioned graph convolutions on a large set of peptide-protein complex decoys. InterPepRank is tested on a massive independent test set with no targets sharing CATH annotation nor 30% sequence identity with any target in training or validation data. On this set, InterPepRank has a median AUC of 0.86 for finding coarse peptide-protein complexes with LRMSD < 4Å. This is an improvement compared to other state-of-the-art ranking methods that have a median AUC between 0.65 and 0.79. When included as a selection-method for selecting decoys for refinement in a previously established peptide docking pipeline, InterPepRank improves the number of medium and high quality models produced by 80% and 40%, respectively. The InterPepRank program as well as all scripts for reproducing and retraining it are available from: http://wallnerlab.org/InterPepRank.

Protein-protein interactions at a glance: Protocols for the visualization of biomolecular interactions

Protein-protein interactions (PPIs) play a key role in many biological processes and are intriguing targets for drug discovery campaigns. Advancements in experimental and computational techniques are leading to a growth of data accessibility, and, with it, an increased need for the analysis of PPIs. In this respect, visualization tools are essential instruments to represent and analyze biomolecular interactions. In this chapter, we reviewed some of the available tools, highlighting their features, and describing their functions with practical information on their usage.

Protein Docking Model Evaluation by Graph Neural Networks

Physical interactions of proteins play key functional roles in many important cellular processes. To understand molecular mechanisms of such functions, it is crucial to determine the structure of protein complexes. To complement experimental approaches, which usually take a considerable amount of time and resources, various computational methods have been developed for predicting the structures of protein complexes. In computational modeling, one of the challenges is to identify near-native structures from a large pool of generated models. Here, we developed a deep learning-based approach named Graph Neural Network-based DOcking decoy eValuation scorE (GNN-DOVE). To evaluate a protein docking model, GNN-DOVE extracts the interface area and represents it as a graph. The chemical properties of atoms and the inter-atom distances are used as features of nodes and edges in the graph, respectively. GNN-DOVE was trained, validated, and tested on docking models in the Dockground database and further tested on a combined dataset of Dockground and ZDOCK benchmark as well as a CAPRI scoring dataset. GNN-DOVE performed better than existing methods, including DOVE, which is our previous development that uses a convolutional neural network on voxelized structure models.

Advances to tackle backbone flexibility in protein docking

Computational docking methods can provide structural models of protein-protein complexes, but protein backbone flexibility upon association often thwarts accurate predictions. In recent blind challenges, medium or high accuracy models were submitted in less than 20% of the 'difficult' targets (with significant backbone change or uncertainty). Here, we describe recent developments in protein-protein docking and highlight advances that tackle backbone flexibility. In molecular dynamics and Monte Carlo approaches, enhanced sampling techniques have reduced time-scale limitations. Internal coordinate formulations can now capture realistic motions of monomers and complexes using harmonic dynamics. And machine learning approaches adaptively guide docking trajectories or generate novel binding site predictions from deep neural networks trained on protein interfaces. These tools poise the field to break through the longstanding challenge of correctly predicting complex structures with significant conformational change.

Protein docking model evaluation by 3D deep convolutional neural networks

MOTIVATION

Many important cellular processes involve physical interactions of proteins. Therefore, determining protein quaternary structures provide critical insights for understanding molecular mechanisms of functions of the complexes. To complement experimental methods, many computational methods have been developed to predict structures of protein complexes. One of the challenges in computational protein complex structure prediction is to identify near-native models from a large pool of generated models.

RESULTS

We developed a convolutional deep neural network-based approach named DOcking decoy selection with Voxel-based deep neural nEtwork (DOVE) for evaluating protein docking models. To evaluate a protein docking model, DOVE scans the protein-protein interface of the model with a 3D voxel and considers atomic interaction types and their energetic contributions as input features applied to the neural network. The deep learning models were trained and validated on docking models available in the ZDock and DockGround databases. Among the different combinations of features tested, almost all outperformed existing scoring functions.

AVAILABILITY AND IMPLEMENTATION

Codes available at http://github.com/kiharalab/DOVE, http://kiharalab.org/dove/.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

Macromolecular modeling and design in Rosetta: recent methods and frameworks

The Rosetta software for macromolecular modeling, docking and design is extensively used in laboratories worldwide. During two decades of development by a community of laboratories at more than 60 institutions, Rosetta has been continuously refactored and extended. Its advantages are its performance and interoperability between broad modeling capabilities. Here we review tools developed in the last 5 years, including over 80 methods. We discuss improvements to the score function, user interfaces and usability. Rosetta is available at http://www.rosettacommons.org.

Accelerated CDOCKER with GPUs, Parallel Simulated Annealing, and Fast Fourier Transforms

Fast Fourier transform (FFT)-based protein ligand docking together with parallel simulated annealing for both rigid and flexible receptor docking are implemented on graphical processing unit (GPU) accelerated platforms to significantly enhance the throughput of the CDOCKER and flexible CDOCKER - the docking algorithms in the CHARMM program for biomolecule modeling. The FFT-based approach for docking, first applied in protein-protein docking to efficiently search for the binding position and orientation of proteins, is adapted here to search ligand translational and rotational spaces given a ligand conformation in protein-ligand docking. Running on GPUs, our implementation of FFT docking in CDOCKER achieves a 15 000 fold speedup in the ligand translational and rotational space search in protein-ligand docking problems. With this significant speedup it becomes practical to exhaustively search ligand translational and rotational space when docking a rigid ligand into a protein receptor. We demonstrate in this paper that this provides an efficient way to calculate an upper bound for docking accuracy in the assessment of scoring functions for protein-ligand docking, which can be useful for improving scoring functions. The parallel molecular dynamics (MD) simulated annealing, also running on GPUs, aims to accelerate the search algorithm in CDOCKER by running MD simulated annealing in parallel on GPUs. When utilized as part of the general CDOCKER docking protocol, acceleration in excess of 20 times is achieved. With this acceleration, we demonstrate that the performance of CDOCKER for redocking is significantly improved compared with three other popular protein-ligand docking programs on two widely used protein ligand complex data sets: the Astex diverse set and the SB2012 test set. The flexible CDOCKER is similarly improved by the parallel MD simulated annealing on GPUs. Based on the results presented here, we suggest that the accelerated CDOCKER platform provides a highly competitive docking engine for both rigid-receptor and flexible-receptor docking studies and will further facilitate continued improvement in the physics-based scoring function employed in CDOCKER docking studies.

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.

Performance and enhancement of the LZerD protein assembly pipeline in CAPRI 38-46

We report the performance of the protein docking prediction pipeline of our group and the results for Critical Assessment of Prediction of Interactions (CAPRI) rounds 38-46. The pipeline integrates programs developed in our group as well as other existing scoring functions. The core of the pipeline is the LZerD protein-protein docking algorithm. If templates of the target complex are not found in PDB, the first step of our docking prediction pipeline is to run LZerD for a query protein pair. Meanwhile, in the case of human group prediction, we survey the literature to find information that can guide the modeling, such as protein-protein interface information. In addition to any literature information and binding residue prediction, generated docking decoys were selected by a rank aggregation of statistical scoring functions. The top 10 decoys were relaxed by a short molecular dynamics simulation before submission to remove atom clashes and improve side-chain conformations. In these CAPRI rounds, our group, particularly the LZerD server, showed robust performance. On the other hand, there are failed cases where some other groups were successful. To understand weaknesses of our pipeline, we analyzed sources of errors for failed targets. Since we noted that structure refinement is a step that needs improvement, we newly performed a comparative study of several refinement approaches. Finally, we show several examples that illustrate successful and unsuccessful cases by our group.

Template-based modeling by ClusPro in CASP13 and the potential for using co-evolutionary information in docking

As a participant in the joint CASP13-CAPRI46 assessment, the ClusPro server debuted its new template-based modeling functionality. The addition of this feature, called ClusPro TBM, was motivated by the previous CASP-CAPRI assessments and by the proven ability of template-based methods to produce higher-quality models, provided templates are available. In prior assessments, ClusPro submissions consisted of models that were produced via free docking of pre-generated homology models. This method was successful in terms of the number of acceptable predictions across targets; however, analysis of results showed that purely template-based methods produced a substantially higher number of medium-quality models for targets for which there were good templates available. The addition of template-based modeling has expanded ClusPro's ability to produce higher accuracy predictions, primarily for homomeric but also for some heteromeric targets. Here we review the newest additions to the ClusPro web server and discuss examples of CASP-CAPRI targets that continue to drive further development. We also describe ongoing work not yet implemented in the server. This includes the development of methods to improve template-based models and the use of co-evolutionary information for data-assisted free docking.

Exploring protein-protein interactions using the site-identification by ligand competitive saturation methodology

Protein docking methods are powerful computational tools to study protein-protein interactions (PPI). While a significant number of docking algorithms have been developed, they are usually based on rigid protein models or with limited considerations of protein flexibility and the desolvation effect is rarely considered in docking energy functions, which may lower the accuracy of the predictions. To address these issues, we introduce a PPI energy function based on the site-identification by ligand competitive saturation (SILCS) framework and utilize the fast Fourier transform (FFT) correlation approach. The free energy content of the SILCS FragMaps represent an alternative to traditional energy grids and they can be efficiently utilized to guide FFT-based protein docking. Application of the approach to eight diverse test cases, including seven from Protein Docking Benchmark 5.0, showed the PPI prediction using SILCS approach (SILCS-PPI) to be competitive with several commonly used protein docking methods indicating that the method has the ability to both qualitatively and quantitatively inform the prediction of PPI. Results show the utility of the SILCS-PPI docking approach for determination of probability distributions of PPI interactions over the surface of both partner proteins, allowing for identification of alternate binding poses. Such binding poses are confirmed by experimental crystal contacts in our test cases. While more computationally demanding than available PPI docking technologies, we anticipate that the SILCS-PPI docking approach will offer an alternative methodology for improved evaluation of PPIs that could be used in a variety of fields from systems biology to excipient design for biologics-based drugs.

LightDock: a new multi-scale approach to protein-protein docking

Motivation

Computational prediction of protein-protein complex structure by docking can provide structural and mechanistic insights for protein interactions of biomedical interest. However, current methods struggle with difficult cases, such as those involving flexible proteins, low-affinity complexes or transient interactions. A major challenge is how to efficiently sample the structural and energetic landscape of the association at different resolution levels, given that each scoring function is often highly coupled to a specific type of search method. Thus, new methodologies capable of accommodating multi-scale conformational flexibility and scoring are strongly needed.

Results

We describe here a new multi-scale protein-protein docking methodology, LightDock, capable of accommodating conformational flexibility and a variety of scoring functions at different resolution levels. Implicit use of normal modes during the search and atomic/coarse-grained combined scoring functions yielded improved predictive results with respect to state-of-the-art rigid-body docking, especially in flexible cases.

Availability and implementation

The source code of the software and installation instructions are available for download at https://life.bsc.es/pid/lightdock/.

Contact

juanf@bsc.es.

Supplementary information

Supplementary data are available at Bioinformatics online.

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

Protein-RNA Docking Using ICM

Protein-RNA interactions play an important role in many biological processes. Computational methods such as docking have been developed to complement existing biophysical and structural biology techniques. Computational prediction of protein-RNA complex structures includes two steps: generating candidate structures from the individual protein and RNA parts and scoring the generated poses to pick out the correct one. In this work, we considered three recently developed data sets of protein-RNA complexes to evaluate and improve the performance of the FFT-based rigid-body docking algorithm implemented in the ICM package. An electrostatic term describing interactions between negatively charged phosphate groups and positively charged protein residues was added to the energy function used during the docking step to take into account the greater role that electrostatic interactions play in protein-RNA complexes. Next, the docking results were used to optimize a scoring function including van der Waals, electrostatic, and solvation terms. This optimization yielded a much smaller weight for the solvation term indicating that solvation energy may be less important for the scoring of protein-RNA structures. Rescoring of the generated poses with the new scoring function led to much higher success rates, while pose clustering by contact fingerprints produced further improvements, achieving a success rate of 0.66 for the top 100 structures.

Determining the minimum number of protein-protein interactions required to support known protein complexes

The prediction of protein complexes from protein-protein interactions (PPIs) is a well-studied problem in bioinformatics. However, the currently available PPI data is not enough to describe all known protein complexes. In this paper, we express the problem of determining the minimum number of (additional) required protein-protein interactions as a graph theoretic problem under the constraint that each complex constitutes a connected component in a PPI network. For this problem, we develop two computational methods: one is based on integer linear programming (ILPMinPPI) and the other one is based on an existing greedy-type approximation algorithm (GreedyMinPPI) originally developed in the context of communication and social networks. Since the former method is only applicable to datasets of small size, we apply the latter method to a combination of the CYC2008 protein complex dataset and each of eight PPI datasets (STRING, MINT, BioGRID, IntAct, DIP, BIND, WI-PHI, iRefIndex). The results show that the minimum number of additional required PPIs ranges from 51 (STRING) to 964 (BIND), and that even the four best PPI databases, STRING (51), BioGRID (67), WI-PHI (93) and iRefIndex (85), do not include enough PPIs to form all CYC2008 protein complexes. We also demonstrate that the proposed problem framework and our solutions can enhance the prediction accuracy of existing PPI prediction methods. ILPMinPPI can be freely downloaded from http://sunflower.kuicr.kyoto-u.ac.jp/~nakajima/.

Optimal Alignment of Structures for Finite and Periodic Systems

Finding the optimal alignment between two structures is important for identifying the minimum root-mean-square distance (RMSD) between them and as a starting point for calculating pathways. Most current algorithms for aligning structures are stochastic, scale exponentially with the size of structure, and the performance can be unreliable. We present two complementary methods for aligning structures corresponding to isolated clusters of atoms and to condensed matter described by a periodic cubic supercell. The first method (Go-PERMDIST), a branch and bound algorithm, locates the global minimum RMSD deterministically in polynomial time. The run time increases for larger RMSDs. The second method (FASTOVERLAP) is a heuristic algorithm that aligns structures by finding the global maximum kernel correlation between them using fast Fourier transforms (FFTs) and fast SO(3) transforms (SOFTs). For periodic systems, FASTOVERLAP scales with the square of the number of identical atoms in the system, reliably finds the best alignment between structures that are not too distant, and shows significantly better performance than existing algorithms. The expected run time for Go-PERMDIST is longer than FASTOVERLAP for periodic systems. For finite clusters, the FASTOVERLAP algorithm is competitive with existing algorithms. The expected run time for Go-PERMDIST to find the global RMSD between two structures deterministically is generally longer than for existing stochastic algorithms. However, with an earlier exit condition, Go-PERMDIST exhibits similar or better performance.

The ClusPro web server for protein-protein docking

The ClusPro server (https://cluspro.org) is a widely used tool for protein-protein docking. The server provides a simple home page for basic use, requiring only two files in Protein Data Bank (PDB) format. However, ClusPro also offers a number of advanced options to modify the search; these include the removal of unstructured protein regions, application of attraction or repulsion, accounting for pairwise distance restraints, construction of homo-multimers, consideration of small-angle X-ray scattering (SAXS) data, and location of heparin-binding sites. Six different energy functions can be used, depending on the type of protein. Docking with each energy parameter set results in ten models defined by centers of highly populated clusters of low-energy docked structures. This protocol describes the use of the various options, the construction of auxiliary restraints files, the selection of the energy parameters, and the analysis of the results. Although the server is heavily used, runs are generally completed in <4 h.

The ClusPro web server for protein-protein docking

The ClusPro server (https://cluspro.org) is a widely used tool for protein-protein docking. The server provides a simple home page for basic use, requiring only two files in Protein Data Bank (PDB) format. However, ClusPro also offers a number of advanced options to modify the search; these include the removal of unstructured protein regions, application of attraction or repulsion, accounting for pairwise distance restraints, construction of homo-multimers, consideration of small-angle X-ray scattering (SAXS) data, and location of heparin-binding sites. Six different energy functions can be used, depending on the type of protein. Docking with each energy parameter set results in ten models defined by centers of highly populated clusters of low-energy docked structures. This protocol describes the use of the various options, the construction of auxiliary restraints files, the selection of the energy parameters, and the analysis of the results. Although the server is heavily used, runs are generally completed in <4 h.

New additions to the ClusPro server motivated by CAPRI

The heavily used protein-protein docking server ClusPro performs three computational steps as follows: (1) rigid body docking, (2) RMSD based clustering of the 1000 lowest energy structures, and (3) the removal of steric clashes by energy minimization. In response to challenges encountered in recent CAPRI targets, we added three new options to ClusPro. These are (1) accounting for small angle X-ray scattering data in docking; (2) considering pairwise interaction data as restraints; and (3) enabling discrimination between biological and crystallographic dimers. In addition, we have developed an extremely fast docking algorithm based on 5D rotational manifold FFT, and an algorithm for docking flexible peptides that include known sequence motifs. We feel that these developments will further improve the utility of ClusPro. However, CAPRI emphasized several shortcomings of the current server, including the problem of selecting the right energy parameters among the five options provided, and the problem of selecting the best models among the 10 generated for each parameter set. In addition, results convinced us that further development is needed for docking homology models. Finally, we discuss the difficulties we have encountered when attempting to develop a refinement algorithm that would be computationally efficient enough for inclusion in a heavily used server. Proteins 2017; 85:435-444. © 2016 Wiley Periodicals, Inc.