EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

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

Mohammad Ali iD, Yuta Mizuno iD, Seiji Akiyama iD, Yuuya Nagata iD, Tamiki Komatsuzaki iD

Journal of Chemical Information and Modeling · 24.02.2025 · 65 (4) · 1901-1910

DOI: 10.1021/acs.jcim.4c01871 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Chemical Information and Modeling, online erschienen am 02.02.2025. Verfasst von Mohammad Ali und 4 weiteren Autor:innen. Beteiligte Einrichtung: Graduate School of Chemical Sciences and Engineering, Hokkaido University, Kita 13, Nishi 8, Kita-ku, Sapporo 060-8628, Hokkaido, Japan. Hauptthemen laut MEDLINE: Algorithms, Cheminformatics. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 60 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Precursory Research for Embryonic Science and Technology, Japan Society for the Promotion of Science, Support for Pioneering Research Initiated by the Next Generation.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsCheminformatics

Autor:innen und Institutionen

  • Graduate School of Chemical Sciences and Engineering, Hokkaido University, Kita 13, Nishi 8, Kita-ku, Sapporo 060-8628, Hokkaido, Japan.
  • Statistics Discipline, Khulna University, Sher-E-Bangla Road, Khulna 9208, Bangladesh.
  • Research Institute for Electronic Science, Hokkaido University, Kita 20, Nishi 10, Kita-ku, Sapporo 001-0020, Hokkaido, Japan.
  • Institute for Chemical Reaction Design and Discovery, Hokkaido University, Kita 21, Nishi 10, Kita-ku, Sapporo 001-0021, Hokkaido, Japan.
  • ERATO Maeda Artificial Intelligence for Chemical Reaction Design and Discovery Project, Hokkaido University, Kita 21, Nishi 10, Kita-ku, Sapporo 001-0021, Hokkaido, Japan.
  • SANKEN, Osaka University, 8-1 Mihogaoka, Osaka 567-0047, Ibaraki, Japan.

ORCID-Profile: Mohammad Ali, Yuta Mizuno, Seiji Akiyama, Yuuya Nagata, Tamiki Komatsuzaki

Förderung

  • Precursory Research for Embryonic Science and Technology
  • Japan Society for the Promotion of Science
  • Support for Pioneering Research Initiated by the Next Generation

Zitieren

APA

Ali, M., Mizuno, Y., Akiyama, S., Nagata, Y., & Komatsuzaki, T. (2025). Enumeration Approach to Atom-to-Atom Mapping Accelerated by Ising Computing. Journal of Chemical Information and Modeling, 65(4), 1901-1910. https://doi.org/10.1021/acs.jcim.4c01871

Vancouver

Ali M, Mizuno Y, Akiyama S, Nagata Y, Komatsuzaki T. Enumeration Approach to Atom-to-Atom Mapping Accelerated by Ising Computing. Journal of Chemical Information and Modeling. 2025;65(4):1901-1910. doi:10.1021/acs.jcim.4c01871

BibTeX
@article{Ali2025,
  author = {Ali, Mohammad and Mizuno, Yuta and Akiyama, Seiji and Nagata, Yuuya and Komatsuzaki, Tamiki},
  title = {Enumeration Approach to Atom-to-Atom Mapping Accelerated by Ising Computing},
  journal = {Journal of Chemical Information and Modeling},
  year = {2025},
  volume = {65},
  number = {4},
  pages = {1901--1910},
  doi = {10.1021/acs.jcim.4c01871}
}
Kostenlos starten →