Ligand Binding Site Similarity Identification Based on Chemical and Geometric Similarity

The similarity comparison of binding sites based on amino acid between different proteins can facilitate protein function identification. However, Binding site usually consists of several crucial amino acids which are frequently dispersed among different regions of a protein and consequently make the comparison of binding sites difficult. In this study, we introduce a new method, named as chemical and geometric similarity of binding site (CGS-BSite), to compute the ligand binding site similarity based on discrete amino acids with maximum-weight bipartite matching algorithm. The principle of computing the similarity is to find a Euclidean Transformation which makes the similar amino acids approximate to each other in a geometry space, and vice versa. CGS-BSite permits site and ligand flexibilities, provides a stable prediction performance on the flexible ligand binding sites. Binding site prediction on three test datasets with CGS-BSite method has similar performance to Patch-Surfer method but outperforms other five tested methods, reaching to 0.80, 0.71 and 0.85 based on the area under the receiver operating characteristic curve, respectively. It performs a marginally better than Patch-Surfer on the binding sites with small volume and higher hydrophobicity, and presents good robustness to the variance of the volume and hydrophobicity of ligand binding sites. Overall, our method provides an alternative approach to compute the ligand binding site similarity and predict potential special ligand binding sites from the existing ligand targets based on the target similarity.     

Rapid protein-ligand docking using soft modes from molecular dynamics simulations to account for protein deformability: binding of FK506 to FKBP

Most current docking methods to identify possible ligands and putative binding sites on a receptor molecule assume a rigid receptor structure to allow virtual screening of large ligand databases. However, binding of a ligand can lead to changes in the receptor protein conformation that are sterically necessary to accommodate a bound ligand. An approach is presented that allows relaxation of the protein conformation in precalculated soft flexible degrees of freedom during ligand-receptor docking. For the immunosuppressant FK506-binding protein FKBP, the soft flexible modes are extracted as principal components of motion from a molecular dynamics simulation. A simple penalty function for deformations in the soft flexible mode is used to limit receptor protein deformations during docking that avoids a costly recalculation of the receptor energy by summing over all receptor atom pairs at each step. Rigid docking of the FK506 ligand binding to an unbound FKBP conformation failed to identify a geometry close to experiment as favorable binding site. In contrast, inclusion of the flexible soft modes during systematic docking runs selected a binding geometry close to experiment as lowest energy conformation. This has been achieved at a modest increase of computational cost compared to rigid docking. The approach could provide a computationally efficient way to approximately account for receptor flexibility during docking of large numbers of putative ligands and putative docking geometries.     

Improving accuracy and efficiency of blind protein-ligand docking by focusing on predicted binding sites

The use of predicted binding sites (binding sites calculated from the protein structure alone) is evaluated here as a tool to focus the docking of small molecule ligands into protein structures, simulating cases where the real binding sites are unknown. The resulting approach consists of a few independent docking runs carried out on small boxes, centered on the predicted binding sites, as opposed to one larger blind docking run that covers the complete protein structure. The focused and blind approaches were compared using a set of 77 known protein-ligand complexes and 19 ligand-free structures. The focused approach is shown to: (1) identify the correct binding site more frequently than blind docking; (2) produce more accurate docking poses for the ligand; (3) require less computational time. Additionally, the results show that very few real binding sites are missed in spite of focusing on only three predicted binding sites per target protein. Overall the results indicate that, by improving the sampling in regions that are likely to correspond to binding sites, the focused docking approach increases accuracy and efficiency of protein ligand docking for those cases where the ligand-binding site is unknown. This is especially relevant in applications such as reverse virtual screening and structure-based functional annotation of proteins.     

Validation of an Allosteric Binding Site of Src Kinase Identified by Unbiased Ligand Binding Simulations

