Ligand-binding site prediction using ligand-interacting and binding site-enriched protein triangles

Fisetin 8-C-glucoside as entry inhibitor in SARS CoV-2 infection: molecular modelling study

Coronaviruses are RNA viruses that infect varied species including humans. TMPRSS2 is gateway for SARS CoV-2 entry into the host cell. It causes proteolytic activation of spike protein and discharge of the peptide into host cell. The TMPRSS2 inhibition could be one of the approaches to stop the viral entry, therefore, interaction pattern and binding energies for Fisetin and TMPRSS2 have been explored in the present study. TMPRSS2 peptide was used for homology modelling and then for further study. Molecular docking score and MMGBSA Binding energy of Fisetin was better than Nafamostat, a known inhibitor of TMPRSS2. Post docking MM-GBSA free energy for Fisetin and Nafamostat was -42.78 and -21.11 kcal/mol, respectively. Fisetin forms H bond with Val 25, His 41, Lys 42, Lys 45, Glu 44, Ser186. Nafamostat formed H bonds with Lys 85, Asp 90, Asp 203. RMSD plots of TMPRSS2, TMPRSS2-Fisetin and TMPRSS2-Nafamostat complex showed stable profile with very small fluctuation during entire simulation of 150 ns. Significant decrease in TMPRSS2-Fisetin and TMPRSS2-Nafamostat complex fluctuation occurred around His 41, Glu 44, Gly 136, Ser 186 in RMSF study. During simulation Fisetin interaction was observed with residues Val 25, His 41, Glu 44, Lys 45, Lys 87, Gly 136, Gln 183, Ser 186 likewise interaction of Nafamostat with Lys 85, Asp 90, Asn 163, Asp 203 and Ser 205. Post simulation MM-GBSA free energy was found to be -51.87 ± 4.3 and -48.23 ± 4.39 kcal/mol for TMPRSS2 with Fisetin and Nafamostat, respectively.Communicated by Ramaswamy H. Sarma.

DeepPocket: Ligand Binding Site Detection and Segmentation using 3D Convolutional Neural Networks

A structure-based drug design pipeline involves the development of potential drug molecules or ligands that form stable complexes with a given receptor at its binding site. A prerequisite to this is finding druggable and functionally relevant binding sites on the 3D structure of the protein. Although several methods for detecting binding sites have been developed beforehand, a majority of them surprisingly fail in the identification and ranking of binding sites accurately. The rapid adoption and success of deep learning algorithms in various sections of structural biology beckons the usage of such algorithms for accurate binding site detection. As a combination of geometry based software and deep learning, we report a novel framework, DeepPocket that utilizes 3D convolutional neural networks for the rescoring of pockets identified by Fpocket and further segments these identified cavities on the protein surface. Apart from this, we also propose another data set SC6K containing protein structures submitted in the Protein Data Bank (PDB) from January 1st, 2018, until February 28th, 2020, for ligand binding site (LBS) detection. DeepPocket's results on various binding site data sets and SC6K highlight its better performance over current state-of-the-art methods and good generalization ability over novel structures.

Phosphate binding sites prediction in phosphorylation-dependent protein-protein interactions

MOTIVATION

Phosphate binding plays an important role in modulating protein-protein interactions, which are ubiquitous in various biological processes. Accurate prediction of phosphate binding sites is an important but challenging task. Small size and diversity of phosphate binding sites lead to a substantial challenge for developing accurate prediction methods.

RESULTS

Here we present the phosphate binding site predictor (PBSP), a novel and accurate approach to identifying phosphate binding sites from protein structures. PBSP combines an energy-based ligand-binding sites identification method with reverse focused docking using a phosphate probe. We show that PBSP outperforms not only general ligand binding sites predictors but also other existing phospholigand-specific binding sites predictors. It achieves ∼95% success rate for top 10 predicted sites with an average Matthews correlation coefficient (MCC) value of 0.84 for successful predictions. PBSP can accurately predict phosphate binding modes, with average position error of 1.4 Å and 2.4 Å in bound and unbound datasets, respectively. Lastly, visual inspection of the predictions is conducted. Reasons for failed predictions are further analyzed and possible ways to improve the performance are provided. These results demonstrate a novel and accurate approach to phosphate binding sites identification in protein structures.

