A new method to detect related function among proteins independent of sequence and fold homology

Investigation into the effect of phenylalanine gating on anaerobic haem breakdown using the energy landscape approach

We have recently demonstrated a novel anaerobic NADH-dependent haem breakdown reaction, which is carried out by a range of haemoproteins. The Yersinia enterocolitica protein, HemS, is the focus of further research presented in the current paper. Using conventional experimental methods, bioinformatics, and energy landscape theory (ELT), we provide new insight into the mechanism of the novel breakdown process. Of particular interest is the behavior of a double phenylalanine gate, which opens and closes according to the relative situations of haem and NADH within the protein pocket. This behavior suggests that the double phe-gate fulfills a regulatory role within the pocket, controlling the access of NADH to haem. Additionally, stopped-flow spectroscopy results provide kinetic comparisons between the wild-type and the selected mutants. We also present a fully resolved crystal structure for the F104AF199A HemS monomer, including its extensive loop, the first such structure to be completely resolved for HemS or any of its close homologues. The energy landscapes approach provided key information regarding the gating strategy employed by HemS, compensating for current limitations with conventional biophysical and molecular dynamics approaches. We propose that ELT become more widely used in the field, particularly in the investigation of the dynamics and interactions of weak-binding ligands, and for gating features, within protein cavities.

DeepLigType: Predicting Ligand Types of ProteinLigand Binding Sites Using a Deep Learning Model

The analysis of protein-ligand binding sites plays a crucial role in the initial stages of drug discovery. Accurately predicting the ligand types that are likely to bind to protein-ligand binding sites enables more informed decision making in drug design. Our study, DeepLigType, determines protein-ligand binding sites using Fpocket and then predicts the ligand type of these pockets with the deep learning model, Convolutional Block Attention Module (CBAM) with ResNet. CBAM-ResNet has been trained to accurately predict five distinct ligand types. We classified protein-ligand binding sites into five different categories according to the type of response ligands cause when they bind to their target proteins, which are antagonist, agonist, activator, inhibitor, and others. We created a novel dataset, referred to as LigType5, from the widely recognized PDBbind and scPDB dataset for training and testing our model. While the literature mostly focuses on the specificity and characteristic analysis of protein binding sites by experimental (laboratory-based) methods, we propose a computational method with the DeepLigType architecture. DeepLigType demonstrated an accuracy of 74.30% and an AUC of 0.83 in ligand type prediction on a novel test dataset using the CBAM-ResNet deep learning model.

Subpocket Similarity-Based Hit Identification for Challenging Targets: Application to the WDR Domain of LRRK2

We herewith applied a priori a generic hit identification method (POEM) for difficult targets of known three-dimensional structure, relying on the simple knowledge of physicochemical and topological properties of a user-selected cavity. Searching for local similarity to a set of fragment-bound protein microenvironments of known structure, a point cloud registration algorithm is first applied to align known subpockets to the target cavity. The resulting alignment then permits us to directly pose the corresponding seed fragments in a target cavity space not typically amenable to classical docking approaches. Last, linking potentially connectable atoms by a deep generative linker enables full ligand enumeration. When applied to the WD40 repeat (WDR) central cavity of leucine-rich repeat kinase 2 (LRRK2), an unprecedented binding site, POEM was able to quickly propose 94 potential hits, five of which were subsequently confirmed to bind in vitro to LRRK2-WDR.

SiteMine: Large-scale binding site similarity searching in protein structure databases

Drug discovery and design challenges, such as drug repurposing, analyzing protein-ligand and protein-protein complexes, ligand promiscuity studies, or function prediction, can be addressed by protein binding site similarity analysis. Although numerous tools exist, they all have individual strengths and drawbacks with regard to run time, provision of structure superpositions, and applicability to diverse application domains. Here, we introduce SiteMine, an all-in-one database-driven, alignment-providing binding site similarity search tool to tackle the most pressing challenges of binding site comparison. The performance of SiteMine is evaluated on the ProSPECCTs benchmark, showing a promising performance on most of the data sets. The method performs convincingly regarding all quality criteria for reliable binding site comparison, offering a novel state-of-the-art approach for structure-based molecular design based on binding site comparisons. In a SiteMine showcase, we discuss the high structural similarity between cathepsin L and calpain 1 binding sites and give an outlook on the impact of this finding on structure-based drug design. SiteMine is available at https://uhh.de/naomi.

Klebicin E, a pore-forming bacteriocin of Klebsiella pneumoniae, exploits the porin OmpC and the Ton system for translocation

Bacteriocins, which have narrow-spectrum activity and limited adverse effects, are promising alternatives to antibiotics. In this study, we identified klebicin E (KlebE), a small bacteriocin derived from Klebsiella pneumoniae. KlebE exhibited strong efficacy against multidrug-resistant K. pneumoniae isolates and conferred a significant growth advantage to the producing strain during intraspecies competition. A giant unilamellar vesicle leakage assay demonstrated the unique membrane permeabilization effect of KlebE, suggesting that it is a pore-forming toxin. In addition to a C-terminal toxic domain, KlebE also has a disordered N-terminal domain and a globular central domain. Pulldown assays and soft agar overlay experiments revealed the essential role of the outer membrane porin OmpC and the Ton system in KlebE recognition and cytotoxicity. Strong binding between KlebE and both OmpC and TonB was observed. The TonB-box, a crucial component of the toxin-TonB interaction, was identified as the 7-amino acid sequence (E3ETLTVV9) located in the N-terminal region. Further studies showed that a region near the bottom of the central domain of KlebE plays a primary role in recognizing OmpC, with eight residues surrounding this region identified as essential for KlebE toxicity. Finally, based on the discrepancies in OmpC sequences between the KlebE-resistant and sensitive strains, it was found that the 91st residue of OmpC, an aspartic acid residue, is a key determinant of KlebE toxicity. The identification and characterization of this toxin will facilitate the development of bacteriocin-based therapies targeting multidrug-resistant K. pneumoniae infections.

Combining experiment and energy landscapes to explore anaerobic heme breakdown in multifunctional hemoproteins