Allostery plays a primary role in regulating protein activity, making it an important mechanism in human disease and drug discovery. Identifying allosteric regulatory sites to explore their biological significance and therapeutic potential is invaluable to drug discovery; however, identification remains a challenge. Allosteric sites are often “cryptic” without clear geometric or chemical features. Since allosteric regulatory sites are often less conserved in protein kinases than the orthosteric ATP binding site, allosteric ligands are commonly more specific than ATP competitive inhibitors. We present a generalizable computational protocol to predict allosteric ligand binding sites based on unbiased ligand binding simulation trajectories. We demonstrate the feasibility of this protocol by revisiting our previously published ligand binding simulations using the first identified viral proto-oncogene, Src kinase, as a model system. The binding paths for kinase inhibitor PP1 uncovered three metastable intermediate states before binding the high-affinity ATP-binding pocket, revealing two previously known allosteric sites and one novel site. Herein, we validate the novel site using a combination of virtual screening and experimental assays to identify a V-type allosteric small-molecule inhibitor that targets this novel site with specificity for Src over closely related kinases. This study provides a proof-of-concept for employing unbiased ligand binding simulations to identify cryptic allosteric binding sites and is widely applicable to other protein–ligand systems.     

174 Self-association prompts proteins for new function: The role of altered dynamic properties

Local backbone flexibility along the chain was analyzed in pairs of monomer and homodimeric protein structures with identical sequence. We identified pairs, where highly flexible regions (corresponding to prominent peaks in rmsd’s or crystallographic B-factor values) clearly ‘migrate’ to a new location along the polypeptide in the homodimer. We present several systems, where the new flexible region can be linked to the recruitment of a 3rd binding partner, and where this recruitment is not reported for the corresponding monomer. Conformational sampling of these systems over microsecond timescales further confirms the flexibility migration phenomenon. Compelling evidence is provided that altered backbone flexibility in the homodimer state enables specific recruitment of the heterologous binding partner through the process of conformational selection. Our findings lend support to conformational selection as a general mechanism for protein–ligand binding and highlight the regulatory allosteric role played by the homomeric association event itself. There are many examples of allosteric behavior in homo-oligomers, but this is the first time that homomer association is shown to be the binding event that alters binding properties elsewhere in the protein.     

Beyond structural genomics: computational approaches for the identification of ligand binding sites in protein structures

Structural genomics projects have revealed structures for a large number of proteins of unknown function. Understanding the interactions between these proteins and their ligands would provide an initial step in their functional characterization. Binding site identification methods are a fast and cost-effective way to facilitate the characterization of functionally important protein regions. In this review we describe our recently developed methods for binding site identification in the context of existing methods. The advantage of energy-based approaches is emphasized, since they provide flexibility in the identification and characterization of different types of binding sites.     

Comparison of Rosetta flexible-backbone computational protein design methods on binding interactions

Computational design of binding sites in proteins remains difficult, in part due to limitations in our current ability to sample backbone conformations that enable precise and accurate geometric positioning of side chains during sequence design. Here we present a benchmark framework for comparison between flexible-backbone design methods applied to binding interactions. We quantify the ability of different flexible backbone design methods in the widely used protein design software Rosetta to recapitulate observed protein sequence profiles assumed to represent functional protein/protein and protein/small molecule binding interactions. The CoupledMoves method, which combines backbone flexibility and sequence exploration into a single acceptance step during the sampling trajectory, better recapitulates observed sequence profiles than the BackrubEnsemble and FastDesign methods, which separate backbone flexibility and sequence design into separate acceptance steps during the sampling trajectory. Flexible-backbone design with the CoupledMoves method is a powerful strategy for reducing sequence space to generate targeted libraries for experimental screening and selection.     

DynaDock: A new molecular dynamics‐based algorithm for protein–peptide docking including receptor flexibility

Molecular docking programs play an important role in drug development and many well‐established methods exist. However, there are two situations for which the performance of most approaches is still not satisfactory, namely inclusion of receptor flexibility and docking of large, flexible ligands like peptides. In this publication a new approach is presented for docking peptides into flexible receptors. For this purpose a two step procedure was developed: first, the protein–peptide conformational space is scanned and approximate ligand poses are identified and second, the identified ligand poses are refined by a new molecular dynamics‐based method, optimized potential molecular dynamics (OPMD). The OPMD approach uses soft‐core potentials for the protein–peptide interactions and applies a new optimization scheme to the soft‐core potential. Comparison with refinement results obtained by conventional molecular dynamics and a soft‐core scaling approach shows significant improvements in the sampling capability for the OPMD method. Thus, the number of starting poses needed for successful refinement is much lower than for the other methods. The algorithm was evaluated on 15 protein–peptide complexes with 2–16mer peptides. Docking poses with peptide RMSD values <2.10 Å from the equilibrated experimental structures were obtained in all cases. For four systems docking into the unbound receptor structures was performed, leading to peptide RMSD values <2.12 Å. Using a specifically fitted scoring function in 11 of 15 cases the best scoring poses featured a peptide RMSD ≤2.10 Å. Proteins 2010. © 2009 Wiley‐Liss, Inc.     