AVAILABILITY

The software and benchmark datasets are freely available at http://web.pkusz.edu.cn/wu/PBSP/.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

DeepDISE: DNA Binding Site Prediction Using a Deep Learning Method

It is essential for future research to develop a new, reliable prediction method of DNA binding sites because DNA binding sites on DNA-binding proteins provide critical clues about protein function and drug discovery. However, the current prediction methods of DNA binding sites have relatively poor accuracy. Using 3D coordinates and the atom-type of surface protein atom as the input, we trained and tested a deep learning model to predict how likely a voxel on the protein surface is to be a DNA-binding site. Based on three different evaluation datasets, the results show that our model not only outperforms several previous methods on two commonly used datasets, but also demonstrates its robust performance to be consistent among the three datasets. The visualized prediction outcomes show that the binding sites are also mostly located in correct regions. We successfully built a deep learning model to predict the DNA binding sites on target proteins. It demonstrates that 3D protein structures plus atom-type information on protein surfaces can be used to predict the potential binding sites on a protein. This approach should be further extended to develop the binding sites of other important biological molecules.

Proteins and Their Interacting Partners: An Introduction to Protein-Ligand Binding Site Prediction Methods with a Focus on FunFOLD3

Proteins are essential molecules with a diverse range of functions; elucidating their biological and biochemical characteristics can be difficult and time consuming using in vitro and/or in vivo methods. Additionally, in vivo protein-ligand binding site elucidation is unable to keep place with current growth in sequencing, leaving the majority of new protein sequences without known functions. Therefore, the development of new methods, which aim to predict the protein-ligand interactions and ligand-binding site residues directly from amino acid sequences, is becoming increasingly important. In silico prediction can utilise either sequence information, structural information or a combination of both. In this chapter, we will discuss the broad range of methods for ligand-binding site prediction from protein structure and we will describe our method, FunFOLD3, for the prediction of protein-ligand interactions and ligand-binding sites based on template-based modelling. Additionally, we will describe the step-by-step instructions using the FunFOLD3 downloadable application along with examples from the Critical Assessment of Techniques for Protein Structure Prediction (CASP) where FunFOLD3 has been used to aid ligand and ligand-binding site prediction. Finally, we will introduce our newer method, FunFOLD3-D, a version of FunFOLD3 which aims to improve template-based protein-ligand binding site prediction through the integration of docking, using AutoDock Vina.

Predicting binding sites from unbound versus bound protein structures

We present the application of seven binding-site prediction algorithms to a meticulously curated dataset of ligand-bound and ligand-free crystal structures for 304 unique protein sequences (2528 crystal structures). We probe the influence of starting protein structures on the results of binding-site prediction, so the dataset contains a minimum of two ligand-bound and two ligand-free structures for each protein. We use this dataset in a brief survey of five geometry-based, one energy-based, and one machine-learning-based methods: Surfnet, Ghecom, LIGSITE_csc, Fpocket, Depth, AutoSite, and Kalasanty. Distributions of the F scores and Matthew’s correlation coefficients for ligand-bound versus ligand-free structure performance show no statistically significant difference in structure type versus performance for most methods. Only Fpocket showed a statistically significant but low magnitude enhancement in performance for holo structures. Lastly, we found that most methods will succeed on some crystal structures and fail on others within the same protein family, despite all structures being relatively high-quality structures with low structural variation. We expected better consistency across varying protein conformations of the same sequence. Interestingly, the success or failure of a given structure cannot be predicted by quality metrics such as resolution, Cruickshank Diffraction Precision index, or unresolved residues. Cryptic sites were also examined.

A Pilot Study of All-Computational Drug Design Protocol-From Structure Prediction to Interaction Analysis

