scholarly journals AnnapuRNA: A scoring function for predicting RNA-small molecule binding poses

2021 ◽  
Vol 17 (2) ◽  
pp. e1008309
Author(s):  
Filip Stefaniak ◽  
Janusz M. Bujnicki
Keyword(s):  
Small Molecule ◽  
Structure Prediction ◽  
Scoring Function ◽  
Scoring Functions ◽  
Ligand Complex ◽  
Computational Docking ◽  
Knowledge Based ◽  
Docking Method ◽  
Docking Program ◽  
Post Hoc

RNA is considered as an attractive target for new small molecule drugs. Designing active compounds can be facilitated by computational modeling. Most of the available tools developed for these prediction purposes, such as molecular docking or scoring functions, are parametrized for protein targets. The performance of these methods, when applied to RNA-ligand systems, is insufficient. To overcome these problems, we developed AnnapuRNA, a new knowledge-based scoring function designed to evaluate RNA-ligand complex structures, generated by any computational docking method. We also evaluated three main factors that may influence the structure prediction, i.e., the starting conformer of a ligand, the docking program, and the scoring function used. We applied the AnnapuRNA method for a post-hoc study of the recently published structures of the FMN riboswitch. Software is available at https://github.com/filipspl/AnnapuRNA.

scholarly journals AnnapuRNA: a scoring function for predicting RNA-small molecule interactions

2020 ◽  
Author(s):  
Filip Stefaniak ◽  
Janusz M. Bujnicki
Keyword(s):  
Small Molecules ◽  
Small Molecule ◽  
Computer Aided Design ◽  
Structure Prediction ◽  
Scoring Function ◽  
Computational Method ◽  
New Drugs ◽  
Scoring Functions ◽  
Ligand Complex ◽  
Molecule Interactions

AbstractRNA is considered as an attractive target for new small molecule drugs. Designing active compounds can be facilitated by computational modeling. Most of the available tools developed for these prediction purposes, such as molecular docking or scoring functions, are parametrized for protein targets. The performance of these methods, when applied to RNA-ligand systems, is insufficient. To overcome these problems, we developed AnnapuRNA, a new knowledge-based scoring function designed to evaluate RNA-ligand complex structures, generated by any computational docking method. We also evaluated three main factors that may influence the structure prediction, i.e., starting conformer of a ligand, the docking program, and the scoring function used. We applied the AnnapuRNA method for a post-hoc study of the recently published structures of the FMN riboswitch. Software is available at https://github.com/filipspl/AnnapuRNAAuthor SummaryDrug development is a lengthy and complicated process, which requires costly experiments on a very large number of chemical compounds. The identification of chemical molecules with desired properties can be facilitated by computational methods. A number of methods were developed for computer-aided design of drugs that target protein molecules. However, recently the ribonucleic acid (RNA) emerged as an attractive target for the development of new drugs. Unfortunately, the portfolio of the computer methods that can be applied to study RNA and its interactions with small chemical molecules is very limited. This situation motivated us to develop a new computational method, with which to predict RNA-small molecule interactions. To this end, we collected the information on the statistics of interactions in experimentally determined structures of complexes formed by RNA with small molecules. We then used the statistical data to train machine learning methods aiming to distinguish between RNA-ligand interactions observed experimentally and other interactions that can be observed in theoretical analyses, but are not observed in nature. The resulting method called AnnapuRNA is superior to other similar tools and can be used to predict preferred ligands of RNA molecules and how RNA and small molecules interact with each other.

scholarly journals DeepBindRG: a deep learning based method for estimating effective protein–ligand affinity

PeerJ ◽  
2019 ◽  
Vol 7 ◽  
pp. e7362 ◽  
Author(s):  
Haiping Zhang ◽  
Linbu Liao ◽  
Konda Mani Saravanan ◽  
Peng Yin ◽  
Yanjie Wei
Keyword(s):  
Deep Learning ◽  
Ligand Binding ◽  
Binding Affinity ◽  
Mean Squared Error ◽  
Scoring Function ◽  
Binding Mode ◽  
Scoring Functions ◽  
Autodock Vina ◽  
Cellular Functions ◽  
Ligand Complex

Proteins interact with small molecules to modulate several important cellular functions. Many acute diseases were cured by small molecule binding in the active site of protein either by inhibition or activation. Currently, there are several docking programs to estimate the binding position and the binding orientation of protein–ligand complex. Many scoring functions were developed to estimate the binding strength and predict the effective protein–ligand binding. While the accuracy of current scoring function is limited by several aspects, the solvent effect, entropy effect, and multibody effect are largely ignored in traditional machine learning methods. In this paper, we proposed a new deep neural network-based model named DeepBindRG to predict the binding affinity of protein–ligand complex, which learns all the effects, binding mode, and specificity implicitly by learning protein–ligand interface contact information from a large protein–ligand dataset. During the initial data processing step, the critical interface information was preserved to make sure the input is suitable for the proposed deep learning model. While validating our model on three independent datasets, DeepBindRG achieves root mean squared error (RMSE) value of pKa (−logKd or −logKi) about 1.6–1.8 and R value around 0.5–0.6, which is better than the autodock vina whose RMSE value is about 2.2–2.4 and R value is 0.42–0.57. We also explored the detailed reasons for the performance of DeepBindRG, especially for several failed cases by vina. Furthermore, DeepBindRG performed better for four challenging datasets from DUD.E database with no experimental protein–ligand complexes. The better performance of DeepBindRG than autodock vina in predicting protein–ligand binding affinity indicates that deep learning approach can greatly help with the drug discovery process. We also compare the performance of DeepBindRG with a 4D based deep learning method “pafnucy”, the advantage and limitation of both methods have provided clues for improving the deep learning based protein–ligand prediction model in the future.