SiteMotif: A graph-based algorithm for deriving structural motifs in Protein Ligand binding sites

Studying similarities in protein molecules has become a fundamental activity in much of biology and biomedical research, for which methods such as multiple sequence alignments are widely used. Most methods available for such comparisons cater to studying proteins which have clearly recognizable evolutionary relationships but not to proteins that recognize the same or similar ligands but do not share similarities in their sequence or structural folds. In many cases, proteins in the latter class share structural similarities only in their binding sites. While several algorithms are available for comparing binding sites, there are none for deriving structural motifs of the binding sites, independent of the whole proteins. We report the development of SiteMotif, a new algorithm that compares binding sites from multiple proteins and derives sequence-order independent structural site motifs. We have tested the algorithm at multiple levels of complexity and demonstrate its performance in different scenarios. We have benchmarked against 3 current methods available for binding site comparison and demonstrate superior performance of our algorithm. We show that SiteMotif identifies new structural motifs of spatially conserved residues in proteins, even when there is no sequence or fold-level similarity. We expect SiteMotif to be useful for deriving key mechanistic insights into the mode of ligand interaction, predict the ligand type that a protein can bind and improve the sensitivity of functional annotation.     

Protein function annotation by local binding site surface similarity

Hundreds of protein crystal structures exist for proteins whose function cannot be confidently determined from sequence similarity. Surflex‐PSIM, a previously reported surface‐based protein similarity algorithm, provides an alternative method for hypothesizing function for such proteins. The method now supports fully automatic binding site detection and is fast enough to screen comprehensive databases of protein binding sites. The binding site detection methodology was validated on apo/holo cognate protein pairs, correctly identifying 91% of ligand binding sites in holo structures and 88% in apo structures where corresponding sites existed. For correctly detected apo binding sites, the cognate holo site was the most similar binding site 87% of the time. PSIM was used to screen a set of proteins that had poorly characterized functions at the time of crystallization, but were later biochemically annotated. Using a fully automated protocol, this set of 8 proteins was screened against ～60,000 ligand binding sites from the PDB. PSIM correctly identified functional matches that predated query protein biochemical annotation for five out of the eight query proteins. A panel of 12 currently unannotated proteins was also screened, resulting in a large number of statistically significant binding site matches, some of which suggest likely functions for the podorly characterized proteins. Proteins 2014; 82:679–694. © 2013 Wiley Periodicals, Inc.     

FTSite: high accuracy detection of ligand binding sites on unbound protein structures

MOTIVATION: Binding site identification is a classical problem that is important for a range of applications, including the structure-based prediction of function, the elucidation of functional relationships among proteins, protein engineering and drug design. We describe an accurate method of binding site identification, namely FTSite. This method is based on experimental evidence that ligand binding sites also bind small organic molecules of various shapes and polarity. The FTSite algorithm does not rely on any evolutionary or statistical information, but achieves near experimental accuracy: it is capable of identifying the binding sites in over 94% of apo proteins from established test sets that have been used to evaluate many other binding site prediction methods. AVAILABILITY: FTSite is freely available as a web-based server at http://ftsite.bu.edu.     

Automated identification of binding sites for phosphorylated ligands in protein structures

Phosphorylation is a crucial step in many cellular processes, ranging from metabolic reactions involved in energy transformation to signaling cascades. In many instances, protein domains specifically recognize the phosphogroup. Knowledge of the binding site provides insights into the interaction, and it can also be exploited for therapeutic purposes. Previous studies have shown that proteins interacting with phosphogroups are highly heterogeneous, and no single property can be used to reliably identify the binding site. Here we present an energy‐based computational procedure that exploits the protein three‐dimensional structure to identify binding sites involved in the recognition of phosphogroups. The procedure is validated on three datasets containing more than 200 proteins binding to ATP, phosphopeptides, and phosphosugars. A comparison against other three generic binding site identification approaches shows higher accuracy values for our method, with a correct identification rate in the 80–90% range for the top three predicted sites. Addition of conservation information further improves the performance. The method presented here can be used as a first step in functional annotation or to guide mutagenesis experiments and further studies such as molecular docking. Proteins 2012;. © 2012 Wiley Periodicals, Inc.     

