由Ising计算加速的原子到原子映射的枚举方法

IF 5.3 2区 化学 Q1 CHEMISTRY, MEDICINAL
Mohammad Ali, Yuta Mizuno*, Seiji Akiyama*, Yuuya Nagata and Tamiki Komatsuzaki, 
{"title":"由Ising计算加速的原子到原子映射的枚举方法","authors":"Mohammad Ali,&nbsp;Yuta Mizuno*,&nbsp;Seiji Akiyama*,&nbsp;Yuuya Nagata and Tamiki Komatsuzaki,&nbsp;","doi":"10.1021/acs.jcim.4c0187110.1021/acs.jcim.4c01871","DOIUrl":null,"url":null,"abstract":"<p >Chemical reactions are regarded as transformations of chemical structures, and the question of which atoms in the reactants correspond to which atoms in the products has attracted chemists for a long time. Atom-to-atom mapping (AAM) is a procedure that establishes such correspondence(s) between the atoms of reactants and products in a chemical reaction. Currently, automatic AAM tools play a pivotal role in various chemoinformatics tasks. However, achieving accurate automatic AAM for complex or unknown reactions within a reasonable computation time remains a significant challenge due to the combinatorial nature of the problem and the difficulty in applying appropriate reaction rules. In this study, we propose a rule-free AAM algorithm, which enumerates all atom-to-atom correspondences that minimize the number of bond cleavages and formations during the reaction. To reduce the computational burden associated with the combinatorial optimization (i.e., minimizing bond changes), we introduce Ising computing, a computing paradigm that has gained significant attention for its efficiency in solving hard combinatorial optimization problems. We found that our Ising computing framework outperforms conventional combinatorial optimization algorithms in terms of computation times, making it feasible to solve the AAM problem without reaction rules in an acceptable time. Furthermore, our AAM algorithm successfully found the correct AAM solution for all problems in a benchmark data set. In contrast, conventional AAM algorithms based on chemical heuristics failed for several problems. Specifically, these algorithms either failed to find the optimal solution in terms of bond changes, or they identified only one optimal solution, which was incorrect when multiple optimal solutions exist. These results emphasize the importance of enumerating all optimal correspondences that minimize bond changes, which is effectively achieved by our Ising-computing framework.</p>","PeriodicalId":44,"journal":{"name":"Journal of Chemical Information and Modeling ","volume":"65 4","pages":"1901–1910 1901–1910"},"PeriodicalIF":5.3000,"publicationDate":"2025-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://pubs.acs.org/doi/epdf/10.1021/acs.jcim.4c01871","citationCount":"0","resultStr":"{\"title\":\"Enumeration Approach to Atom-to-Atom Mapping Accelerated by Ising Computing\",\"authors\":\"Mohammad Ali,&nbsp;Yuta Mizuno*,&nbsp;Seiji Akiyama*,&nbsp;Yuuya Nagata and Tamiki Komatsuzaki,&nbsp;\",\"doi\":\"10.1021/acs.jcim.4c0187110.1021/acs.jcim.4c01871\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p >Chemical reactions are regarded as transformations of chemical structures, and the question of which atoms in the reactants correspond to which atoms in the products has attracted chemists for a long time. Atom-to-atom mapping (AAM) is a procedure that establishes such correspondence(s) between the atoms of reactants and products in a chemical reaction. Currently, automatic AAM tools play a pivotal role in various chemoinformatics tasks. However, achieving accurate automatic AAM for complex or unknown reactions within a reasonable computation time remains a significant challenge due to the combinatorial nature of the problem and the difficulty in applying appropriate reaction rules. In this study, we propose a rule-free AAM algorithm, which enumerates all atom-to-atom correspondences that minimize the number of bond cleavages and formations during the reaction. To reduce the computational burden associated with the combinatorial optimization (i.e., minimizing bond changes), we introduce Ising computing, a computing paradigm that has gained significant attention for its efficiency in solving hard combinatorial optimization problems. We found that our Ising computing framework outperforms conventional combinatorial optimization algorithms in terms of computation times, making it feasible to solve the AAM problem without reaction rules in an acceptable time. Furthermore, our AAM algorithm successfully found the correct AAM solution for all problems in a benchmark data set. In contrast, conventional AAM algorithms based on chemical heuristics failed for several problems. Specifically, these algorithms either failed to find the optimal solution in terms of bond changes, or they identified only one optimal solution, which was incorrect when multiple optimal solutions exist. These results emphasize the importance of enumerating all optimal correspondences that minimize bond changes, which is effectively achieved by our Ising-computing framework.</p>\",\"PeriodicalId\":44,\"journal\":{\"name\":\"Journal of Chemical Information and Modeling \",\"volume\":\"65 4\",\"pages\":\"1901–1910 1901–1910\"},\"PeriodicalIF\":5.3000,\"publicationDate\":\"2025-02-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://pubs.acs.org/doi/epdf/10.1021/acs.jcim.4c01871\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Chemical Information and Modeling \",\"FirstCategoryId\":\"92\",\"ListUrlMain\":\"https://pubs.acs.org/doi/10.1021/acs.jcim.4c01871\",\"RegionNum\":2,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MEDICINAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Chemical Information and Modeling ","FirstCategoryId":"92","ListUrlMain":"https://pubs.acs.org/doi/10.1021/acs.jcim.4c01871","RegionNum":2,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MEDICINAL","Score":null,"Total":0}
引用次数: 0

摘要

化学反应被认为是化学结构的转化,而反应物中的哪些原子与产物中的哪些原子相对应的问题长期以来一直吸引着化学家。原子到原子映射(AAM)是一种在化学反应中建立反应物原子和产物原子之间的对应关系的过程。目前,自动AAM工具在各种化学信息学任务中发挥着关键作用。然而,由于问题的组合性质和应用适当的反应规则的困难,在合理的计算时间内实现复杂或未知反应的准确自动AAM仍然是一个重大挑战。在这项研究中,我们提出了一种无规则的AAM算法,该算法列举了所有原子间的对应关系,使反应过程中键断裂和形成的数量最小化。为了减少与组合优化(即最小化键变化)相关的计算负担,我们引入了伊辛计算,这是一种计算范式,因其在解决难组合优化问题方面的效率而受到广泛关注。我们发现我们的Ising计算框架在计算时间方面优于传统的组合优化算法,使得在可接受的时间内解决无反应规则的AAM问题成为可能。此外,我们的AAM算法成功地为基准数据集中的所有问题找到了正确的AAM解决方案。相比之下,传统的基于化学启发式的AAM算法在一些问题上失败了。具体来说,这些算法要么无法找到键变化的最优解,要么只能识别一个最优解,当存在多个最优解时,这是不正确的。这些结果强调了枚举所有使键变化最小化的最优对应的重要性,这是通过我们的ising计算框架有效实现的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Enumeration Approach to Atom-to-Atom Mapping Accelerated by Ising Computing

Chemical reactions are regarded as transformations of chemical structures, and the question of which atoms in the reactants correspond to which atoms in the products has attracted chemists for a long time. Atom-to-atom mapping (AAM) is a procedure that establishes such correspondence(s) between the atoms of reactants and products in a chemical reaction. Currently, automatic AAM tools play a pivotal role in various chemoinformatics tasks. However, achieving accurate automatic AAM for complex or unknown reactions within a reasonable computation time remains a significant challenge due to the combinatorial nature of the problem and the difficulty in applying appropriate reaction rules. In this study, we propose a rule-free AAM algorithm, which enumerates all atom-to-atom correspondences that minimize the number of bond cleavages and formations during the reaction. To reduce the computational burden associated with the combinatorial optimization (i.e., minimizing bond changes), we introduce Ising computing, a computing paradigm that has gained significant attention for its efficiency in solving hard combinatorial optimization problems. We found that our Ising computing framework outperforms conventional combinatorial optimization algorithms in terms of computation times, making it feasible to solve the AAM problem without reaction rules in an acceptable time. Furthermore, our AAM algorithm successfully found the correct AAM solution for all problems in a benchmark data set. In contrast, conventional AAM algorithms based on chemical heuristics failed for several problems. Specifically, these algorithms either failed to find the optimal solution in terms of bond changes, or they identified only one optimal solution, which was incorrect when multiple optimal solutions exist. These results emphasize the importance of enumerating all optimal correspondences that minimize bond changes, which is effectively achieved by our Ising-computing framework.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术文献互助群
群 号:604180095
Book学术官方微信