Extension of partial atom-to-atom maps: uniqueness and algorithms
Open Access
- 19 June 2026
- journal article
- research article
- Published by Springer Nature in Algorithms for Molecular Biology
- Vol. 21 (1) , 10
Abstract
Chemical reaction databases typically report the molecular structures of reactant and product compounds, as well as their stoichiometry, but lack information, in particular, on the correspondence of reactant and product atoms. These atom-to-atom maps (AAM), however, are crucial for applications including chemical synthesis planning in organic chemistry and the analysis of isotope labeling experiments in modern metabolomics. AAMs therefore need to be reconstructed computationally. This situation is aggravated, furthermore, by the fact that chemically correct AAMs are, fundamentally, determined by quantum-mechanical phenomena and thus cannot be reliably computed by solving graph-theoretical optimization problems defined by the reactant and product structures. A viable solution for this problem is to shift the focus into first identifying a partial AAM containing the reaction center, i.e., covering the atoms incident with all bonds that change during a reaction. This then leads to the problem of extending the partial map to the full reaction. The AAM of a reaction is faithfully represented by the Imaginary Transition State (ITS) graph, providing a convenient graph-theoretic framework to address the questions of when and how a partial AAM can be extended. We show that an unique extension exists whenever, and only if, these partial AAMs cover the reaction center. Moreover, uniqueness results are generalized to partial AAMs in situations where hydrogen atoms are not represented explicitly. In this case their extension can be computed by solving a constrained graph-isomorphism search between specific subgraphs of ITS graphs. We close by benchmarking different tools for this task.Keywords
This publication has 33 references indexed in Scilit:
- SynTemp: Efficient Extraction of Graph-Based Reaction Rules from Large-Scale Reaction DatabasesJournal of Chemical Information and Modeling, 2025
- Atom‐to‐atom Mapping: A Benchmarking Study of Popular Mapping Algorithms and Consensus StrategiesMolecular Informatics, 2021
- Name Reactions2021
- VF2++—An improved subgraph isomorphism algorithmDiscrete Applied Mathematics, 2018
- A Software Package for Chemically Inspired Graph Transformation2016
- Maximum common subgraph isomorphism algorithms and their applications in molecular science: a reviewWIREs Computational Molecular Science, 2011
- Automatic recognition of reaction site in organic chemical reactionsTetrahedron Computer Methodology, 1988
- Isomorphism of graphs of bounded valence can be tested in polynomial timeJournal of Computer and System Sciences, 1982
- The Principle of Minimum Chemical Distance (PMCD)Angewandte Chemie International Edition, 1980
- The Principle of Least Nuclear Motion1977