Anatomy of protein pockets and cavities: measurement of binding site geometry and implications for ligand design.

Identification and size characterization of surface pockets and occluded cavities are initial steps in protein structure-based ligand design. A new program, CAST, for automatically locating and measuring protein pockets and cavities, is based on precise computational geometry methods, including alpha shape and discrete flow theory. CAST identifies and measures pockets and pocket mouth openings, as well as cavities. The program specifies the atoms lining pockets, pocket openings, and buried cavities; the volume and area of pockets and cavities; and the area and circumference of mouth openings. CAST analysis of over 100 proteins has been carried out; proteins examined include a set of 51 monomeric enzyme-ligand structures, several elastase-inhibitor complexes, the FK506 binding protein, 30 HIV-1 protease-inhibitor complexes, and a number of small and large protein inhibitors. Medium-sized globular proteins typically have 10-20 pockets/cavities. Most often, binding sites are pockets with 1-2 mouth openings; much less frequently they are cavities. Ligand binding pockets vary widely in size, most within the range 10(2)-10(3)A3. Statistical analysis reveals that the number of pockets and cavities is correlated with protein size, but there is no correlation between the size of the protein and the size of binding sites. Most frequently, the largest pocket/cavity is the active site, but there are a number of instructive exceptions. Ligand volume and binding site volume are somewhat correlated when binding site volume is < or =700 A3, but the ligand seldom occupies the entire site. Auxiliary pockets near the active site have been suggested as additional binding surface for designed ligands (Mattos C et al., 1994, Nat Struct Biol 1:55-58). Analysis of elastase-inhibitor complexes suggests that CAST can identify ancillary pockets suitable for recruitment in ligand design strategies. Analysis of the FK506 binding protein, and of compounds developed in SAR by NMR (Shuker SB et al., 1996, Science 274:1531-1534), indicates that CAST pocket computation may provide a priori identification of target proteins for linked-fragment design. CAST analysis of 30 HIV-1 protease-inhibitor complexes shows that the flexible active site pocket can vary over a range of 853-1,566 A3, and that there are two pockets near or adjoining the active site that may be recruited for ligand design.     

Crystallographic and calorimetric analysis of peptide binding to OppA protein.

Isothermal titration calorimetry has been used to study the binding of 20 different peptides to the peptide binding protein OppA, and the crystal structures of the ligand complexes have been refined. This periplasmic binding protein, part of the oligopeptide permease system of Gram negative bacteria, has evolved to bind and enclose small peptides of widely varying sequences. The peptides used in this study have the sequence Lys-X-Lys, where X is any of the 20 commonly occurring amino acids. The various side-chains found at position 2 on the ligand fit into a hydrated pocket. The majority of side-chains are restrained to particular conformations within the pocket. Water molecules act as flexible adapters, matching the hydrogen-bonding requirements of the protein and ligand and shielding charges on the buried ligand. This use of water by OppA to broaden the repertoire of its binding site is not unique, but contrasts sharply with other proteins which use water to help bind ligands highly selectively. Predicting the thermodynamics of binding from the structure of the complexes is highly complicated by the influence of water on the system.     

Allosteric sites can be identified based on the residue–residue interaction energy difference

Allosteric drugs act at a distance to regulate protein functions. They have several advantages over conventional orthosteric drugs, including diverse regulation types and fewer side effects. However, the rational design of allosteric ligands remains a challenge, especially when it comes to the identification allosteric binding sites. As the binding of allosteric ligands may induce changes in the pattern of residue–residue interactions, we calculated the residue–residue interaction energies within the allosteric site based on the molecular mechanics generalized Born surface area energy decomposition scheme. Using a dataset of 17 allosteric proteins with structural data for both the apo and the ligand‐bound state available, we used conformational ensembles generated by molecular dynamics simulations to compute the differences in the residue–residue interaction energies in known allosteric sites from both states. For all the known sites, distinct interaction energy differences (>25%) were observed. We then used CAVITY, a binding site detection program to identify novel putative allosteric sites in the same proteins. This yielded a total of 31 “druggable binding sites,” of which 21 exhibited >25% difference in residue interaction energies, and were hence predicted as novel allosteric sites. Three of the predicted allosteric sites were supported by recent experimental studies. All the predicted sites may serve as novel allosteric sites for allosteric ligand design. Our study provides a computational method for identifying novel allosteric sites for allosteric drug design. Proteins 2015; 83:1375–1384. © 2014 Wiley Periodicals, Inc.     