Speeding up the drug discovery process is of great significance. To achieve that, high-efficiency methods should be exploited. The conventional wet-bench methods hardly meet the high-speed demand due to time-consuming experiments. Conversely, in silico approaches are much more efficient for drug discovery and design. However, in silico approaches usually serve as a supportive role in research processes. To fully exert the strength of computational methods, we propose a protocol which integrates various in silico approaches, from de novo protein structure prediction to ligand-protein interaction simulation. As a proof of concept, human SK2/calmodulin complex was used as a target for validation. First, we obtained a predicted structure of SK2/calmodulin and predicted binding sites which were consistent with the literature data. Then we investigated the ligand-protein interaction via virtual mutagenesis, flexible docking, and binding affinity calculation. As a result, the binding energies of mutants have similar trends compared with the EC₅₀ values (R = 0.6 for NS309 in V481 mutants). The results indicate that our protocol can be applied to the drug design of structure unknown proteins. Our study also demonstrates that the integration of in silico approaches is feasible and it facilitates the acceleration of new drug discovery.

Investigation of Crystal Structures in Structure-Based Virtual Screening for Protein Kinase Inhibitors

Protein kinases are important drug targets in several therapeutic areas ,and structure-based virtual screening (SBVS) is an important strategy in discovering lead compounds for kinase targets. However, there are multiple crystal structures available for each target, and determining which one is the most favorable is a key step in molecular docking for SBVS due to the ligand induce-fit effect. This work aimed to find the most desirable crystal structures for molecular docking by a comprehensive analysis of the protein kinase database which covers 190 different kinases from all eight main kinase families. Through an integrated self-docking and cross-docking evaluation, 86 targets were eventually evaluated on a total of 2608 crystal structures. Results showed that molecular docking has great capability in reproducing conformation of crystallized ligands and for each target, the most favorable crystal structure was selected, and the AGC family outperformed the other family targets based on RMSD comparison. In addition, RMSD values, GlideScore, and corresponding bioactivity data were compared and demonstrated certain relationships. This work provides great convenience for researchers to directly select the optimal crystal structure in SBVS-based kinase drug design and further validates the effectiveness of molecular docking in drug discovery.

P2Rank: machine learning based tool for rapid and accurate prediction of ligand binding sites from protein structure

Background

Ligand binding site prediction from protein structure has many applications related to elucidation of protein function and structure based drug discovery. It often represents only one step of many in complex computational drug design efforts. Although many methods have been published to date, only few of them are suitable for use in automated pipelines or for processing large datasets. These use cases require stability and speed, which disqualifies many of the recently introduced tools that are either template based or available only as web servers.

Results

We present P2Rank, a stand-alone template-free tool for prediction of ligand binding sites based on machine learning. It is based on prediction of ligandability of local chemical neighbourhoods that are centered on points placed on the solvent accessible surface of a protein. We show that P2Rank outperforms several existing tools, which include two widely used stand-alone tools (Fpocket, SiteHound), a comprehensive consensus based tool (MetaPocket 2.0), and a recent deep learning based method (DeepSite). P2Rank belongs to the fastest available tools (requires under 1 s for prediction on one protein), with additional advantage of multi-threaded implementation.

Conclusions

P2Rank is a new open source software package for ligand binding site prediction from protein structure. It is available as a user-friendly stand-alone command line program and a Java library. P2Rank has a lightweight installation and does not depend on other bioinformatics tools or large structural or sequence databases. Thanks to its speed and ability to make fully automated predictions, it is particularly well suited for processing large datasets or as a component of scalable structural bioinformatics pipelines.

Electronic supplementary material

The online version of this article (10.1186/s13321-018-0285-8) contains supplementary material, which is available to authorized users.

Discovery of Nicotinamide Adenine Dinucleotide Binding Proteins in the Escherichia coli Proteome Using a Combined Energetic- and Structural-Bioinformatics-Based Approach