scholarly journals A knowledge–based scoring function to assess the stability of quaternary protein assemblies

2019 ◽  
Author(s):  
Abhilesh S. Dhawanjewar ◽  
Ankit Roy ◽  
M.S. Madhusudhan
Keyword(s):  
Protein Interactions ◽  
Binary Classification ◽  
Scoring Function ◽  
Protein Docking ◽  
Scoring Functions ◽  
Protein Protein Interactions ◽  
Residue Contact ◽  
Knowledge Based ◽  
Cellular Biochemistry ◽  
The Stability

AbstractMotivationElucidation of protein-protein interactions is a necessary step towards understanding the complete repertoire of cellular biochemistry. Given the enormity of the problem, the expenses and limitations of experimental methods, it is imperative that this problem is tackled computationally. In silico predictions of protein interactions entail sampling different conformations of the purported complex and then scoring these to assess for interaction viability. In this study we have devised a new scheme for scoring protein-protein interactions.ResultsOur method, PIZSA (Protein Interaction Z Score Assessment) is a binary classification scheme for identification of stable protein quaternary assemblies (binders/non-binders) based on statistical potentials. The scoring scheme incorporates residue-residue contact preference on the interface with per residue-pair atomic contributions and accounts for clashes. PIZSA can accurately discriminate between native and non-native structural conformations from protein docking experiments and outperform other recently published scoring functions, demonstrated through testing on a benchmark set and the CAPRI Score_set. Though not explicitly trained for this purpose, PIZSA potentials can identify spurious interactions that are artefacts of the crystallization process.AvailabilityPIZSA is implemented as awebserverat http://cospi.iiserpune.ac.in/pizsa/[email protected]

scholarly journals Learning from the ligand: using ligand-based features to improve binding affinity prediction

2019 ◽  
Author(s):  
Fergus Boyles ◽  
Charlotte M Deane ◽  
Garrett M Morris
Keyword(s):  
Machine Learning ◽  
Binding Affinity ◽  
Pearson Correlation ◽  
Scoring Function ◽  
Supplementary Information ◽  
Scoring Functions ◽  
Limited Information ◽  
Ligand Complex ◽  
Binding Affinity Prediction ◽  
Affinity Prediction

Abstract Motivation Machine learning scoring functions for protein–ligand binding affinity prediction have been found to consistently outperform classical scoring functions. Structure-based scoring functions for universal affinity prediction typically use features describing interactions derived from the protein–ligand complex, with limited information about the chemical or topological properties of the ligand itself. Results We demonstrate that the performance of machine learning scoring functions are consistently improved by the inclusion of diverse ligand-based features. For example, a Random Forest (RF) combining the features of RF-Score v3 with RDKit molecular descriptors achieved Pearson correlation coefficients of up to 0.836, 0.780 and 0.821 on the PDBbind 2007, 2013 and 2016 core sets, respectively, compared to 0.790, 0.746 and 0.814 when using the features of RF-Score v3 alone. Excluding proteins and/or ligands that are similar to those in the test sets from the training set has a significant effect on scoring function performance, but does not remove the predictive power of ligand-based features. Furthermore a RF using only ligand-based features is predictive at a level similar to classical scoring functions and it appears to be predicting the mean binding affinity of a ligand for its protein targets. Availability and implementation Data and code to reproduce all the results are freely available at http://opig.stats.ox.ac.uk/resources. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals Evaluation of Scoring Function Performance on DNA-ligand Complexes

2019 ◽  
Vol 13 (1) ◽  
pp. 40-49 ◽  
Author(s):  
Pedro Fong ◽  
Hong-Kong Wong
Keyword(s):  
Drug Discovery ◽  
Scoring Function ◽  
Binding Mode ◽  
Scoring Functions ◽  
Discriminative Power ◽  
Ligand Complex ◽  
Protein Ligand Interactions ◽  
Minor Groove Binders ◽  
Ligand Interactions ◽  
Chemotherapy Agents

