A Deep Retrieval-Enhanced Meta-Learning Framework for Enzyme Optimum pH Prediction.

IF 5.6 2区 化学 Q1 CHEMISTRY, MEDICINAL
Liang Zhang, Kuan Luo, Ziyi Zhou, Yuanxi Yu, Fan Jiang, Banghao Wu, Mingchen Li, Liang Hong
{"title":"A Deep Retrieval-Enhanced Meta-Learning Framework for Enzyme Optimum pH Prediction.","authors":"Liang Zhang, Kuan Luo, Ziyi Zhou, Yuanxi Yu, Fan Jiang, Banghao Wu, Mingchen Li, Liang Hong","doi":"10.1021/acs.jcim.4c02291","DOIUrl":null,"url":null,"abstract":"<p><p>The potential of hydrogen (pH) influences the function of the enzyme. Measuring or predicting the optimal pH (pH<sub>opt</sub>) at which enzymes exhibit maximal catalytic activity is crucial for enzyme design and application. The rapid development of enzyme mining and de novo design has produced a large number of new enzymes, making it impractical to measure their pHopt in the wet laboratory. Consequently, in-silico computational approaches such as machine learning and deep learning models, which offer pH prediction at minimal cost, have attracted considerable interest. This work presents Venus-DREAM, an enzyme pH<sub>opt</sub> prediction model based on the <i>k</i>NN algorithm and few-shot learning, which achieves state-of-the-art accuracy in pHopt prediction. Venus-DREAM regards the pH<sub>opt</sub> prediction of an enzyme as a few-shot learning task: learning from the <i>k</i>-closest labeled enzymes to predict the pH<sub>opt</sub> of the target enzyme. The value of <i>k</i> is determined by the optimal <i>k</i>-value of the <i>k</i>NN regression algorithm. And the distance between two enzymes is defined as the cosine similarity of their mean-pooled embeddings obtained from protein language models (PLMs). The few-shot learner is based on the Reptile algorithm, which first adapts to the <i>k</i>-nearest labeled enzymes to create a specialized model for the target enzyme and then predicts its pH<sub>opt</sub>. This efficient method enables high-throughput virtual exploration of protein space, facilitating the identification of sequences with the desired pH<sub>opt</sub> ranges in a high-throughput manner. Moreover, our method can be easily adapted in other protein function prediction tasks.</p>","PeriodicalId":44,"journal":{"name":"Journal of Chemical Information and Modeling ","volume":" ","pages":""},"PeriodicalIF":5.6000,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Chemical Information and Modeling ","FirstCategoryId":"92","ListUrlMain":"https://doi.org/10.1021/acs.jcim.4c02291","RegionNum":2,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MEDICINAL","Score":null,"Total":0}
引用次数: 0

Abstract

The potential of hydrogen (pH) influences the function of the enzyme. Measuring or predicting the optimal pH (pHopt) at which enzymes exhibit maximal catalytic activity is crucial for enzyme design and application. The rapid development of enzyme mining and de novo design has produced a large number of new enzymes, making it impractical to measure their pHopt in the wet laboratory. Consequently, in-silico computational approaches such as machine learning and deep learning models, which offer pH prediction at minimal cost, have attracted considerable interest. This work presents Venus-DREAM, an enzyme pHopt prediction model based on the kNN algorithm and few-shot learning, which achieves state-of-the-art accuracy in pHopt prediction. Venus-DREAM regards the pHopt prediction of an enzyme as a few-shot learning task: learning from the k-closest labeled enzymes to predict the pHopt of the target enzyme. The value of k is determined by the optimal k-value of the kNN regression algorithm. And the distance between two enzymes is defined as the cosine similarity of their mean-pooled embeddings obtained from protein language models (PLMs). The few-shot learner is based on the Reptile algorithm, which first adapts to the k-nearest labeled enzymes to create a specialized model for the target enzyme and then predicts its pHopt. This efficient method enables high-throughput virtual exploration of protein space, facilitating the identification of sequences with the desired pHopt ranges in a high-throughput manner. Moreover, our method can be easily adapted in other protein function prediction tasks.

求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
9.80
自引率
10.70%
发文量
529
审稿时长
1.4 months
期刊介绍: The Journal of Chemical Information and Modeling publishes papers reporting new methodology and/or important applications in the fields of chemical informatics and molecular modeling. Specific topics include the representation and computer-based searching of chemical databases, molecular modeling, computer-aided molecular design of new materials, catalysts, or ligands, development of new computational methods or efficient algorithms for chemical software, and biopharmaceutical chemistry including analyses of biological activity and other issues related to drug discovery. Astute chemists, computer scientists, and information specialists look to this monthly’s insightful research studies, programming innovations, and software reviews to keep current with advances in this integral, multidisciplinary field. As a subscriber you’ll stay abreast of database search systems, use of graph theory in chemical problems, substructure search systems, pattern recognition and clustering, analysis of chemical and physical data, molecular modeling, graphics and natural language interfaces, bibliometric and citation analysis, and synthesis design and reactions databases.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信