Protein-ligand interaction plays a critical role in regulating the biochemical functions of proteins. Discovering protein targets for ligands is vital to new drug development. Here, we present a strategy that combines experimental and computational approaches to identify ligand-binding proteins in a proteomic scale. For the experimental part, we coupled pulse proteolysis with filter-assisted sample preparation (FASP) and quantitative mass spectrometry. Under denaturing conditions, ligand binding affected protein stability, which resulted in altered protein abundance after pulse proteolysis. For the computational part, we used the software Patch-Surfer2.0. We applied the integrated approach to identify nicotinamide adenine dinucleotide (NAD)-binding proteins in the Escherichia coli proteome, which has over 4200 proteins. Pulse proteolysis and Patch-Surfer2.0 identified 78 and 36 potential NAD-binding proteins, respectively, including 12 proteins that were consistently detected by the two approaches. Interestingly, the 12 proteins included 8 that are not previously known as NAD binders. Further validation of these eight proteins showed that their binding affinities to NAD computed by AutoDock Vina are higher than their cognate ligands and also that their protein ratios in the pulse proteolysis are consistent with known NAD-binding proteins. These results strongly suggest that these eight proteins are indeed newly identified NAD binders.

Improving the performance of the PLB index for ligand-binding site prediction using dihedral angles and the solvent-accessible surface area

Protein ligand-binding site prediction is highly important for protein function determination and structure-based drug design. Over the past twenty years, dozens of computational methods have been developed to address this problem. Soga et al. identified ligand cavities based on the preferences of amino acids for the ligand-binding site (RA) and proposed the propensity for ligand binding (PLB) index to rank the cavities on the protein surface. However, we found that residues exhibit different RAs in response to changes in solvent exposure. Furthermore, previous studies have suggested that some dihedral angles of amino acids in specific regions of the Ramachandran plot are preferred at the functional sites of proteins. Based on these discoveries, the amino acid solvent-accessible surface area and dihedral angles were combined with the RA and PLB to obtain two new indexes, multi-factor RA (MF-RA) and multi-factor PLB (MF-PLB). MF-PLB, PLB and other methods were tested using two benchmark databases and two particular ligand-binding sites. The results show that MF-PLB can improve the success rate of PLB for both ligand-bound and ligand-unbound structures, particularly for top choice prediction.

Computational predictions suggest that structural similarity in viral polymerases may lead to comparable allosteric binding sites

The identification of ligand-binding sites is often the first step in drug targeting and design. To date there are numerous computational tools available to predict ligand binding sites. These tools can guide or mitigate the need for experimental methods to identify binding sites, which often require significant resources and time. Here, we evaluate four ligand-binding site predictor (LBSP) tools for their ability to predict allosteric sites within the Hepatitis C Virus (HCV) polymerase. Our results show that the LISE LBSP is able to identify all three target allosteric sites within the HCV polymerase as well as a known allosteric site in the Coxsackievirus polymerase. LISE was then employed to identify novel binding sites within the polymerases of the Dengue, West Nile, and Foot-and-mouth Disease viruses. Our results suggest that all three viral polymerases have putative sites that share structural or chemical similarities with allosteric pockets of the HCV polymerase. Thus, these binding locations may represent an evolutionarily conserved structural feature of several viral polymerases that could be exploited for the development of small molecule therapeutics.

Predicting Ligand Binding Sites on Protein Surfaces by 3-Dimensional Probability Density Distributions of Interacting Atoms

Predicting ligand binding sites (LBSs) on protein structures, which are obtained either from experimental or computational methods, is a useful first step in functional annotation or structure-based drug design for the protein structures. In this work, the structure-based machine learning algorithm ISMBLab-LIG was developed to predict LBSs on protein surfaces with input attributes derived from the three-dimensional probability density maps of interacting atoms, which were reconstructed on the query protein surfaces and were relatively insensitive to local conformational variations of the tentative ligand binding sites. The prediction accuracy of the ISMBLab-LIG predictors is comparable to that of the best LBS predictors benchmarked on several well-established testing datasets. More importantly, the ISMBLab-LIG algorithm has substantial tolerance to the prediction uncertainties of computationally derived protein structure models. As such, the method is particularly useful for predicting LBSs not only on experimental protein structures without known LBS templates in the database but also on computationally predicted model protein structures with structural uncertainties in the tentative ligand binding sites.