To survive, many pathogens extract heme from their host organism and break down the porphyrin scaffold to sequester the Fe2+ ion via a heme oxygenase. Recent studies have revealed that certain pathogens can anaerobically degrade heme. Our own research has shown that one such pathway proceeds via NADH-dependent heme degradation, which has been identified in a family of hemoproteins from a range of bacteria. HemS, from Yersinia enterocolitica, is the main focus of this work, along with HmuS (Yersinia pestis), ChuS (Escherichia coli) and ShuS (Shigella dysenteriae). We combine experiments, Energy Landscape Theory, and a bioinformatic investigation to place these homologues within a wider phylogenetic context. A subset of these hemoproteins are known to bind certain DNA promoter regions, suggesting not only that they can catalytically degrade heme, but that they are also involved in transcriptional modulation responding to heme flux. Many of the bacterial species responsible for these hemoproteins (including those that produce HemS, ChuS and ShuS) are known to specifically target oxygen-depleted regions of the gastrointestinal tract. A deeper understanding of anaerobic heme breakdown processes exploited by these pathogens could therefore prove useful in the development of future strategies for disease prevention.

Pharmacoinformatics and Breed-Based De Novo Hybridization Studies to Develop New Neuraminidase Inhibitors as Potential Anti-Influenza Agents

Influenza represents a profoundly transmissible viral ailment primarily afflicting the respiratory system. Neuraminidase inhibitors constitute a class of antiviral therapeutics employed in the management of influenza. These inhibitors impede the liberation of the viral neuraminidase protein, thereby impeding viral dissemination from the infected cell to host cells. As such, neuraminidase has emerged as a pivotal target for mitigating influenza and its associated complications. Here, we apply a de novo hybridization approach based on a breed-centric methodology to elucidate novel neuraminidase inhibitors. The breed technique amalgamates established ligand frameworks with the shared target, neuraminidase, resulting in innovative inhibitor constructs. Molecular docking analysis revealed that the seven synthesized breed molecules (designated Breeds 1-7) formed more robust complexes with the neuraminidase receptor than conventional clinical neuraminidase inhibitors such as zanamivir, oseltamivir, and peramivir. Pharmacokinetic evaluations of the seven breed molecules (Breeds 1-7) demonstrated favorable bioavailability and optimal permeability, all falling within the specified parameters for human application. Molecular dynamics simulations spanning 100 nanoseconds corroborated the stability of these breed molecules within the active site of neuraminidase, shedding light on their structural dynamics. Binding energy assessments, which were conducted through MM-PBSA analysis, substantiated the enduring complexes formed by the seven types of molecules and the neuraminidase receptor. Last, the investigation employed a reaction-based enumeration technique to ascertain the synthetic pathways for the synthesis of the seven breed molecules.

Protein binding sites for drug design

Drug development is a lengthy and challenging process that can be accelerated at early stages by new mathematical approaches and modern computers. To address this important issue, we are developing new mathematical solutions for the detection and characterization of protein binding sites that are important for new drug development. In this review, we present algorithms based on graph theory combined with molecular dynamics simulations that we have developed for studying biological target proteins to provide important data for optimizing the early stages of new drug development. A particular focus is the development of new protein binding site prediction algorithms (ProBiS) and new web tools for modeling pharmaceutically interesting molecules-ProBiS Tools (algorithm, database, web server), which have evolved into a full-fledged graphical tool for studying proteins in the proteome. ProBiS differs from other structural algorithms in that it can align proteins with different folds without prior knowledge of the binding sites. It allows detection of similar binding sites and can predict molecular ligands of various types of pharmaceutical interest that could be advanced to drugs to treat a disease, based on the entire Protein Data Bank (PDB) and AlphaFold database, including proteins not yet in the PDB. All ProBiS Tools are freely available to the academic community at http://insilab.org and https://probis.nih.gov.

Classification of Protein-Binding Sites Using a Spherical Convolutional Neural Network

The analysis and comparison of protein-binding sites aid various applications in the drug discovery process, e.g., hit finding, drug repurposing, and polypharmacology. Classification of binding sites has been a hot topic for the past 30 years, and many different methods have been published. The rapid development of machine learning computational algorithms, coupled with the large volume of publicly available protein-ligand 3D structures, makes it possible to apply deep learning techniques in binding site comparison. Our method uses a cutting-edge spherical convolutional neural network based on the DeepSphere architecture to learn global representations of protein-binding sites. The model was trained on TOUGH-C1 and TOUGH-M1 data and validated with the ProSPECCTs datasets. Our results show that our model can (1) perform well in protein-binding site similarity and classification tasks and (2) learn and separate the physicochemical properties of binding sites. Lastly, we tested the model on a set of kinases, where the results show that it is able to cluster the different kinase subfamilies effectively. This example demonstrates the method's promise for lead hopping within or outside a protein target, directly based on binding site information.

Concepts and applications of chemical fingerprint for hit and lead screening

Molecular fingerprints are used to represent chemical (structural, physicochemical, etc.) properties of large-scale chemical sets in a low computational cost way. They have a prominent role in transforming chemical data sets into consistent input formats (bit strings or numeric values) suitable for in silico approaches. In this review, we summarize and classify common and state-of-the-art fingerprints into eight different types (dictionary based, circular, topological, pharmacophore, protein-ligand interaction, shape based, reinforced, and multi). We also highlight applications of fingerprints in early drug research and development (R&D). Thus, this review provides a guide for the selection of appropriate fingerprints of compounds (or ligand-protein complexes) for use in drug R&D.

BAY-069, a Novel (Trifluoromethyl)pyrimidinedione-Based BCAT1/2 Inhibitor and Chemical Probe

The branched-chain amino acid transaminases (BCATs) are enzymes that catalyze the first reaction of catabolism of the essential branched-chain amino acids to branched-chain keto acids to form glutamate. They are known to play a key role in different cancer types. Here, we report a new structural class of BCAT1/2 inhibitors, (trifluoromethyl)pyrimidinediones, identified by a high-throughput screening campaign and subsequent optimization guided by a series of X-ray crystal structures. Our potent dual BCAT1/2 inhibitor BAY-069 displays high cellular activity and very good selectivity. Along with a negative control (BAY-771), BAY-069 was donated as a chemical probe to the Structural Genomics Consortium.

Estimating the Similarity between Protein Pockets

