TRITON: a graphical tool for ligand-binding protein engineering.
Ontology highlight
ABSTRACT: Unlabelled
The new version of the TRITON program provides user-friendly graphical tools for modeling protein mutants using the external program MODELLER and for docking ligands into the mutants using the external program AutoDock. TRITON can now be used to design ligand-binding proteins, to study protein-ligand binding mechanisms or simply to dock any ligand to a protein.Availability
Executable files of TRITON are available free of charge for academic users at http://ncbr.chemi.muni.cz/triton/
SUBMITTER: Prokop M
PROVIDER: S-EPMC2519160 | biostudies-literature | 2008 Sep
REPOSITORIES: biostudies-literature
Publications
TRITON: a graphical tool for ligand-binding protein engineering.
Prokop Martin M Adam Jan J Kríz Zdenek Z Wimmerová Michaela M Koca Jaroslav J
Bioinformatics (Oxford, England) 20080704 17
<h4>Unlabelled</h4>The new version of the TRITON program provides user-friendly graphical tools for modeling protein mutants using the external program MODELLER and for docking ligands into the mutants using the external program AutoDock. TRITON can now be used to design ligand-binding proteins, to study protein-ligand binding mechanisms or simply to dock any ligand to a protein.<h4>Availability</h4>Executable files of TRITON are available free of charge for academic users at http://ncbr.chemi.m ...[more]
Similar Datasets
Project description:Kinases have been often targeted in drug therapy aimed at blocking signaling pathways. However, the conservation of protein structure across homologs often leads to uncontrolled cross-reactivity. On the other hand, sticky packing defects in proteins are typically not conserved across homologs, making them ligand-anchoring sites potentially important to enhance selectivity. Thus, we introduce a hierarchical clustering of PDB-reported kinases according to packing differences. This kinome partitioning is highly correlated with proximity relations arising from the pharmacological profiling of kinases. A variable packing sensitivity is observed for individual drugs, with highly promiscuous ligands being the most insensitive to packing differences. Our classifier enables a strategy to design selective inhibitors.
| S-EPMC1945244 | biostudies-literature
Project description:XChemExplorer (XCE) is a data-management and workflow tool to support large-scale simultaneous analysis of protein-ligand complexes during structure-based ligand discovery (SBLD). The user interfaces of established crystallographic software packages such as CCP4 [Winn et al. (2011), Acta Cryst. D67, 235-242] or PHENIX [Adams et al. (2010), Acta Cryst. D66, 213-221] have entrenched the paradigm that a `project' is concerned with solving one structure. This does not hold for SBLD, where many almost identical structures need to be solved and analysed quickly in one batch of work. Functionality to track progress and annotate structures is essential. XCE provides an intuitive graphical user interface which guides the user from data processing, initial map calculation, ligand identification and refinement up until data dissemination. It provides multiple entry points depending on the need of each project, enables batch processing of multiple data sets and records metadata, progress and annotations in an SQLite database. XCE is freely available and works on any Linux and Mac OS X system, and the only dependency is to have the latest version of CCP4 installed. The design and usage of this tool are described here, and its usefulness is demonstrated in the context of fragment-screening campaigns at the Diamond Light Source. It is routinely used to analyse projects comprising 1000 data sets or more, and therefore scales well to even very large ligand-design projects.
| S-EPMC5349439 | biostudies-literature
Project description:The estimation of prediction quality is important because without quality measures, it is difficult to determine the usefulness of a prediction. Currently, methods for ligand binding site residue predictions are assessed in the function prediction category of the biennial Critical Assessment of Techniques for Protein Structure Prediction (CASP) experiment, utilizing the Matthews Correlation Coefficient (MCC) and Binding-site Distance Test (BDT) metrics. However, the assessment of ligand binding site predictions using such metrics requires the availability of solved structures with bound ligands. Thus, we have developed a ligand binding site quality assessment tool, FunFOLDQA, which utilizes protein feature analysis to predict ligand binding site quality prior to the experimental solution of the protein structures and their ligand interactions. The FunFOLDQA feature scores were combined using: simple linear combinations, multiple linear regression and a neural network. The neural network produced significantly better results for correlations to both the MCC and BDT scores, according to Kendall's ?, Spearman's ? and Pearson's r correlation coefficients, when tested on both the CASP8 and CASP9 datasets. The neural network also produced the largest Area Under the Curve score (AUC) when Receiver Operator Characteristic (ROC) analysis was undertaken for the CASP8 dataset. Furthermore, the FunFOLDQA algorithm incorporating the neural network, is shown to add value to FunFOLD, when both methods are employed in combination. This results in a statistically significant improvement over all of the best server methods, the FunFOLD method (6.43%), and one of the top manual groups (FN293) tested on the CASP8 dataset. The FunFOLDQA method was also found to be competitive with the top server methods when tested on the CASP9 dataset. To the best of our knowledge, FunFOLDQA is the first attempt to develop a method that can be used to assess ligand binding site prediction quality, in the absence of experimental data.
| S-EPMC3364224 | biostudies-literature
Project description:Diabetes affects over 100 million people worldwide. Better methods for monitoring blood glucose levels are needed for improving disease management. Several labs have previously made glucose nanosensors by modifying members of the periplasmic ligand binding protein superfamily. This minireview summarizes recent developments in constructing new versions of these proteins that are responsive within the physiological range of blood glucose levels, employ new reporter groups, and/or are more robust. These experiments are important steps in the development of novel proteins that have the characteristics needed for an implantable glucose nanosensor for diabetes management: specificity for glucose, rapid response, sensitivity within the physiological range of glucose concentrations, reproducibility, and robustness.
| S-EPMC3215197 | biostudies-literature
Project description:AIM AND OBJECTIVE:The rapid increase in the amount of protein sequence data available leads to an urgent need for novel computational algorithms to analyze and compare these sequences. This study is undertaken to develop an efficient computational approach for timely encoding protein sequences and extracting the hidden information. METHODS:Based on two physicochemical properties of amino acids, a protein primary sequence was converted into a three-letter sequence, and then a graph without loops and multiple edges and its geometric line adjacency matrix were obtained. A generalized PseAAC (pseudo amino acid composition) model was thus constructed to characterize a protein sequence numerically. RESULTS:By using the proposed mathematical descriptor of a protein sequence, similarity comparisons among ?-globin proteins of 17 species and 72 spike proteins of coronaviruses were made, respectively. The resulting clusters agreed well with the established taxonomic groups. In addition, a generalized PseAAC based SVM (support vector machine) model was developed to identify DNA-binding proteins. Experiment results showed that our method performed better than DNAbinder, DNA-Prot, iDNA-Prot and enDNA-Prot by 3.29-10.44% in terms of ACC, 0.056-0.206 in terms of MCC, and 1.45-15.76% in terms of F1M. When the benchmark dataset was expanded with negative samples, the presented approach outperformed the four previous methods with improvement in the range of 2.49-19.12% in terms of ACC, 0.05-0.32 in terms of MCC, and 3.82- 33.85% in terms of F1M. CONCLUSION:These results suggested that the generalized PseAAC model was very efficient for comparison and analysis of protein sequences, and very competitive in identifying DNA-binding proteins.
| S-EPMC5930480 | biostudies-literature
Project description: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.
| S-EPMC6091426 | biostudies-literature
Project description:SummaryUnderstanding the binding site of the target protein is essential for rational drug design. Pocket detection software predicts the ligand binding site of the target protein; however, the predicted protein pockets are often excessively estimated in comparison with the actual volume of the bound ligands. This study proposes a refinement tool for the pockets predicted by an alpha sphere-based approach, Pocket to Concavity (P2C). P2C is divided into two modes: Ligand-Free (LF) and Ligand-Bound (LB) modes. The LF mode provides the shape of the deep and druggable concavity where the core scaffold can bind. The LB mode searches the deep concavity around the bound ligand. Thus, P2C is useful for identifying and designing desirable compounds in Structure-Based Drug Design (SBDD).Availability and implementationPocket to Concavity is freely available at https://github.com/genki-kudo/Pocket-to-Concavity. This tool is implemented in Python3 and Fpocket2.
| S-EPMC10148677 | biostudies-literature
Project description:The computational prediction of unbinding rate constants is presently an emerging topic in drug design. However, the importance of predicting kinetic rates is not restricted to pharmaceutical applications. Many biotechnologically relevant enzymes have their efficiency limited by the binding of the substrates or the release of products. While aiming at improving the ability of our model enzyme haloalkane dehalogenase DhaA to degrade the persistent anthropogenic pollutant 1,2,3-trichloropropane (TCP), the DhaA31 mutant was discovered. This variant had a 32-fold improvement of the catalytic rate toward TCP, but the catalysis became rate-limited by the release of the 2,3-dichloropropan-1-ol (DCP) product from its buried active site. Here we present a computational study to estimate the unbinding rates of the products from DhaA and DhaA31. The metadynamics and adaptive sampling methods were used to predict the relative order of kinetic rates in the different systems, while the absolute values depended significantly on the conditions used (method, force field, and water model). Free energy calculations provided the energetic landscape of the unbinding process. A detailed analysis of the structural and energetic bottlenecks allowed the identification of the residues playing a key role during the release of DCP from DhaA31 via the main access tunnel. Some of these hot-spots could also be identified by the fast CaverDock tool for predicting the transport of ligands through tunnels. Targeting those hot-spots by mutagenesis should improve the unbinding rates of the DCP product and the overall catalytic efficiency with TCP.
| S-EPMC6331733 | biostudies-literature
Project description:Many research groups and institutions have created a variety of databases curating experimental and predicted data related to protein-ligand binding. The landscape of available databases is dynamic, with new databases emerging and established databases becoming defunct. Here, we review the current state of databases that contain binding pockets and protein-ligand binding interactions. We have compiled a list of such databases, fifty-three of which are currently available for use. We discuss variation in how binding pockets are defined and summarize pocket-finding methods. We organize the fifty-three databases into subgroups based on goals and contents, and describe standard use cases. We also illustrate that pockets within the same protein are characterized differently across different databases. Finally, we assess critical issues of sustainability, accessibility and redundancy.
| S-EPMC10997877 | biostudies-literature
Project description:In classic work, Kuntz et al. (Proc. Nat. Acad. Sci. USA 1999, 96, 9997-10002) introduced the concept of ligand efficiency. Though that study focused primarily on drug-like molecules, it also showed that metal binding led to the greatest ligand efficiencies. Here, the physical limits of binding are examined across the wide variety of small molecules in the Binding MOAD database. The complexes with the greatest ligand efficiencies share the trait of being small, charged ligands bound in highly charged, well buried binding sites. The limit of ligand efficiency is -1.75 kcal/mol·atom for the protein-ligand complexes within Binding MOAD, and 95% of the set have efficiencies below a "soft limit" of -0.83 kcal/mol·atom. On the basis of buried molecular surface area, the hard limit of ligand efficiency is -117 cal/mol·Å(2), which is in surprising agreement with the limit of macromolecule-protein binding. Close examination of the most efficient systems reveals their incredibly high efficiency is dictated by tight contacts between the charged groups of the ligand and the pocket. In fact, a misfit of 0.24 Å in the average contacts inherently decreases the maximum possible efficiency by at least 0.1 kcal/mol·atom.
| S-EPMC3428497 | biostudies-literature