bSiteFinder, an improved protein-binding sites prediction server based on structural alignment: more accurate and less time-consuming

MOTIVATION

Protein-binding sites prediction lays a foundation for functional annotation of protein and structure-based drug design. As the number of available protein structures increases, structural alignment based algorithm becomes the dominant approach for protein-binding sites prediction. However, the present algorithms underutilize the ever increasing numbers of three-dimensional protein-ligand complex structures (bound protein), and it could be improved on the process of alignment, selection of templates and clustering of template. Herein, we built so far the largest database of bound templates with stringent quality control. And on this basis, bSiteFinder as a protein-binding sites prediction server was developed.

RESULTS

By introducing Homology Indexing, Chain Length Indexing, Stability of Complex and Optimized Multiple-Templates Clustering into our algorithm, the efficiency of our server has been significantly improved. Further, the accuracy was approximately 2-10 % higher than that of other algorithms for the test with either bound dataset or unbound dataset. For 210 bound dataset, bSiteFinder achieved high accuracies up to 94.8 % (MCC 0.95). For another 48 bound/unbound dataset, bSiteFinder achieved high accuracies up to 93.8 % for bound proteins (MCC 0.95) and 85.4 % for unbound proteins (MCC 0.72). Our bSiteFinder server is freely available at http://binfo.shmtu.edu.cn/bsitefinder/, and the source code is provided at the methods page.

CONCLUSION

An online bSiteFinder server is freely available at http://binfo.shmtu.edu.cn/bsitefinder/. Our work lays a foundation for functional annotation of protein and structure-based drug design. With ever increasing numbers of three-dimensional protein-ligand complex structures, our server should be more accurate and less time-consuming.Graphical Abstract bSiteFinder (http://binfo.shmtu.edu.cn/bsitefinder/) as a protein-binding sites prediction server was developed based on the largest database of bound templates so far with stringent quality control. By introducing Homology Indexing, Chain Length Indexing, Stability of Complex and Optimized Multiple-Templates Clustering into our algorithm, the efficiency of our server have been significantly improved. What's more, the accuracy was approximately 2-10 % higher than that of other algorithms for the test with either bound dataset or unbound dataset.

Methods for predicting protein-ligand binding sites

Ligand binding is required for many proteins to function properly. A large number of bioinformatics tools have been developed to predict ligand binding sites as a first step in understanding a protein's function or to facilitate docking computations in virtual screening based drug design. The prediction usually requires only the three-dimensional structure (experimentally determined or computationally modeled) of the target protein to be searched for ligand binding site(s), and Web servers have been built, allowing the free and simple use of prediction tools. In this chapter, we review the underlying concepts of the methods used by various tools, and discuss their different features and the related issues of ligand binding site prediction. Some cautionary notes about the use of these tools are also provided.

Large-scale binding ligand prediction by improved patch-based method Patch-Surfer2.0

MOTIVATION

Ligand binding is a key aspect of the function of many proteins. Thus, binding ligand prediction provides important insight in understanding the biological function of proteins. Binding ligand prediction is also useful for drug design and examining potential drug side effects.

RESULTS

We present a computational method named Patch-Surfer2.0, which predicts binding ligands for a protein pocket. By representing and comparing pockets at the level of small local surface patches that characterize physicochemical properties of the local regions, the method can identify binding pockets of the same ligand even if they do not share globally similar shapes. Properties of local patches are represented by an efficient mathematical representation, 3D Zernike Descriptor. Patch-Surfer2.0 has significant technical improvements over our previous prototype, which includes a new feature that captures approximate patch position with a geodesic distance histogram. Moreover, we constructed a large comprehensive database of ligand binding pockets that will be searched against by a query. The benchmark shows better performance of Patch-Surfer2.0 over existing methods.