With the exponential increase in publicly available protein structures, the comparison of protein binding sites naturally emerged as a scientific topic to explain observations or generate hypotheses for ligand design, notably to predict ligand selectivity for on- and off-targets, explain polypharmacology, and design target-focused libraries. The current review summarizes the state-of-the-art computational methods applied to pocket detection and comparison as well as structural druggability estimates. The major strengths and weaknesses of current pocket descriptors, alignment methods, and similarity search algorithms are presented. Lastly, an exhaustive survey of both retrospective and prospective applications in diverse medicinal chemistry scenarios illustrates the capability of the existing methods and the hurdle that still needs to be overcome for more accurate predictions.

Exploring Ligand Binding Domain Dynamics in the NRs Superfamily

Nuclear receptors (NRs) are transcription factors that play an important role in multiple diseases, such as cancer, inflammation, and metabolic disorders. They share a common structural organization composed of five domains, of which the ligand-binding domain (LBD) can adopt different conformations in response to substrate, agonist, and antagonist binding, leading to distinct transcription effects. A key feature of NRs is, indeed, their intrinsic dynamics that make them a challenging target in drug discovery. This work aims to provide a meaningful investigation of NR structural variability to outline a dynamic profile for each of them. To do that, we propose a methodology based on the computation and comparison of protein cavities among the crystallographic structures of NR LBDs. First, pockets were detected with the FLAPsite algorithm and then an "all against all" approach was applied by comparing each pair of pockets within the same sub-family on the basis of their similarity score. The analysis concerned all the detectable cavities in NRs, with particular attention paid to the active site pockets. This approach can guide the investigation of NR intrinsic dynamics, the selection of reference structures to be used in drug design and the easy identification of alternative binding sites.

What Makes GPCRs from Different Families Bind to the Same Ligand?

G protein-coupled receptors (GPCRs) are the largest class of cell-surface receptor proteins with important functions in signal transduction and often serve as therapeutic drug targets. With the rapidly growing public data on three dimensional (3D) structures of GPCRs and GPCR-ligand interactions, computational prediction of GPCR ligand binding becomes a convincing option to high throughput screening and other experimental approaches during the beginning phases of ligand discovery. In this work, we set out to computationally uncover and understand the binding of a single ligand to GPCRs from several different families. Three-dimensional structural comparisons of the GPCRs that bind to the same ligand revealed local 3D structural similarities and often these regions overlap with locations of binding pockets. These pockets were found to be similar (based on backbone geometry and side-chain orientation using APoc), and they correlate positively with electrostatic properties of the pockets. Moreover, the more similar the pockets, the more likely a ligand binding to the pockets will interact with similar residues, have similar conformations, and produce similar binding affinities across the pockets. These findings can be exploited to improve protein function inference, drug repurposing and drug toxicity prediction, and accelerate the development of new drugs.

On the Frustration to Predict Binding Affinities from Protein-Ligand Structures with Deep Neural Networks

Accurate prediction of binding affinities from protein-ligand atomic coordinates remains a major challenge in early stages of drug discovery. Using modular message passing graph neural networks describing both the ligand and the protein in their free and bound states, we unambiguously evidence that an explicit description of protein-ligand noncovalent interactions does not provide any advantage with respect to ligand or protein descriptors. Simple models, inferring binding affinities of test samples from that of the closest ligands or proteins in the training set, already exhibit good performances, suggesting that memorization largely dominates true learning in the deep neural networks. The current study suggests considering only noncovalent interactions while omitting their protein and ligand atomic environments. Removing all hidden biases probably requires much denser protein-ligand training matrices and a coordinated effort of the drug design community to solve the necessary protein-ligand structures.

ProBiS-Dock: A Hybrid Multitemplate Homology Flexible Docking Algorithm Enabled by Protein Binding Site Comparison

The protein data bank (PDB) is a rich source of protein ligand structures, but ligands are not explicitly used in current docking algorithms. We have developed ProBiS-Dock, a docking algorithm complementary to the ProBiS-Dock Database (J. Chem. Inf. Model. 2021, 61, 4097-4107) that treats small molecules and proteins as fully flexible entities and allows conformational changes in both after ligand binding. A new scoring function is described that consists of a binding site-specific scoring function (ProBiS-Score) and a general statistical scoring function. ProBiS-Dock enables rapid docking of small molecules to proteins and has been successfully validated in silico against standard benchmarks. It enables rapid search for new active ligands by leveraging existing knowledge in the PDB. The potential of the software for drug development has been confirmed in vitro by the discovery of new inhibitors of human indoleamine 2,3-dioxygenase 1, an enzyme that is an attractive target for cancer therapy and catalyzes the first rate-determining step of l-tryptophan metabolism via the kynurenine pathway. The software is freely available to academic users at http://insilab.org/probisdock.

RosettaSurf-A surface-centric computational design approach

Proteins are typically represented by discrete atomic coordinates providing an accessible framework to describe different conformations. However, in some fields proteins are more accurately represented as near-continuous surfaces, as these are imprinted with geometric (shape) and chemical (electrostatics) features of the underlying protein structure. Protein surfaces are dependent on their chemical composition and, ultimately determine protein function, acting as the interface that engages in interactions with other molecules. In the past, such representations were utilized to compare protein structures on global and local scales and have shed light on functional properties of proteins. Here we describe RosettaSurf, a surface-centric computational design protocol, that focuses on the molecular surface shape and electrostatic properties as means for protein engineering, offering a unique approach for the design of proteins and their functions. The RosettaSurf protocol combines the explicit optimization of molecular surface features with a global scoring function during the sequence design process, diverging from the typical design approaches that rely solely on an energy scoring function. With this computational approach, we attempt to address a fundamental problem in protein design related to the design of functional sites in proteins, even when structurally similar templates are absent in the characterized structural repertoire. Surface-centric design exploits the premise that molecular surfaces are, to a certain extent, independent of the underlying sequence and backbone configuration, meaning that different sequences in different proteins may present similar surfaces. We benchmarked RosettaSurf on various sequence recovery datasets and showcased its design capabilities by generating epitope mimics that were biochemically validated. Overall, our results indicate that the explicit optimization of surface features may lead to new routes for the design of functional proteins.

