506 research outputs found

    11th German Conference on Chemoinformatics (GCC 2015) : Fulda, Germany. 8-10 November 2015.

    Get PDF

    An integrated drug repurposing strategy for the rapid identification of potential SARS-CoV-2 viral inhibitors

    Get PDF
    The Coronavirus disease 2019 (COVID-19) is an infectious disease caused by the severe acute respiratory syndrome-coronavirus 2 (SARS-CoV-2). The virus has rapidly spread in humans, causing the ongoing Coronavirus pandemic. Recent studies have shown that, similarly to SARS-CoV, SARS-CoV-2 utilises the Spike glycoprotein on the envelope to recognise and bind the human receptor ACE2. This event initiates the fusion of viral and host cell membranes and then the viral entry into the host cell. Despite several ongoing clinical studies, there are currently no approved vaccines or drugs that specifically target SARS-CoV-2. Until an effective vaccine is available, repurposing FDA approved drugs could significantly shorten the time and reduce the cost compared to de novo drug discovery. In this study we attempted to overcome the limitation of in silico virtual screening by applying a robust in silico drug repurposing strategy. We combined and integrated docking simulations, with molecular dynamics (MD), Supervised MD (SuMD) and Steered MD (SMD) simulations to identify a Spike protein – ACE2 interaction inhibitor. Our data showed that Simeprevir and Lumacaftor bind the receptor-binding domain of the Spike protein with high affinity and prevent ACE2 interaction

    Applications of Support Vector Machines as a Robust tool in High Throughput Virtual Screening

    Get PDF
    Chemical space is enormously huge but not all of it is pertinent for the drug designing. Virtual screening methods act as knowledge-based filters to discover the coveted novel lead molecules possessing desired pharmacological properties. Support Vector Machines (SVM) is a reliable virtual screening tool for prioritizing molecules with the required biological activity and minimum toxicity. It has to its credit inherent advantages such as support for noisy data mainly coming from varied high-throughput biological assays, high sensitivity, specificity, prediction accuracy and reduction in false positives. SVM-based classification methods can efficiently discriminate inhibitors from non-inhibitors, actives from inactives, toxic from non-toxic and promiscuous from non-promiscuous molecules. As the principles of drug design are also applicable for agrochemicals, SVM methods are being applied for virtual screening for pesticides too. The current review discusses the basic kernels and models used for binary discrimination and also features used for developing SVM-based scoring functions, which will enhance our understanding of molecular interactions. SVM modeling has also been compared by many researchers with other statistical methods such as Artificial Neural Networks, k-nearest neighbour (kNN), decision trees, partial least squares, etc. Such studies have also been discussed in this review. Moreover, a case study involving the use of SVM method for screening molecules for cancer therapy has been carried out and the preliminary results presented here indicate that the SVM is an excellent classifier for screening the molecules

    A knowledge-guided strategy for improving the accuracy of scoring functions in binding affinity prediction

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propose a general knowledge-guided scoring (KGS) strategy to tackle this problem. Our KGS strategy computes the binding constant of a given protein-ligand complex based on the known binding constant of an appropriate reference complex. A good training set that includes a sufficient number of protein-ligand complexes with known binding data needs to be supplied for finding the reference complex. The reference complex is required to share a similar pattern of key protein-ligand interactions to that of the complex of interest. Thus, some uncertain factors in protein-ligand binding may cancel out, resulting in a more accurate prediction of absolute binding constants.</p> <p>Results</p> <p>In our study, an automatic algorithm was developed for summarizing key protein-ligand interactions as a pharmacophore model and identifying the reference complex with a maximal similarity to the query complex. Our KGS strategy was evaluated in combination with two scoring functions (X-Score and PLP) on three test sets, containing 112 HIV protease complexes, 44 carbonic anhydrase complexes, and 73 trypsin complexes, respectively. Our results obtained on crystal structures as well as computer-generated docking poses indicated that application of the KGS strategy produced more accurate predictions especially when X-Score or PLP alone did not perform well.</p> <p>Conclusions</p> <p>Compared to other targeted scoring functions, our KGS strategy does not require any re-parameterization or modification on current scoring methods, and its application is not tied to certain systems. The effectiveness of our KGS strategy is in theory proportional to the ever-increasing knowledge of experimental protein-ligand binding data. Our KGS strategy may serve as a more practical remedy for current scoring functions to improve their accuracy in binding affinity prediction.</p

    Improved prediction of ligand-protein binding affinities by meta-modeling

    Full text link
    The accurate screening of candidate drug ligands against target proteins through computational approaches is of prime interest to drug development efforts, as filtering potential candidates would save time and expenses for finding drugs. Such virtual screening depends in part on methods to predict the binding affinity between ligands and proteins. Given many computational models for binding affinity prediction with varying results across targets, we herein develop a meta-modeling framework by integrating published empirical structure-based docking and sequence-based deep learning models. In building this framework, we evaluate many combinations of individual models, training databases, and linear and nonlinear meta-modeling approaches. We show that many of our meta-models significantly improve affinity predictions over individual base models. Our best meta-models achieve comparable performance to state-of-the-art exclusively structure-based deep learning tools. Overall, we demonstrate that diverse modeling approaches can be ensembled together to gain substantial improvement in binding affinity prediction while allowing control over input features such as physicochemical properties or molecular descriptors.Comment: 61 pages, 3 main tables, 6 main figures, 6 supplementary figures, and supporting information. For 8 supplementary tables and code, see https://github.com/Lee1701/Lee2023
    corecore