过渡状态下的机器学习搜索复杂生物分子

None Yang Jian-Yu, None Xi Kun, None Zhu Li-Zhe
{"title":"过渡状态下的机器学习搜索复杂生物分子","authors":"None Yang Jian-Yu, None Xi Kun, None Zhu Li-Zhe","doi":"10.7498/aps.72.20231319","DOIUrl":null,"url":null,"abstract":"Transition state is the key concept for chemists to understand and fine-tune the conformational changes of large biomolecules. Due to its short residence time, it is difficult to capture a transition state via experimental techniques. Characterizing transition states for a conformational change therefore is only achievable via physics-driven molecular dynamics simulations. However, unlike chemical reactions which involve only a small number of atoms, conformational changes of biomolecules depend on numerous atoms and therefore their coordinates in our 3D space. The searching of transition states for them will inevitably encounter the curse of dimensionality, i.e. the reaction coordinate problem, which invoked the invention of various algorithms for solution. Recent years have witnessed a rapid emergence of new machine learning techniques and the incorporation of some of them into the transition state searching methods. Here, we first review the design principle of representative transition state searching algorithms, including the collective-variable(CV)-dependent Gentlest Ascent Dynamics (GAD), Finite Temperature String, Fast Tomographic, Travelling-salesman based Automated Path Searching (TAPS) and the CV-independent Transition Path Sampling (TPS). Then, we focus on the new version of TPS that incorporates reinforcement learning for efficient sampling and clarify the suitable situation for its application. Finally, we propose a new paradigm for transition state searching-invent new dimensionality reduction techniques that preserve transition state information and combine them with GAD.","PeriodicalId":10252,"journal":{"name":"Chinese Physics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Machine Learning in Transition State Searching for Complex Biomolecules\",\"authors\":\"None Yang Jian-Yu, None Xi Kun, None Zhu Li-Zhe\",\"doi\":\"10.7498/aps.72.20231319\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Transition state is the key concept for chemists to understand and fine-tune the conformational changes of large biomolecules. Due to its short residence time, it is difficult to capture a transition state via experimental techniques. Characterizing transition states for a conformational change therefore is only achievable via physics-driven molecular dynamics simulations. However, unlike chemical reactions which involve only a small number of atoms, conformational changes of biomolecules depend on numerous atoms and therefore their coordinates in our 3D space. The searching of transition states for them will inevitably encounter the curse of dimensionality, i.e. the reaction coordinate problem, which invoked the invention of various algorithms for solution. Recent years have witnessed a rapid emergence of new machine learning techniques and the incorporation of some of them into the transition state searching methods. Here, we first review the design principle of representative transition state searching algorithms, including the collective-variable(CV)-dependent Gentlest Ascent Dynamics (GAD), Finite Temperature String, Fast Tomographic, Travelling-salesman based Automated Path Searching (TAPS) and the CV-independent Transition Path Sampling (TPS). Then, we focus on the new version of TPS that incorporates reinforcement learning for efficient sampling and clarify the suitable situation for its application. Finally, we propose a new paradigm for transition state searching-invent new dimensionality reduction techniques that preserve transition state information and combine them with GAD.\",\"PeriodicalId\":10252,\"journal\":{\"name\":\"Chinese Physics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Chinese Physics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.7498/aps.72.20231319\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chinese Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7498/aps.72.20231319","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

过渡态是化学家理解和调整生物大分子构象变化的关键概念。由于其停留时间短,很难通过实验技术捕获过渡态。因此,表征构象变化的过渡态只能通过物理驱动的分子动力学模拟来实现。然而,与只涉及少量原子的化学反应不同,生物分子的构象变化依赖于大量原子,因此它们在我们的三维空间中的坐标。在寻找它们的过渡态时,不可避免地会遇到维数的诅咒,即反应坐标问题,这就需要发明各种算法来求解。近年来,新的机器学习技术迅速出现,并将其中一些技术纳入过渡状态搜索方法。在这里,我们首先回顾了代表性的过渡状态搜索算法的设计原则,包括集体变量(CV)依赖的最缓上升动力学(GAD),有限温度串,快速断层扫描,基于旅行推销员的自动路径搜索(TAPS)和CV无关的过渡路径采样(TPS)。然后,我们重点研究了新版本的TPS,该TPS结合了强化学习以实现高效采样,并阐明了其应用的合适情况。最后,我们提出了一种新的过渡状态搜索范式——发明新的降维技术,保留过渡状态信息并将其与GAD相结合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Machine Learning in Transition State Searching for Complex Biomolecules
Transition state is the key concept for chemists to understand and fine-tune the conformational changes of large biomolecules. Due to its short residence time, it is difficult to capture a transition state via experimental techniques. Characterizing transition states for a conformational change therefore is only achievable via physics-driven molecular dynamics simulations. However, unlike chemical reactions which involve only a small number of atoms, conformational changes of biomolecules depend on numerous atoms and therefore their coordinates in our 3D space. The searching of transition states for them will inevitably encounter the curse of dimensionality, i.e. the reaction coordinate problem, which invoked the invention of various algorithms for solution. Recent years have witnessed a rapid emergence of new machine learning techniques and the incorporation of some of them into the transition state searching methods. Here, we first review the design principle of representative transition state searching algorithms, including the collective-variable(CV)-dependent Gentlest Ascent Dynamics (GAD), Finite Temperature String, Fast Tomographic, Travelling-salesman based Automated Path Searching (TAPS) and the CV-independent Transition Path Sampling (TPS). Then, we focus on the new version of TPS that incorporates reinforcement learning for efficient sampling and clarify the suitable situation for its application. Finally, we propose a new paradigm for transition state searching-invent new dimensionality reduction techniques that preserve transition state information and combine them with GAD.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信