five

Enumeration Approach to Atom-to-Atom Mapping Accelerated by Ising Computing

收藏
Figshare2025-02-02 更新2026-04-28 收录
下载链接:
https://figshare.com/articles/dataset/Enumeration_Approach_to_Atom-to-Atom_Mapping_Accelerated_by_Ising_Computing/28327335
下载链接
链接失效反馈
官方服务:
资源简介:
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.
创建时间:
2025-02-02
5,000+
优质数据集
54 个
任务类型
进入经典数据集
二维码
社区交流群

面向社区/商业的数据集话题

二维码
科研交流群

面向高校/科研机构的开源数据集话题

数据驱动未来

携手共赢发展

商业合作