High Throughput Mutational Scanning of a Protein via Alchemistry on a High-Performance Computing Resource

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Concurrency and Computation-Practice & Experience Pub Date : 2025-01-16 DOI:10.1002/cpe.8371
Tandac F. Guclu, Busra Tayhan, Ebru Cetin, Ali Rana Atilgan, Canan Atilgan
{"title":"High Throughput Mutational Scanning of a Protein via Alchemistry on a High-Performance Computing Resource","authors":"Tandac F. Guclu,&nbsp;Busra Tayhan,&nbsp;Ebru Cetin,&nbsp;Ali Rana Atilgan,&nbsp;Canan Atilgan","doi":"10.1002/cpe.8371","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Antibiotic resistance presents a significant challenge to public health, as bacteria can develop resistance to antibiotics through random mutations during their life cycles, making the drugs ineffective. Understanding how these mutations contribute to drug resistance at the molecular level is crucial for designing new treatment approaches. Recent advancements in molecular biology tools have made it possible to conduct comprehensive analyses of protein mutations. Computational methods for assessing molecular fitness, such as binding energies, are not as precise as experimental techniques like deep mutational scanning. Although full atomistic alchemical free energy calculations offer the necessary precision, they are seldom used to assess high throughput data as they require significantly more computational resources. We generated a computational library using deep mutational scanning for dihydrofolate reductase (DHFR), a protein commonly studied in antibiotic resistance research. Due to resource limitations, we analyzed 33 out of 159 positions, identifying 16 single amino acid replacements. Calculations were conducted for DHFR in its drug-free state and in the presence of two different inhibitors. We demonstrate the feasibility of such calculations, made possible due to the enhancements in computational resources and their optimized use.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 3","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8371","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Antibiotic resistance presents a significant challenge to public health, as bacteria can develop resistance to antibiotics through random mutations during their life cycles, making the drugs ineffective. Understanding how these mutations contribute to drug resistance at the molecular level is crucial for designing new treatment approaches. Recent advancements in molecular biology tools have made it possible to conduct comprehensive analyses of protein mutations. Computational methods for assessing molecular fitness, such as binding energies, are not as precise as experimental techniques like deep mutational scanning. Although full atomistic alchemical free energy calculations offer the necessary precision, they are seldom used to assess high throughput data as they require significantly more computational resources. We generated a computational library using deep mutational scanning for dihydrofolate reductase (DHFR), a protein commonly studied in antibiotic resistance research. Due to resource limitations, we analyzed 33 out of 159 positions, identifying 16 single amino acid replacements. Calculations were conducted for DHFR in its drug-free state and in the presence of two different inhibitors. We demonstrate the feasibility of such calculations, made possible due to the enhancements in computational resources and their optimized use.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
期刊最新文献
A Dynamic Energy-Efficient Scheduling Method for Periodic Workflows Based on Collaboration of Edge-Cloud Computing Resources An Innovative Performance Assessment Method for Increasing the Efficiency of AODV Routing Protocol in VANETs Through Colored Timed Petri Nets YOLOv8-ESW: An Improved Oncomelania hupensis Detection Model Three Party Post Quantum Secure Lattice Based Construction of Authenticated Key Establishment Protocol for Mobile Communication Unstructured Text Data Security Attribute Mining Method Based on Multi-Model Collaboration
×
引用
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