Applying conformational selection theory to improve crossdocking efficiency in 3‐phosphoinositide dependent protein kinase‐1

The emerging picture of biomolecular recognition is that of conformational selection followed by induced‐fit. Conformational selection theory states that binding partners exist in various conformations in solution, with binding involving a “selection” between complementary conformers. In this study, we devise a docking protocol that mimics conformational selection in protein–ligand binding and demonstrate that it significantly enhances crossdocking accuracy over Glide's flexible docking protocol, which is widely used in the pharmaceutical industry. Our protocol uses a pregenerated conformational ensemble to simulate ligand flexibility. The ensemble was generated by thorough conformational sampling coupled with conformer minimization. The generated conformers were then rigidly docked in the active site of the protein along with a postdocking minimization step that allows limited induced fit effects to be modeled for the ligand. We illustrate the improved performance of our protocol through crossdocking of 31 ligands to cocomplexed proteins of the kinase 3‐phosphoinositide dependent protein kinase‐1 extracted from the crystal structures 1H1W (ATP bound), 1OKY (staurosporine bound) and 3QD0 (bound to a potent inhibitor). Consistent with conformational selection theory, the performance of our protocol was the best for crossdocking to the cognate protein bound to the natural ligand, ATP. Proteins 2014; 82:436–451. © 2013 Wiley Periodicals, Inc.     

Towards predicting Ca2+‐binding sites with different coordination numbers in proteins with atomic resolution

Ca²⁺‐binding sites in proteins exhibit a wide range of polygonal geometries that directly relate to an equally‐diverse set of biological functions. Although the highly‐conserved EF‐Hand motif has been studied extensively, non‐EF‐Hand sites exhibit much more structural diversity which has inhibited efforts to determine the precise location of Ca²⁺‐binding sites, especially for sites with few coordinating ligands. Previously, we established an algorithm capable of predicting Ca²⁺‐binding sites using graph theory to identify oxygen clusters comprised of four atoms lying on a sphere of specified radius, the center of which was the predicted calcium position. Here we describe a new algorithm, MUG (MUltiple Geometries), which predicts Ca²⁺‐binding sites in proteins with atomic resolution. After first identifying all the possible oxygen clusters by finding maximal cliques, a calcium center (CC) for each cluster, corresponding to the potential Ca²⁺ position, is located to maximally regularize the structure of the (cluster, CC) pair. The structure is then inspected by geometric filters. An unqualified (cluster, CC) pair is further handled by recursively removing oxygen atoms and relocating the CC until its structure is either qualified or contains fewer than four ligand atoms. Ligand coordination is then determined for qualified structures. This algorithm, which predicts both Ca²⁺ positions and ligand groups, has been shown to successfully predict over 90% of the documented Ca²⁺‐binding sites in three datasets of highly‐diversified protein structures with 0.22 to 0.49 Å accuracy. All multiple‐binding sites (i.e. sites with a single ligand atom associated with multiple calcium ions) were predicted, as were half of the low‐coordination sites (i.e. sites with less than four protein ligand atoms) and 14/16 cofactor‐coordinating sites. Additionally, this algorithm has the flexibility to incorporate surface water molecules and protein cofactors to further improve the prediction for low‐coordination and cofactor‐coordinating Ca²⁺‐binding sites. Proteins 2009. © 2008 Wiley‐Liss, Inc.     

Structure-Based Druggability Assessment of the Mammalian Structural Proteome with Inclusion of Light Protein Flexibility

Advances reported over the last few years and the increasing availability of protein crystal structure data have greatly improved structure-based druggability approaches. However, in practice, nearly all druggability estimation methods are applied to protein crystal structures as rigid proteins, with protein flexibility often not directly addressed. The inclusion of protein flexibility is important in correctly identifying the druggability of pockets that would be missed by methods based solely on the rigid crystal structure. These include cryptic pockets and flexible pockets often found at protein-protein interaction interfaces. Here, we apply an approach that uses protein modeling in concert with druggability estimation to account for light protein backbone movement and protein side-chain flexibility in protein binding sites. We assess the advantages and limitations of this approach on widely-used protein druggability sets. Applying the approach to all mammalian protein crystal structures in the PDB results in identification of 69 proteins with potential druggable cryptic pockets.