DEPACT and PACMatch: A Workflow of Designing De Novo Protein Pockets to Bind Small Molecules

Engineering of new functional proteins such as enzymes and biosensors involves the design of new protein pockets for the specific binding of small molecules. Here, we report a workflow composed of two new computational methods to execute this task. The DEPACT (Design Pocket as a Cluster based on Templates) method is a data-driven approach to design and evaluate small-molecule-binding pockets as isolated clusters, while the PACMatch method is a computational approach to match pocket residues in a cluster model to positions on given protein scaffolds. Using DEPACT and its scoring function, pocket clusters of natural-pocket-like chemical compositions and protein-ligand interaction strength can be designed. DEPACT can design pocket clusters containing water- or metal-ion-mediated protein-ligand interactions. While being able to efficiently treat relatively large pocket cluster models (e.g., of around 10 pocket residues), PACMatch outperforms previous methods in test cases of recovering the native positions of pocket residues in natural enzyme-substrate complexes.

MeCOM: A Method for Comparing Three-Dimensional Metalloenzyme Active Sites

Since metalloenzymes are a large collection of metal ion(s) dependent enzymes, comparison analyses of metalloenzyme active sites are critical for metalloenzyme de novo design, function investigation, and inhibitor development. Here, we report a method named MeCOM for comparing metalloenzyme active sites. It is characterized by metal ion(s) centric active site recognition and three-dimensional superimposition using α-carbon or pharmacophore features. The test results revealed that for the given metalloenzymes, MeCOM could effectively recognize the active sites, extract active site features, and superimpose the active sites; it also could correctly identify similar active sites, differentiate dissimilar active sites, and evaluate the similarity degree. Moreover, MeCOM showed potential to establish new associations between structurally distinct metalloenzymes by active site comparison. MeCOM is freely available at https://mecom.ddtmlab.org.

A Peptides Prediction Methodology for Tertiary Structure Based on Simulated Annealing

The Protein Folding Problem (PFP) is a big challenge that has remained unsolved for more than fifty years. This problem consists of obtaining the tertiary structure or Native Structure (NS) of a protein knowing its amino acid sequence. The computational methodologies applied to this problem are classified into two groups, known as Template-Based Modeling (TBM) and ab initio models. In the latter methodology, only information from the primary structure of the target protein is used. In the literature, Hybrid Simulated Annealing (HSA) algorithms are among the best ab initio algorithms for PFP; Golden Ratio Simulated Annealing (GRSA) is a PFP family of these algorithms designed for peptides. Moreover, for the algorithms designed with TBM, they use information from a target protein’s primary structure and information from similar or analog proteins. This paper presents GRSA-SSP methodology that implements a secondary structure prediction to build an initial model and refine it with HSA algorithms. Additionally, we compare the performance of the GRSAX-SSP algorithms versus its corresponding GRSAX. Finally, our best algorithm GRSAX-SSP is compared with PEP-FOLD3, I-TASSER, QUARK, and Rosetta, showing that it competes in small peptides except when predicting the largest peptides.

Site2Vec: a reference frame invariant algorithm for vector embedding of protein–ligand binding sites