Background: DNA has been a pharmacological target for different types of treatment, such as antibiotics and chemotherapy agents, and is still a potential target in many drug discovery processes. However, most docking and scoring approaches were parameterised for protein-ligand interactions; their suitability for modelling DNA-ligand interactions is uncertain. Objective: This study investigated the performance of four scoring functions on DNA-ligand complexes. Material & Methods: Here, we explored the ability of four docking protocols and scoring functions to discriminate the native pose of 33 DNA-ligand complexes over a compiled set of 200 decoys for each DNA-ligand complexes. The four approaches were the AutoDock, ASP@GOLD, ChemScore@GOLD and GoldScore@GOLD. Results: Our results indicate that AutoDock performed the best when predicting binding mode and that ChemScore@GOLD achieved the best discriminative power. Rescoring of AutoDock-generated decoys with ChemScore@GOLD further enhanced their individual discriminative powers. All four approaches have no discriminative power in some DNA-ligand complexes, including both minor groove binders and intercalators. Conclusion: This study suggests that the evaluation for each DNA-ligand complex should be performed in order to obtain meaningful results for any drug discovery processes. Rescoring with different scoring functions can improve discriminative power.

Docking Methodologies and Recent Advances

Oncology ◽  
2017 ◽  
pp. 804-828 ◽  
Author(s):  
Ashwani Kumar ◽  
Ruchika Goyal ◽  
Sandeep Jain
Keyword(s):  
Quantum Mechanics ◽  
Scoring Function ◽  
Scoring Functions ◽  
Post Processing ◽  
Hybrid Techniques ◽  
Knowledge Based ◽  
Recent Advances ◽  
Modern Drug ◽  
Consensus Scoring ◽  
Covalent Docking

Docking, a molecular modelling method, has wide applications in identification and optimization in modern drug discovery. This chapter addresses the recent advances in the docking methodologies like fragment docking, covalent docking, inverse docking, post processing, hybrid techniques, homology modeling etc. and its protocol like searching and scoring functions. Advances in scoring functions for e.g. consensus scoring, quantum mechanics methods, clustering and entropy based methods, fingerprinting, etc. are used to overcome the limitations of the commonly used force-field, empirical and knowledge based scoring functions. It will cover crucial necessities and different algorithms of docking and scoring. Further different aspects like protein flexibility, ligand sampling and flexibility, and the performance of scoring function will be discussed.

Docking Methodologies and Recent Advances

2016 ◽  
pp. 295-319
Author(s):  
Ashwani Kumar ◽  
Ruchika Goyal ◽  
Sandeep Jain
Keyword(s):  
Quantum Mechanics ◽  
Scoring Function ◽  
Scoring Functions ◽  
Post Processing ◽  
Hybrid Techniques ◽  
Knowledge Based ◽  
Recent Advances ◽  
Modern Drug ◽  
Consensus Scoring ◽  
Covalent Docking

Docking, a molecular modelling method, has wide applications in identification and optimization in modern drug discovery. This chapter addresses the recent advances in the docking methodologies like fragment docking, covalent docking, inverse docking, post processing, hybrid techniques, homology modeling etc. and its protocol like searching and scoring functions. Advances in scoring functions for e.g. consensus scoring, quantum mechanics methods, clustering and entropy based methods, fingerprinting, etc. are used to overcome the limitations of the commonly used force-field, empirical and knowledge based scoring functions. It will cover crucial necessities and different algorithms of docking and scoring. Further different aspects like protein flexibility, ligand sampling and flexibility, and the performance of scoring function will be discussed.

scholarly journals A knowledge-based scoring function to assess quaternary associations of proteins

2020 ◽  
Vol 36 (12) ◽  
pp. 3739-3748
Author(s):  
Abhilesh S Dhawanjewar ◽  
Ankit A Roy ◽  
Mallur S Madhusudhan
Keyword(s):  
Protein Interactions ◽  
Statistical Physics ◽  
Binary Classification ◽  
Scoring Function ◽  
Protein Docking ◽  
Supplementary Information ◽  
Scoring Functions ◽  
Biological Interactions ◽  
Protein Protein Interactions ◽  
Knowledge Based

Abstract Motivation The elucidation of all inter-protein interactions would significantly enhance our knowledge of cellular processes at a molecular level. Given the enormity of the problem, the expenses and limitations of experimental methods, it is imperative that this problem is tackled computationally. In silico predictions of protein interactions entail sampling different conformations of the purported complex and then scoring these to assess for interaction viability. In this study, we have devised a new scheme for scoring protein–protein interactions. Results Our method, PIZSA (Protein Interaction Z-Score Assessment), is a binary classification scheme for identification of native protein quaternary assemblies (binders/nonbinders) based on statistical potentials. The scoring scheme incorporates residue–residue contact preference on the interface with per residue-pair atomic contributions and accounts for clashes. PIZSA can accurately discriminate between native and non-native structural conformations from protein docking experiments and outperform other contact-based potential scoring functions. The method has been extensively benchmarked and is among the top 6 methods, outperforming 31 other statistical, physics based and machine learning scoring schemes. The PIZSA potentials can also distinguish crystallization artifacts from biological interactions. Availability and implementation PIZSA is implemented as a web server at http://cospi.iiserpune.ac.in/pizsa and can be downloaded as a standalone package from http://cospi.iiserpune.ac.in/pizsa/Download/Download.html. Supplementary information Supplementary data are available at Bioinformatics online.

Sign in / Sign up

Export Citation Format

Share Document