Experiment-Guided Refinement of Milestoning Network.

IF 5.5 1区 化学 Q2 CHEMISTRY, PHYSICAL Journal of Chemical Theory and Computation Pub Date : 2025-02-11 Epub Date: 2025-01-23 DOI:10.1021/acs.jctc.4c01436
Xiaojun Ji, Hao Wang, Wenjian Liu
{"title":"Experiment-Guided Refinement of Milestoning Network.","authors":"Xiaojun Ji, Hao Wang, Wenjian Liu","doi":"10.1021/acs.jctc.4c01436","DOIUrl":null,"url":null,"abstract":"<p><p>Milestoning is an efficient method for calculating rare event kinetics by constructing a continuous-time kinetic network that connects the reactant and product states. Its accuracy depends on both the quality of the underlying force fields and the trajectory sampling. The sampling error can be effectively controlled through various methods. However, the force fields are often not accurate enough, leading to quantitative discrepancies between simulations and experimental data. To address this challenge, we present a refinement approach for Milestoning network based on the maximum caliber (MaxCal), a general variational principle for dynamical systems, to combine simulations and experimental data. The Kullback-Leibler divergence rate between two Milestoning networks is analytically evaluated and minimized as the loss function. Meanwhile, experimental thermodynamic (equilibrium constants) and kinetic (rate constants) data are incorporated as constraints. The use of MaxCal implies that the refined kinetic network is minimally perturbed from the original one while satisfying the experimental constraints. The refined network is expected to align better with available experimental data. The refinement approach is demonstrated using the binding and unbinding dynamics of a series of six small molecule ligands for the model host system, β-cyclodextrin.</p>","PeriodicalId":45,"journal":{"name":"Journal of Chemical Theory and Computation","volume":" ","pages":"1078-1088"},"PeriodicalIF":5.5000,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Chemical Theory and Computation","FirstCategoryId":"92","ListUrlMain":"https://doi.org/10.1021/acs.jctc.4c01436","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/23 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"CHEMISTRY, PHYSICAL","Score":null,"Total":0}
引用次数: 0

Abstract

Milestoning is an efficient method for calculating rare event kinetics by constructing a continuous-time kinetic network that connects the reactant and product states. Its accuracy depends on both the quality of the underlying force fields and the trajectory sampling. The sampling error can be effectively controlled through various methods. However, the force fields are often not accurate enough, leading to quantitative discrepancies between simulations and experimental data. To address this challenge, we present a refinement approach for Milestoning network based on the maximum caliber (MaxCal), a general variational principle for dynamical systems, to combine simulations and experimental data. The Kullback-Leibler divergence rate between two Milestoning networks is analytically evaluated and minimized as the loss function. Meanwhile, experimental thermodynamic (equilibrium constants) and kinetic (rate constants) data are incorporated as constraints. The use of MaxCal implies that the refined kinetic network is minimally perturbed from the original one while satisfying the experimental constraints. The refined network is expected to align better with available experimental data. The refinement approach is demonstrated using the binding and unbinding dynamics of a series of six small molecule ligands for the model host system, β-cyclodextrin.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
里程碑网络的实验指导改进。
里程碑是一种计算稀有事件动力学的有效方法,它通过构建连接反应物和生成物状态的连续时间动力学网络来计算稀有事件动力学。其精度取决于底层力场的质量和轨迹采样。通过各种方法可以有效地控制采样误差。然而,力场往往不够精确,导致模拟和实验数据之间的定量差异。为了解决这一挑战,我们提出了一种基于最大口径(MaxCal)的里程碑网络的改进方法,MaxCal是动力系统的一般变分原理,将模拟和实验数据结合起来。分析了两个里程碑网络之间的Kullback-Leibler散度率,并将其作为损失函数最小化。同时,实验热力学(平衡常数)和动力学(速率常数)数据作为约束。MaxCal的使用表明,在满足实验约束的情况下,改进后的动力学网络与原始网络的扰动最小。改进后的网络有望更好地与现有的实验数据保持一致。利用模型宿主系统β-环糊精的一系列6个小分子配体的结合和解结合动力学证明了改进方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Chemical Theory and Computation
Journal of Chemical Theory and Computation 化学-物理:原子、分子和化学物理
CiteScore
9.90
自引率
16.40%
发文量
568
审稿时长
1 months
期刊介绍: The Journal of Chemical Theory and Computation invites new and original contributions with the understanding that, if accepted, they will not be published elsewhere. Papers reporting new theories, methodology, and/or important applications in quantum electronic structure, molecular dynamics, and statistical mechanics are appropriate for submission to this Journal. Specific topics include advances in or applications of ab initio quantum mechanics, density functional theory, design and properties of new materials, surface science, Monte Carlo simulations, solvation models, QM/MM calculations, biomolecular structure prediction, and molecular dynamics in the broadest sense including gas-phase dynamics, ab initio dynamics, biomolecular dynamics, and protein folding. The Journal does not consider papers that are straightforward applications of known methods including DFT and molecular dynamics. The Journal favors submissions that include advances in theory or methodology with applications to compelling problems.
期刊最新文献
Study of Arbitrarily Low Shear Rate Rheology Using Dissipative Particle Dynamics Scalable Distributed Memory Implementation of the Quasi-Adiabatic Propagator Path Integral The Interplay of Pauli Repulsion, Electrostatics, and Field Inhomogeneity for Blueshifting and Redshifting Vibrational Probe Molecules. StochasticGW-GPU: Rapid Quasi-Particle Energies for Molecules beyond 10,000 Atoms. Second-Order Perturbative Treatment of Spin-Orbit Coupling and Ground-State Electron Correlation.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1