Protein–ligand interactions are one of the fundamental types of molecular interactions in living systems. Ligands are small molecules that interact with protein molecules at specific regions on their surfaces called binding sites. Binding sites would also determine ADMET properties of a drug molecule. Tasks such as assessment of protein functional similarity and detection of side effects of drugs need identification of similar binding sites of disparate proteins across diverse pathways. To this end, methods for computing similarities between binding sites are still evolving and is an active area of research even today. Machine learning methods for similarity assessment require feature descriptors of binding sites. Traditional methods based on hand engineered motifs and atomic configurations are not scalable across several thousands of sites. In this regard, deep neural network algorithms are now deployed which can capture very complex input feature space. However, one fundamental challenge in applying deep learning to structures of binding sites is the input representation and the reference frame. We report here a novel algorithm, Site2Vec, that derives reference frame invariant vector embedding of a protein–ligand binding site. The method is based on pairwise distances between representative points and chemical compositions in terms of constituent amino acids of a site. The vector embedding serves as a locality sensitive hash function for proximity queries and determining similar sites. The method has been the top performer with more than 95% quality scores in extensive benchmarking studies carried over 10 data sets and against 23 other site comparison methods in the field. The algorithm serves for high throughput processing and has been evaluated for stability with respect to reference frame shifts, coordinate perturbations and residue mutations. We also provide the method as a standalone executable and a web service hosted at (http://services.iittp.ac.in/bioinfo/home).

Analyzing Kinase Similarity in Small Molecule and Protein Structural Space to Explore the Limits of Multi-Target Screening

While selective inhibition is one of the key assets for a small molecule drug, many diseases can only be tackled by simultaneous inhibition of several proteins. An example where achieving selectivity is especially challenging are ligands targeting human kinases. This difficulty arises from the high structural conservation of the kinase ATP binding sites, the area targeted by most inhibitors. We investigated the possibility to identify novel small molecule ligands with pre-defined binding profiles for a series of kinase targets and anti-targets by in silico docking. The candidate ligands originating from these calculations were assayed to determine their experimental binding profiles. Compared to previous studies, the acquired hit rates were low in this specific setup, which aimed at not only selecting multi-target kinase ligands, but also designing out binding to anti-targets. Specifically, only a single profiled substance could be verified as a sub-micromolar, dual-specific EGFR/ErbB2 ligand that indeed avoided its selected anti-target BRAF. We subsequently re-analyzed our target choice and in silico strategy based on these findings, with a particular emphasis on the hit rates that can be expected from a given target combination. To that end, we supplemented the structure-based docking calculations with bioinformatic considerations of binding pocket sequence and structure similarity as well as ligand-centric comparisons of kinases. Taken together, our results provide a multi-faceted picture of how pocket space can determine the success of docking in multi-target drug discovery efforts.

Propedia: a database for protein-peptide identification based on a hybrid clustering algorithm

BACKGROUND

Protein-peptide interactions play a fundamental role in a wide variety of biological processes, such as cell signaling, regulatory networks, immune responses, and enzyme inhibition. Peptides are characterized by low toxicity and small interface areas; therefore, they are good targets for therapeutic strategies, rational drug planning and protein inhibition. Approximately 10% of the ethical pharmaceutical market is protein/peptide-based. Furthermore, it is estimated that 40% of protein interactions are mediated by peptides. Despite the fast increase in the volume of biological data, particularly on sequences and structures, there remains a lack of broad and comprehensive protein-peptide databases and tools that allow the retrieval, characterization and understanding of protein-peptide recognition and consequently support peptide design.

RESULTS

We introduce Propedia, a comprehensive and up-to-date database with a web interface that permits clustering, searching and visualizing of protein-peptide complexes according to varied criteria. Propedia comprises over 19,000 high-resolution structures from the Protein Data Bank including structural and sequence information from protein-peptide complexes. The main advantage of Propedia over other peptide databases is that it allows a more comprehensive analysis of similarity and redundancy. It was constructed based on a hybrid clustering algorithm that compares and groups peptides by sequences, interface structures and binding sites. Propedia is available through a graphical, user-friendly and functional interface where users can retrieve, and analyze complexes and download each search data set. We performed case studies and verified that the utility of Propedia scores to rank promissing interacting peptides. In a study involving predicting peptides to inhibit SARS-CoV-2 main protease, we showed that Propedia scores related to similarity between different peptide complexes with SARS-CoV-2 main protease are in agreement with molecular dynamics free energy calculation.

CONCLUSIONS

Propedia is a database and tool to support structure-based rational design of peptides for special purposes. Protein-peptide interactions can be useful to predict, classifying and scoring complexes or for designing new molecules as well. Propedia is up-to-date as a ready-to-use webserver with a friendly and resourceful interface and is available at: https://bioinfo.dcc.ufmg.br/propedia.

A systematic analysis of protein-carbohydrate interactions in the Protein Data Bank

Protein-carbohydrate interactions underlie essential biological processes. Elucidating the mechanism of protein-carbohydrate recognition is a prerequisite for modeling and optimizing protein-carbohydrate interactions, which will help in discovery of carbohydrate-derived therapeutics. In this work, we present a survey of a curated database consisting of 6,402 protein-carbohydrate complexes in the Protein Data Bank (PDB). We performed an all-against-all comparison of a subset of nonredundant binding sites, and the result indicates that the interaction pattern similarity is not completely relevant to the binding site structural similarity. Investigation of both binding site and ligand promiscuities reveals that the geometry of chemical feature points is more important than local backbone structure in determining protein-carbohydrate interactions. A further analysis on the frequency and geometry of atomic interactions shows that carbohydrate functional groups are not equally involved in binding interactions. Finally, we discuss the usefulness of protein-carbohydrate complexes in the PDB with acknowledgement that the carbohydrates in many structures are incomplete.

PatchSearch: a web server for off-target protein identification

The large number of proteins found in the human body implies that a drug may interact with many proteins, called off-target proteins, besides its intended target. The PatchSearch web server provides an automated workflow that allows users to identify structurally conserved binding sites at the protein surfaces in a set of user-supplied protein structures. Thus, this web server may help to detect potential off-target protein. It takes as input a protein complexed with a ligand and identifies within user-defined or predefined collections of protein structures, those having a binding site compatible with this ligand in terms of geometry and physicochemical properties. It is based on a non-sequential local alignment of the patch over the entire protein surface. Then the PatchSearch web server proposes a ligand binding mode for the potential off-target, as well as an estimated affinity calculated by the Vinardo scoring function. This novel tool is able to efficiently detects potential interactions of ligands with distant off-target proteins. Furthermore, by facilitating the discovery of unexpected off-targets, PatchSearch could contribute to the repurposing of existing drugs. The server is freely available at http://bioserv.rpbs.univ-paris-diderot.fr/services/PatchSearch.

BREED based de novo hybridization approach: generating novel T790M/C797S-EGFR tyrosine kinase inhibitors to overcome the problem of mutation and resistance in non small cell lung cancer (NSCLC)

Third generation EGFR inhibitor osimertinib was approved as the first-line treatment for EGFR T790M mutation-positive Non-Small Cell Lung Cancer (NSCLC) patients in 2017. However, EGFR tertiary Cys797 to Ser797 (C797S) point mutation emanate rapidly after treatment of osimertinib, which is undruggable mutation to the all existing drugs. In this work, we have reported the novel T790M/C797S-EGFR Tyrosine Kinase inhibitors using BREED based de novo hybridization approach. BREED generates novel inhibitors from structures of known ligands bound to a common target. Among the generated hybridised breed compounds, the top best scorer breed molecules were breed 436, breed 530, breed 450, breed 562 and breed 313. Molecular Dynamics simulation of breed 436 for 10 ns further suggested that docked compound was stable into the pocket of the T790M/C797S-EGFR Tyrosine Kinase. In silico pharmacokinetic predictions of the breed hybridised compounds were within the defined range described for human use.Communicated by Ramaswamy H. Sarma.

Binding-Site Match Maker (BSMM): A Computational Method for the Design of Multi-Target Ligands

Multi-target ligand strategies provide a valuable method of drug design. However, to develop a multi-target drug with the desired profile remains a challenge. Herein, we developed a computational method binding-site match maker (BSMM) for the design of multi-target ligands based on binding site matching. BSMM was built based on geometric hashing algorithms and the representation of a binding-site with physicochemical (PC) points. The BSMM software was used to detect proteins with similar binding sites or subsites. In particular, BSMM is independent of protein global folds and sequences and is therefore applicable to the matching of any binding sites. The similar sites between protein pairs with low homology and/or different folds are generally not obvious to the visual inspection. The detection of such similar binding sites by BSMM could be of great value for the design of multi-target ligands.

AlphaSpace 2.0: Representing Concave Biomolecular Surfaces Using β-Clusters

Modern rational modulator design and structure-function characterization often concentrate on concave regions of biomolecular surfaces, ranging from well-defined small-molecule binding sites to large protein-protein interaction interfaces. Here, we introduce a β-cluster as a pseudomolecular representation of fragment-centric pockets detected by AlphaSpace [J. Chem. Inf. Model. 2015, 55, 1585], a recently developed computational analysis tool for topographical mapping of biomolecular concavities. By mimicking the shape as well as atomic details of potential molecular binders, this new β-cluster representation allows direct pocket-to-ligand shape comparison and can be used to guide ligand optimization. Furthermore, we defined the β-score, the optimal Vina score of the β-cluster, as an indicator of pocket ligandability and developed an ensemble β-cluster approach, which allows one-to-one pocket mapping and comparison among aligned protein structures. We demonstrated the utility of β-cluster representation by applying the approach to a wide variety of problems including binding site detection and comparison, characterization of protein-protein interactions, and fragment-based ligand optimization. These new β-cluster functionalities have been implemented in AlphaSpace 2.0, which is freely available on the web at http://www.nyu.edu/projects/yzhang/AlphaSpace2.

Quantitative Characterization of Binding Pockets and Binding Complementarity by Means of Zernike Descriptors

In this work, we describe the application of the Zernike formalism to quantitatively characterize the binding pockets of two sets of biologically relevant systems. Such an approach, when applied to molecular dynamics trajectories, is able to pinpoint the subtle differences between very similar molecular regions and their impact on the local propensity to ligand binding, allowing us to quantify such differences. The statistical robustness of our procedure suggests that it is very suitable to describe protein binding sites and protein-ligand interactions within a rigorous and well-defined framework.

Binding site matching in rational drug design: algorithms and applications

Interactions between proteins and small molecules are critical for biological functions. These interactions often occur in small cavities within protein structures, known as ligand-binding pockets. Understanding the physicochemical qualities of binding pockets is essential to improve not only our basic knowledge of biological systems, but also drug development procedures. In order to quantify similarities among pockets in terms of their geometries and chemical properties, either bound ligands can be compared to one another or binding sites can be matched directly. Both perspectives routinely take advantage of computational methods including various techniques to represent and compare small molecules as well as local protein structures. In this review, we survey 12 tools widely used to match pockets. These methods are divided into five categories based on the algorithm implemented to construct binding-site alignments. In addition to the comprehensive analysis of their algorithms, test sets and the performance of each method are described. We also discuss general pharmacological applications of computational pocket matching in drug repurposing, polypharmacology and side effects. Reflecting on the importance of these techniques in drug discovery, in the end, we elaborate on the development of more accurate meta-predictors, the incorporation of protein flexibility and the integration of powerful artificial intelligence technologies such as deep learning.

Computational methods and tools for binding site recognition between proteins and small molecules: from classical geometrical approaches to modern machine learning strategies

In the current "genomic era" the number of identified genes is growing exponentially. However, the biological function of a large number of the corresponding proteins is still unknown. Recognition of small molecule ligands (e.g., substrates, inhibitors, allosteric regulators, etc.) is pivotal for protein functions in the vast majority of the cases and knowledge of the region where these processes take place is essential for protein function prediction and drug design. In this regard, computational methods represent essential tools to tackle this problem. A significant number of software tools have been developed in the last few years which exploit either protein sequence information, structure information or both. This review describes the most recent developments in protein function recognition and binding site prediction, in terms of both freely-available and commercial solutions and tools, detailing the main characteristics of the considered tools and providing a comparative analysis of their performance.

3D-PP: A Tool for Discovering Conserved Three-Dimensional Protein Patterns

Discovering conserved three-dimensional (3D) patterns among protein structures may provide valuable insights into protein classification, functional annotations or the rational design of multi-target drugs. Thus, several computational tools have been developed to discover and compare protein 3D-patterns. However, most of them only consider previously known 3D-patterns such as orthosteric binding sites or structural motifs. This fact makes necessary the development of new methods for the identification of all possible 3D-patterns that exist in protein structures (allosteric sites, enzyme-cofactor interaction motifs, among others). In this work, we present 3D-PP, a new free access web server for the discovery and recognition all similar 3D amino acid patterns among a set of proteins structures (independent of their sequence similarity). This new tool does not require any previous structural knowledge about ligands, and all data are organized in a high-performance graph database. The input can be a text file with the PDB access codes or a zip file of PDB coordinates regardless of the origin of the structural data: X-ray crystallographic experiments or in silico homology modeling. The results are presented as lists of sequence patterns that can be further analyzed within the web page. We tested the accuracy and suitability of 3D-PP using two sets of proteins coming from the Protein Data Bank: (a) Zinc finger containing and (b) Serotonin target proteins. We also evaluated its usefulness for the discovering of new 3D-patterns, using a set of protein structures coming from in silico homology modeling methodologies, all of which are overexpressed in different types of cancer. Results indicate that 3D-PP is a reliable, flexible and friendly-user tool to identify conserved structural motifs, which could be relevant to improve the knowledge about protein function or classification. The web server can be freely utilized at https://appsbio.utalca.cl/3d-pp/.

Binding site characterization - similarity, promiscuity, and druggability

The elucidation of non-obvious binding site similarities has provided useful indications for the establishment of polypharmacology, the identification of potential off-targets, or the repurposing of known drugs. The concept underlying all of these approaches is promiscuous binding which can be analyzed from a ligand-based or a binding site-based perspective. Herein, we applied methods for the automated analysis and comparison of protein binding sites to study promiscuous binding on a novel dataset of sites in complex with ligands sharing common shape and physicochemical properties. We show the suitability of this dataset for the benchmarking of novel binding site comparison methods. Our investigations also reveal promising directions for further in-depth analyses of promiscuity and druggability in a pocket-centered manner. Drawbacks concerning binding site similarity assessment and druggability prediction are outlined, enabling researchers to avoid the typical pitfalls of binding site analyses.

Binding site comparisons for target-centered drug discovery

INTRODUCTION

The success of binding site comparisons in drug discovery is based on the recognized fact that many different proteins have similar binding sites. Indeed, binding site comparisons have found many uses in drug development and have the potential to dramatically cut the cost and shorten the time necessary for the development of new drugs. Areas covered: The authors review recent methods for comparing protein binding sites and their use in drug repurposing and polypharmacology. They examine emerging fields including the use of binding site comparisons in precision medicine, the prediction of structured water molecules, the search for targets of natural compounds, and their application in the development of protein-based drugs by loop modeling and for comparison of RNA binding sites. Expert opinion: Binding site comparisons have produced many interesting results in drug development, but relatively little work has been done on protein-protein interaction sites, which are particularly relevant in view of the success of biological drugs. Growth of protein loop modeling for modulating biological drugs is anticipated. The fusion of currently distinct methods for the comparison of RNA and protein binding sites into a single comprehensive approach could allow the search for new selective ribosomal antibiotics and initiate pharmaceutical research into other nucleoproteins.

In Silico Target Druggability Assessment: From Structural to Systemic Approaches

This chapter will focus on today's in silico direct and indirect approaches to assess therapeutic target druggability. The direct approach tries to infer from the 3D structure the capacity of the target protein to bind small molecule in order to modulate its biological function. Algorithms to recognize and characterize the quality of the ligand interaction sites whether within buried protein cavities or within large protein-protein interface will be reviewed in the first part of the paper. In the case a ligand-binding site is already identified, indirect aspects of target druggability can be assessed. These indirect approaches focus first on target promiscuity and the potential difficulties in developing specific drugs. It is based on large-scale comparison of protein-binding sites. The second aspect concerns the capacity of the target to induce resistant pathway once it is inhibited or activated by a drug. The emergence of drug-resistant pathways can be assessed through systemic analysis of biological networks implementing metabolism and/or cell regulation signaling.

In Silico Target Prediction for Small Molecules

Drugs modulate disease states through their actions on targets in the body. Determining these targets aids the focused development of new treatments, and helps to better characterize those already employed. One means of accomplishing this is through the deployment of in silico methodologies, harnessing computational analytical and predictive power to produce educated hypotheses for experimental verification. Here, we provide an overview of the current state of the art, describe some of the well-established methods in detail, and reflect on how they, and emerging technologies promoting the incorporation of complex and heterogeneous data-sets, can be employed to improve our understanding of (poly)pharmacology.

An Improved Receptor-Based Pharmacophore Generation Algorithm Guided by Atomic Chemical Characteristics and Hybridization Types

Pharmacophore-based virtual screening is an important and leading compound discovery method. However, current pharmacophore generation algorithms suffer from difficulties, such as ligand-dependent computation and massive extractive chemical features. On the basis of the features extracted by the five probes in Pocket v.3, this paper presents an improved receptor-based pharmacophore generation algorithm guided by atomic chemical characteristics and hybridization types. The algorithm works under the constraint of receptor atom hybridization types and space distance. Four chemical characteristics (H-A, H-D, and positive and negative charges) were extracted using the hybridization type of receptor atoms, and the feature point sets were merged with 3 Å space constraints. Furthermore, on the basis of the original extraction of hydrophobic characteristics, extraction of aromatic ring chemical characteristics was achieved by counting the number of aromatics, searching for residual base aromatic ring, and determining the direction of aromatic rings. Accordingly, extraction of six kinds of chemical characteristics of the pharmacophore was achieved. In view of the pharmacophore characteristics, our algorithm was compared with the existing LigandScout algorithm. The results demonstrate that the pharmacophore possessing six chemical characteristics can be characterized using our algorithm, which features fewer pharmacophore characteristics and is ligand independent. The computation of many instances from the directory of useful decoy dataset show that the active molecules and decoy molecules can be effectively differentiated through the presented method in this paper.

A benchmark driven guide to binding site comparison: An exhaustive evaluation using tailor-made data sets (ProSPECCTs)

The automated comparison of protein-ligand binding sites provides useful insights into yet unexplored site similarities. Various stages of computational and chemical biology research can benefit from this knowledge. The search for putative off-targets and the establishment of polypharmacological effects by comparing binding sites led to promising results for numerous projects. Although many cavity comparison methods are available, a comprehensive analysis to guide the choice of a tool for a specific application is wanting. Moreover, the broad variety of binding site modeling approaches, comparison algorithms, and scoring metrics impedes this choice. Herein, we aim to elucidate strengths and weaknesses of binding site comparison methodologies. A detailed benchmark study is the only possibility to rationalize the selection of appropriate tools for different scenarios. Specific evaluation data sets were developed to shed light on multiple aspects of binding site comparison. An assembly of all applied benchmark sets (ProSPECCTs–Protein Site Pairs for the Evaluation of Cavity Comparison Tools) is made available for the evaluation and optimization of further and still emerging methods. The results indicate the importance of such analyses to facilitate the choice of a methodology that complies with the requirements of a specific scientific challenge.

Binding site similarities are useful in the context of promiscuity prediction, drug repurposing, the analysis of protein-ligand and protein-protein complexes, function prediction, and further fields of general interest in chemical biology and biochemistry. Many years of research have led to the development of a multitude of methods for binding site analysis and comparison. On the one hand, their availability supports research. On the other hand, the huge number of methods hampers the efficient selection of a specific tool. Our research is dedicated to the analysis of different cavity comparison tools. We use several binding site data sets to establish guidelines which can be applied to ensure a successful application of comparison methods by circumventing potential pitfalls.

Electrostatic recognition in substrate binding to serine proteases

Serine proteases of the Chymotrypsin family are structurally very similar but have very different substrate preferences. This study investigates a set of 9 different proteases of this family comprising proteases that prefer substrates containing positively charged amino acids, negatively charged amino acids, and uncharged amino acids with varying degree of specificity. Here, we show that differences in electrostatic substrate preferences can be predicted reliably by electrostatic molecular interaction fields employing customized GRID probes. Thus, we are able to directly link protease structures to their electrostatic substrate preferences. Additionally, we present a new metric that measures similarities in substrate preferences focusing only on electrostatics. It efficiently compares these electrostatic substrate preferences between different proteases. This new metric can be interpreted as the electrostatic part of our previously developed substrate similarity metric. Consequently, we suggest, that substrate recognition in terms of electrostatics and shape complementarity are rather orthogonal aspects of substrate recognition. This is in line with a 2‐step mechanism of protein‐protein recognition suggested in the literature.

GPU-Based Point Cloud Superpositioning for Structural Comparisons of Protein Binding Sites

In this paper, we present a novel approach to solve the labeled point cloud superpositioning problem for performing structural comparisons of protein binding sites. The solution is based on a parallel evolution strategy that operates on large populations and runs on GPU hardware. The proposed evolution strategy reduces the likelihood of getting stuck in a local optimum of the multimodal real-valued optimization problem represented by labeled point cloud superpositioning. The performance of the GPU-based parallel evolution strategy is compared to a previously proposed CPU-based sequential approach for labeled point cloud superpositioning, indicating that the GPU-based parallel evolution strategy leads to qualitatively better results and significantly shorter runtimes, with speed improvements of up to a factor of 1,500 for large populations. Binary classification tests based on the ATP, NADH, and FAD protein subsets of CavBase, a database containing putative binding sites, show average classification rate improvements from about 92 percent (CPU) to 96 percent (GPU). Further experiments indicate that the proposed GPU-based labeled point cloud superpositioning approach can be superior to traditional protein comparison approaches based on sequence alignments.

Comparative assessment of strategies to identify similar ligand-binding pockets in proteins

Background

Detecting similar ligand-binding sites in globally unrelated proteins has a wide range of applications in modern drug discovery, including drug repurposing, the prediction of side effects, and drug-target interactions. Although a number of techniques to compare binding pockets have been developed, this problem still poses significant challenges.

Results

We evaluate the performance of three algorithms to calculate similarities between ligand-binding sites, APoc, SiteEngine, and G-LoSA. Our assessment considers not only the capabilities to identify similar pockets and to construct accurate local alignments, but also the dependence of these alignments on the sequence order. We point out certain drawbacks of previously compiled datasets, such as the inclusion of structurally similar proteins, leading to an overestimated performance. To address these issues, a rigorous procedure to prepare unbiased, high-quality benchmarking sets is proposed. Further, we conduct a comparative assessment of techniques directly aligning binding pockets to indirect strategies employing structure-based virtual screening with AutoDock Vina and rDock.

Conclusions

Thorough benchmarks reveal that G-LoSA offers a fairly robust overall performance, whereas the accuracy of APoc and SiteEngine is satisfactory only against easy datasets. Moreover, combining various algorithms into a meta-predictor improves the performance of existing methods to detect similar binding sites in unrelated proteins by 5–10%. All data reported in this paper are freely available at https://osf.io/6ngbs/.

Global organization of a binding site network gives insight into evolution and structure-function relationships of proteins

The global organization of protein binding sites is analyzed by constructing a weighted network of binding sites based on their structural similarities and detecting communities of structurally similar binding sites based on the minimum description length principle. The analysis reveals that there are two central binding site communities that play the roles of the network hubs of smaller peripheral communities. The sizes of communities follow a power-law distribution, which indicates that the binding sites included in larger communities may be older and have been evolutionary structural scaffolds of more recent ones. Structurally similar binding sites in the same community bind to diverse ligands promiscuously and they are also embedded in diverse domain structures. Understanding the general principles of binding site interplay will pave the way for improved drug design and protein design.

Bioinformatics in translational drug discovery

Bioinformatics approaches are becoming ever more essential in translational drug discovery both in academia and within the pharmaceutical industry. Computational exploitation of the increasing volumes of data generated during all phases of drug discovery is enabling key challenges of the process to be addressed. Here, we highlight some of the areas in which bioinformatics resources and methods are being developed to support the drug discovery pipeline. These include the creation of large data warehouses, bioinformatics algorithms to analyse 'big data' that identify novel drug targets and/or biomarkers, programs to assess the tractability of targets, and prediction of repositioning opportunities that use licensed drugs to treat additional indications.

Large-scale detection of drug off-targets: hypotheses for drug repurposing and understanding side-effects

Background

Promiscuity in molecular interactions between small-molecules, including drugs, and proteins is widespread. Such unintended interactions can be exploited to suggest drug repurposing possibilities as well as to identify potential molecular mechanisms responsible for observed side-effects.

Methods

We perform a large-scale analysis to detect binding-site molecular interaction field similarities between the binding-sites of the primary target of 400 drugs against a dataset of 14082 cavities within 7895 different proteins representing a non-redundant dataset of all proteins with known structure. Statistically-significant cases with high levels of similarities represent potential cases where the drugs that bind the original target may in principle bind the suggested off-target. Such cases are further analysed with docking simulations to verify if indeed the drug could, in principle, bind the off-target. Diverse sources of data are integrated to associated potential cross-reactivity targets with side-effects.

Results

We observe that promiscuous binding-sites tend to display higher levels of hydrophobic and aromatic similarities. Focusing on the most statistically significant similarities (Z-score ≥ 3.0) and corroborating docking results (RMSD < 2.0 Å), we find 2923 cases involving 140 unique drugs and 1216 unique potential cross-reactivity protein targets. We highlight a few cases with a potential for drug repurposing (acetazolamide as a chorismate pyruvate lyase inhibitor, raloxifene as a bacterial quorum sensing inhibitor) as well as to explain the side-effects of zanamivir and captopril. A web-interface permits to explore the detected similarities for each of the 400 binding-sites of the primary drug targets and visualise them for the most statistically significant cases.

Conclusions

The detection of molecular interaction field similarities provide the opportunity to suggest drug repurposing opportunities as well as to identify potential molecular mechanisms responsible for side-effects. All methods utilized are freely available and can be readily applied to new query binding-sites. All data is freely available and represents an invaluable source to identify further candidates for repurposing and suggest potential mechanisms responsible for side-effects.

Electronic supplementary material

The online version of this article (doi:10.1186/s40360-017-0128-7) contains supplementary material, which is available to authorized users.

PatchSearch: A Fast Computational Method for Off-Target Detection

Many therapeutic molecules are known to bind several proteins, which can be different from the initially targeted one. Such unexpected interactions with proteins called off-targets can lead to adverse effects. Potential off-target identification is important to predict to avoid drug side effects or to discover new targets for existing drugs. We propose a new program named PatchSearch that implements local nonsequential searching for similar binding sites on protein surfaces with a controlled amount of flexibility. It is based on detection of quasi-cliques in product graphs representing all the possible matchings between two compared structures. This method has been benchmarked on a large diversity of ligands and on five data sets ranging from 12 to more than 7000 protein structures. The experiments conducted in this study show that the PatchSearch method could be useful in the early identification of off-targets. The program and the benchmarks presented in this paper are available as an R package at https://github.com/MTiPatchSearch .