Virtual Screening of Kinase Based Drugs: Statistical Learning Towards Drug Repositioning

M. T. Mustapha, D. Flower, A. Chattopadhyay
{"title":"Virtual Screening of Kinase Based Drugs: Statistical Learning Towards Drug Repositioning","authors":"M. T. Mustapha, D. Flower, A. Chattopadhyay","doi":"10.12974/2311-8792.2022.08.03","DOIUrl":null,"url":null,"abstract":"Kinases are phosphate catalysing enzymes that have traditionally proved difficult to target against ligands,and hence inefficacious in drug development. There are two colluding reasons for this. First is the issue of specificity. The homogeneity that exists between the kinase ATP-binding pockets makes it a non-realisable target to developcompounds that would inhibit only one out of 538 protein kinases encoded by the human genome, without inhibitingsome of the others. Second, producing compounds with the required efficacy to rival the millimolar ATP concentrations present in cells is stoichiometrically inefficient. This study uses a recently propounded computational strategy based onStructure Based Virtual Screening (SBVS) that was previously benchmarked on 999 DUD-E protein decoys(Chattopadhyay et al, Int Sc. Comp. Life Sciences 2022), to rank potential ligands, or by extension rank kinase-ligand pairs, identifying best matching ligand:kinase docking pairs. The results of the SBVS campaign employing severalcomputational algorithms reveal variations in the preferred top hits. To address this, we introduce a novel consensusscoring algorithm by sampling statistics across four independent statistical universality classes, statistically combining docking scores from ten docking programs (DOCK, Quick Vina-W, Vina Carb, PLANTS, Autodock, QuickVina2,QuickVina21, Smina, Autodock Vina and VinaXB) to create a holistic SBVS formulation that can identify active ligandsfor any target. Our results demonstrate that CS provides improved ligand:kinase docking fidelity when compared to individual docking platforms, requiring only a small number of docking combinations, and can serve as a viable andthrifty alternative to expensive docking platforms.","PeriodicalId":198717,"journal":{"name":"Journal of Nanotechnology in Diagnosis and Treatment","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Nanotechnology in Diagnosis and Treatment","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12974/2311-8792.2022.08.03","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Kinases are phosphate catalysing enzymes that have traditionally proved difficult to target against ligands,and hence inefficacious in drug development. There are two colluding reasons for this. First is the issue of specificity. The homogeneity that exists between the kinase ATP-binding pockets makes it a non-realisable target to developcompounds that would inhibit only one out of 538 protein kinases encoded by the human genome, without inhibitingsome of the others. Second, producing compounds with the required efficacy to rival the millimolar ATP concentrations present in cells is stoichiometrically inefficient. This study uses a recently propounded computational strategy based onStructure Based Virtual Screening (SBVS) that was previously benchmarked on 999 DUD-E protein decoys(Chattopadhyay et al, Int Sc. Comp. Life Sciences 2022), to rank potential ligands, or by extension rank kinase-ligand pairs, identifying best matching ligand:kinase docking pairs. The results of the SBVS campaign employing severalcomputational algorithms reveal variations in the preferred top hits. To address this, we introduce a novel consensusscoring algorithm by sampling statistics across four independent statistical universality classes, statistically combining docking scores from ten docking programs (DOCK, Quick Vina-W, Vina Carb, PLANTS, Autodock, QuickVina2,QuickVina21, Smina, Autodock Vina and VinaXB) to create a holistic SBVS formulation that can identify active ligandsfor any target. Our results demonstrate that CS provides improved ligand:kinase docking fidelity when compared to individual docking platforms, requiring only a small number of docking combinations, and can serve as a viable andthrifty alternative to expensive docking platforms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于激酶的药物虚拟筛选:对药物重新定位的统计学习
激酶是一种磷酸盐催化酶,传统上证明难以靶向配体,因此在药物开发中无效。造成这种情况的原因有两个。首先是特异性问题。激酶atp结合口袋之间存在的同质性使得开发仅抑制人类基因组编码的538种蛋白激酶中的一种而不抑制其他一些蛋白激酶的化合物成为不可能实现的目标。其次,从化学计量的角度来看,生产具有与细胞中存在的毫摩尔ATP浓度相匹配的所需功效的化合物是低效的。本研究使用最近提出的基于结构的虚拟筛选(SBVS)的计算策略,该策略先前以999个ddu - e蛋白诱饵(Chattopadhyay等人,Int Sc. Comp. Life Sciences 2022)为基准,对潜在配体进行排名,或通过扩展对激酶配体对进行排名,确定最佳匹配配体:激酶对接对。使用几种计算算法的SBVS活动的结果揭示了首选热门的变化。为了解决这个问题,我们引入了一种新的共识评分算法,通过对四个独立的统计普遍性类进行抽样统计,统计结合10个对接程序(DOCK, QuickVina - w, Vina Carb, PLANTS, Autodock, QuickVina2,QuickVina21, Smina, Autodock Vina和VinaXB)的对接得分,创建一个整体的SBVS配方,可以识别任何目标的活性配体。我们的研究结果表明,与单个对接平台相比,CS提供了更好的配体激酶对接保真度,只需要少量的对接组合,并且可以作为昂贵的对接平台的可行且节省的替代方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Mechanical Characterization Study of Additive as Nanofiller in Poly (ε-Caprolactone) Nanocomposite Synthesis of Silver Nanoparticles Using Novel Chemical Solution Method as Antibacterial Applied on Cosmetic Cotton Balls Virtual Screening of Kinase Based Drugs: Statistical Learning Towards Drug Repositioning Investigation of Damage Properties of Woven Carbon-Epoxy Composites Modified with CNT Fillers Towards Phenotyping Suppressed Anger in Perimenopausal Women with Lyfas Biomedical Application: A Comprehensive Diagnostic Reliability Study
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1