AVAILABILITY AND IMPLEMENTATION

http://kiharalab.org/patchsurfer2.0/ CONTACT: dkihara@purdue.edu

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

Exploiting structural information for drug-target assessment

The amount of known protein structures is continuously growing, exhibited in over 95,000 3D structures freely available via the PDB. Over the last decade, pharmaceutical research has sparked interest in computationally extracting information from this large data pool, resulting in a homology-driven knowledge transfer from annotated to new structures. Studying protein structures with respect to understanding and modulating their functional behavior means analyzing their centers of action. Therefore, the detection and description of potential binding sites on the protein surface is a major step towards protein classification and assessment. Subsequently, these representations can be incorporated to compare proteins, and to predict their druggability or function. Especially in the context of target identification and polypharmacology, automated tools for large-scale target comparisons are highly needed. In this article, developments for automated structure-based target assessment are reviewed and remaining challenges as well as future perspectives are discussed.

Ligand binding site detection by local structure alignment and its performance complementarity

Accurate determination of potential ligand binding sites (BS) is a key step for protein function characterization and structure-based drug design. Despite promising results of template-based BS prediction methods using global structure alignment (GSA), there is room to improve the performance by properly incorporating local structure alignment (LSA) because BS are local structures and often similar for proteins with dissimilar global folds. We present a template-based ligand BS prediction method using G-LoSA, our LSA tool. A large benchmark set validation shows that G-LoSA predicts drug-like ligands' positions in single-chain protein targets more precisely than TM-align, a GSA-based method, while the overall success rate of TM-align is better. G-LoSA is particularly efficient for accurate detection of local structures conserved across proteins with diverse global topologies. Recognizing the performance complementarity of G-LoSA to TM-align and a nontemplate geometry-based method, fpocket, a robust consensus scoring method, CMCS-BSP (Complementary Methods and Consensus Scoring for ligand Binding Site Prediction), is developed and shows improvement on prediction accuracy.

Influence of C-H...O interactions on the structural stability of β-lactamases

β-Lactamases produced by pathogenic bacteria cleave β-lactam antibiotics and render them ineffective. Understanding the principles that govern the structural stability of β-lactamases requires elucidation of the nature of the interactions that are involved in stabilization. In the present study, we systematically analyze the influence of CH...O interactions on determining the specificity and stability of β-lactamases in relation to environmental preferences. It is interesting to note that all the residues located in the active site of β-lactamases are involved in CH...O interactions. A significant percentage of CH...O interactions have a higher conservation score and short-range interactions are the predominant type of interactions in β-lactamases. These results will be useful in understanding the stability patterns of β-lactamases.

LISE: a server using ligand-interacting and site-enriched protein triangles for prediction of ligand-binding sites

LISE is a web server for a novel method for predicting small molecule binding sites on proteins. It differs from a number of servers currently available for such predictions in two aspects. First, rather than relying on knowledge of similar protein structures, identification of surface cavities or estimation of binding energy, LISE computes a score by counting geometric motifs extracted from sub-structures of interaction networks connecting protein and ligand atoms. These network motifs take into account spatial and physicochemical properties of ligand-interacting protein surface atoms. Second, LISE has now been more thoroughly tested, as, in addition to the evaluation we previously reported using two commonly used small benchmark test sets and targets of two community-based experiments on ligand-binding site predictions, we now report an evaluation using a large non-redundant data set containing >2000 protein–ligand complexes. This unprecedented test, the largest ever reported to our knowledge, demonstrates LISE’s overall accuracy and robustness. Furthermore, we have identified some hard to predict protein classes and provided an estimate of the performance that can be expected from a state-of-the-art binding site prediction server, such as LISE, on a proteome scale. The server is freely available at http://lise.ibms.sinica.edu.tw.