{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T14:58:17Z","timestamp":1781881097800,"version":"3.54.5"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T00:00:00Z","timestamp":1781827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T00:00:00Z","timestamp":1781827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    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\n                    <jats:italic>atom-to-atom maps<\/jats:italic>\n                    (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\n                    <jats:italic>partial<\/jats:italic>\n                    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\n                    <jats:italic>Imaginary Transition State<\/jats:italic>\n                    (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.\n                  <\/jats:p>","DOI":"10.1186\/s13015-026-00300-5","type":"journal-article","created":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T13:57:16Z","timestamp":1781877436000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extension of partial atom-to-atom maps: uniqueness and algorithms"],"prefix":"10.1186","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-2307-595X","authenticated-orcid":false,"given":"Marcos E. Gonz\u00e1lez","family":"Laffitte","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3532-2064","authenticated-orcid":false,"given":"Tieu-Long","family":"Phan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5016-5191","authenticated-orcid":false,"given":"Peter F.","family":"Stadler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,19]]},"reference":[{"key":"300_CR1","doi-asserted-by":"publisher","unstructured":"Laffitte MEG, Phan T-L, F, SP. Extension of partial atom-to-atom maps: Uniqueness and algorithms. In: Brejov\u00e1 B, Patro R, editors. In 25th International Conference on Algorithms for Bioinformatics (WABI 2025). Leibniz International Proceedings in Informatics (LIPIcs), vol. 344, p. 12. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany. 2025. https:\/\/doi.org\/10.4230\/LIPIcs.WABI.2025.12.","DOI":"10.4230\/LIPIcs.WABI.2025.12"},{"issue":"12","key":"300_CR2","doi-asserted-by":"publisher","first-page":"2897","DOI":"10.1021\/ci900437n","volume":"49","author":"J Goodman","year":"2009","unstructured":"Goodman J. Computer software review: Reaxys. J Chem Inf Model. 2009;49(12):2897\u20138. https:\/\/doi.org\/10.1021\/ci900437n.","journal-title":"J Chem Inf Model"},{"key":"300_CR3","doi-asserted-by":"publisher","unstructured":"Lowe DM. Extraction of chemical structures and reactions from the literature. Technical report, Apollo\u2014University of Cambridge Repository. 2012. https:\/\/doi.org\/10.17863\/CAM.16293.","DOI":"10.17863\/CAM.16293"},{"key":"300_CR4","doi-asserted-by":"crossref","unstructured":"Laffitte MEG, Beier N, Domschke N, Stadler PF. Comparison of atom maps. MATCH Commun. Math. Comput. Chem. 2023;90:75\u2013102. https:\/\/doi.org\/10.46793\/match.90-1.075G.","DOI":"10.46793\/match.90-1.075G"},{"issue":"7","key":"300_CR5","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1002\/anie.198004953","volume":"19","author":"C Jochum","year":"1980","unstructured":"Jochum C, Gasteiger J, Ugi I. The principle of minimum chemical distance (PMCD). Ang Chem Intl Ed. 1980;19(7):495\u2013505. https:\/\/doi.org\/10.1002\/anie.198004953.","journal-title":"Ang Chem Intl Ed"},{"key":"300_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0065-3160(08)60117-3","volume":"15","author":"J Hine","year":"1977","unstructured":"Hine J. The principle of least nuclear motion. Adv Phys Org Chem. 1977;15:1\u201361. https:\/\/doi.org\/10.1016\/S0065-3160(08)60117-3.","journal-title":"Adv Phys Org Chem"},{"issue":"1","key":"300_CR7","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1002\/wcms.5","volume":"1","author":"H-C Ehrlich","year":"2011","unstructured":"Ehrlich H-C, Rarey M. Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review. Wiley Interdiscip Rev Comput Mol Sci. 2011;1(1):68\u201379.","journal-title":"Wiley Interdiscip Rev Comput Mol Sci"},{"issue":"4","key":"300_CR8","doi-asserted-by":"publisher","first-page":"2100138","DOI":"10.1002\/minf.202100138","volume":"41","author":"A Lin","year":"2022","unstructured":"Lin A, Dyubankova N, Madzhidov TI, Nugmanov RI, Verhoeven J, Gimadiev TR, et al. Atom-to-atom mapping: a benchmarking study of popular mapping algorithms and consensus strategies. Mol Inf. 2022;41(4):2100138.","journal-title":"Mol Inf"},{"key":"300_CR9","doi-asserted-by":"publisher","unstructured":"Li JJ. Name reactions: a collection of detailed reaction mechanisms and synthetic applications. Switzerland: Springer; 2021. https:\/\/doi.org\/10.1007\/978-3-030-50865-4.","DOI":"10.1007\/978-3-030-50865-4"},{"key":"300_CR10","doi-asserted-by":"publisher","unstructured":"Corradini A, Montanari U, Rossi F, Ehrig H, Heckel R, L\u00f6we M. Algebraic approaches to graph transformation, part i: Basic concepts and double pushout approach. In: Handbook Of Graph Grammars And Computing By Graph Transformation: Volume 1: Foundations, pp. 163\u2013245. World Scientific, World Scientific Publishing Co Pte Ltd; 1996. https:\/\/doi.org\/10.1142\/9789812384720_0003.","DOI":"10.1142\/9789812384720_0003"},{"key":"300_CR11","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1186\/1759-2208-4-4","volume":"4","author":"JL Andersen","year":"2013","unstructured":"Andersen JL, Flamm C, Merkle D, Stadler PF. Inferring chemical reaction patterns using graph grammar rule composition. J Syst Chem. 2013;4:4. https:\/\/doi.org\/10.1186\/1759-2208-4-4.","journal-title":"J Syst Chem"},{"key":"300_CR12","doi-asserted-by":"publisher","unstructured":"Andersen JL, Flamm C, Merkle D, Stadler PF. A software package for chemically inspired graph transformation. In: Echahed R, Minas M, editors. Graph Transformation, ICGT 2016. Lecture Notes Comp. Sci., vol. 9761, pp. 73\u201388. Berlin: Springer; 2016. https:\/\/doi.org\/10.1007\/978-3-319-40530-8_5.","DOI":"10.1007\/978-3-319-40530-8_5"},{"key":"300_CR13","doi-asserted-by":"publisher","first-page":"2250","DOI":"10.1038\/s41467-024-46364-y","volume":"15","author":"S Chen","year":"2024","unstructured":"Chen S, An S, Babazade R, Jung Y. Precise atom-to-atom mapping for organic reactions via human-in-the-loop machine learning. Nat Commun. 2024;15:2250. https:\/\/doi.org\/10.1038\/s41467-024-46364-y.","journal-title":"Nat Commun"},{"issue":"6","key":"300_CR14","doi-asserted-by":"publisher","first-page":"1549","DOI":"10.1021\/acs.jcim.4c01795","volume":"65","author":"T-L Phan","year":"2025","unstructured":"Phan T-L, Weinbauer K, Laffitte MEG, Pan Y, Merkle D, Andersen JL, et al. SynTemp: efficient extraction of graph-based reaction rules from large-scale reaction databases. J Chem Inf Model. 2025;65(6):1549\u20139596. https:\/\/doi.org\/10.1021\/acs.jcim.4c01795.","journal-title":"J Chem Inf Model"},{"key":"300_CR15","doi-asserted-by":"crossref","unstructured":"Beier N, Gatter T, Stadler PF. Computing double-pushout graph transformation rules and atom-to-atom maps from KEGG RCLASS data; 2025.","DOI":"10.21203\/rs.3.rs-6765982\/v1"},{"key":"300_CR16","doi-asserted-by":"publisher","DOI":"10.3390\/sym16091217","author":"MEG Laffitte","year":"2024","unstructured":"Laffitte MEG, Weinbauer K, Phan T-L, Beier N, Domschke N, Flamm C, et al. Partial imaginary transition state (ITS) graphs: A formal framework for research and analysis of atom-to-atom maps of unbalanced chemical reactions and their completions. MDPI Symmetry. 2024. https:\/\/doi.org\/10.3390\/sym16091217.","journal-title":"MDPI Symmetry"},{"key":"300_CR17","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1021\/ci00052a009","volume":"26","author":"S Fujita","year":"1986","unstructured":"Fujita S. Description of organic reactions based on imaginary transition structures. 1. Introduction of new concepts. J Chem Inf Comput Sci. 1986;26:205\u201312. https:\/\/doi.org\/10.1021\/ci00052a009.","journal-title":"J Chem Inf Comput Sci"},{"key":"300_CR18","doi-asserted-by":"publisher","unstructured":"Wilcox CS, Levinson RA. A self-organized knowledge base for recall, design, and discovery in organic chemistry. In: Pierce, TH, Hohne BA, editors. Artificial Intelligence Applications in Chemistry. Am. Chem. Soc. symposium series, vol. 306, pp. 209\u2013230. American Chemical Society, Washington, DC; 1986. Chap. 18. https:\/\/doi.org\/10.1021\/bk-1986-0306.ch018.","DOI":"10.1021\/bk-1986-0306.ch018"},{"key":"300_CR19","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1142\/S0218213011000140","volume":"20","author":"F Hoonakker","year":"2011","unstructured":"Hoonakker F, Lachiche N, Varnek A, Wagner A. A representation to apply usual data mining techniques to chemical reactions\u2014illustration on the rate constant of $$SN_2$$ reactions in water. Int J Artif Intell Tools. 2011;20:253\u201370. https:\/\/doi.org\/10.1142\/S0218213011000140.","journal-title":"Int J Artif Intell Tools"},{"issue":"3","key":"300_CR20","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1152\/physrev.1990.70.3.701","volume":"70","author":"AJ Meijer","year":"1990","unstructured":"Meijer AJ, Lamers WH, Chamuleau RAFM. Nitrogen metabolism and ornithine cycle function. Physiol Rev. 1990;70(3):701\u201348. https:\/\/doi.org\/10.1152\/physrev.1990.70.3.701. (PMID: 2194222).","journal-title":"Physiol Rev"},{"key":"300_CR21","doi-asserted-by":"crossref","unstructured":"Flamm C, M\u00fcller S, Stadler PF. Every atom-atom map for neutral molecules can be explained by electron pair pushing diagrams. Discr. Math. Chem. 2024. https:\/\/doi.org\/10.48550\/arXiv.2311.13492.","DOI":"10.26493\/2820-6657.8.d8b"},{"key":"300_CR22","volume-title":"Graph Theory","author":"F Harary","year":"2018","unstructured":"Harary F. Graph Theory. Florida: CRC Press; 2018."},{"issue":"5","key":"300_CR23","doi-asserted-by":"publisher","first-page":"396","DOI":"10.5059\/yukigoseikyokaishi.47.396","volume":"47","author":"S Fujita","year":"1989","unstructured":"Fujita S. Imaginary transition structures. A novel approach to computer oriented representation of organic reactions. J Synth Org Chem Jpn. 1989;47(5):396\u2013412. https:\/\/doi.org\/10.5059\/yukigoseikyokaishi.47.396.","journal-title":"J Synth Org Chem Jpn"},{"issue":"1","key":"300_CR24","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0898-5529(88)90008-5","volume":"1","author":"K Funatsu","year":"1988","unstructured":"Funatsu K, Endo T, Kotera N, Sasaki S-I. Automatic recognition of reaction site in organic chemical reactions. Tetrahedron Comput Methodol. 1988;1(1):53\u201369. https:\/\/doi.org\/10.1016\/0898-5529(88)90008-5.","journal-title":"Tetrahedron Comput Methodol"},{"key":"300_CR25","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1021\/ci60015a009","volume":"18","author":"MF Lynch","year":"1978","unstructured":"Lynch MF, Willett P. The automatic detection of chemical reaction sites. J Chem Inf Comput Sci. 1978;18:154\u20139. https:\/\/doi.org\/10.1021\/ci60015a009.","journal-title":"J Chem Inf Comput Sci"},{"issue":"5","key":"300_CR26","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1021\/ci970040v","volume":"37","author":"JB Hendrickson","year":"1997","unstructured":"Hendrickson JB. Comprehensive system for classification and nomenclature of organic reactions. J Chem Inf Comput Sci. 1997;37(5):852\u201360. https:\/\/doi.org\/10.1021\/ci970040v.","journal-title":"J Chem Inf Comput Sci"},{"key":"300_CR27","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"EM Luks","year":"1982","unstructured":"Luks EM. Isomorphism of graphs of bounded valence can be tested in polynomial time. J Comp Syst Sci. 1982;25:42\u201365. https:\/\/doi.org\/10.1016\/0022-0000(82)90009-5.","journal-title":"J Comp Syst Sci"},{"key":"300_CR28","doi-asserted-by":"publisher","DOI":"10.1137\/19M1245293","author":"M Grohe","year":"2023","unstructured":"Grohe M, Neuen D, Schweitzer P. A faster isomorphism test for graphs of small degree. SIAM J Comput. 2023. https:\/\/doi.org\/10.1137\/19M1245293.","journal-title":"SIAM J Comput"},{"key":"300_CR29","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M. A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans Pattern Anal Mach Intell. 2004;26:1367\u201372. https:\/\/doi.org\/10.1109\/TPAMI.2004.75.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"300_CR30","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.dam.2018.02.018","volume":"242","author":"A Alp\u00e1r J\u00fcttner","year":"2018","unstructured":"Alp\u00e1r J\u00fcttner A, Madarasi P. VF2++ - an improved subgraph isomorphism algorithm. Discr Appl Math. 2018;242:69\u201381. https:\/\/doi.org\/10.1016\/j.dam.2018.02.018.","journal-title":"Discr Appl Math"},{"key":"300_CR31","doi-asserted-by":"crossref","unstructured":"Hagberg AA, Schult DA, Swart PJ. Exploring network structure, dynamics, and function using NetworkX. In: Varoquaux G, Vaught T, Millman J, editors. Proceedings of the 7th Python in Science Conference, Pasadena, CA USA; 2008, pp. 11\u201315.","DOI":"10.25080\/TCWV9851"},{"issue":"2","key":"300_CR32","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/MCSE.2010.118","volume":"13","author":"S Behnel","year":"2011","unstructured":"Behnel S, Bradshaw R, Citro C, Dalcin L, Seljebotn DS, Smith K. Cython: the best of both worlds. Comput Sci Eng. 2011;13(2):31\u20139. https:\/\/doi.org\/10.1109\/MCSE.2010.118.","journal-title":"Comput Sci Eng"},{"key":"300_CR33","doi-asserted-by":"crossref","unstructured":"Linderoth JT, Ralphs TK. Noncommercial software for mixed-integer linear programming. In: Karlof J, editor. Integer Programming: Theory and Practice, pp. 253\u2013303. CRC Press, Technical Report 04T-023, Department of Industrial and Systems Engineering, Lehigh University; 2004.","DOI":"10.1201\/9781420039597.ch10"},{"key":"300_CR34","unstructured":"Laffitte MEG. GranMapache: GRAphs-and-Networks MAPping Applications with Cython and HEuristics). https:\/\/github.com\/MarcosLaffitte\/GranMapache."},{"key":"300_CR35","unstructured":"Documentation N. NetworkX 3.4.2: VF2 Algorithm. https:\/\/networkx.org\/documentation\/stable\/reference\/algorithms\/isomorphism.vf2.html."},{"issue":"12","key":"300_CR36","doi-asserted-by":"publisher","first-page":"2336","DOI":"10.1021\/acs.jcim.6b00564","volume":"56","author":"N Schneider","year":"2016","unstructured":"Schneider N, Stiefl N, Landrum GA. What\u2019s what: the (nearly) definitive guide to reaction role assignment. J Chem Inf Model. 2016;56(12):2336\u201346.","journal-title":"J Chem Inf Model"},{"issue":"1","key":"300_CR37","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1186\/s13321-024-00875-4","volume":"16","author":"T-L Phan","year":"2024","unstructured":"Phan T-L, Weinbauer K, G\u00e4rtner T, Merkle D, Andersen JL, Fagerberg R, et al. Reaction rebalancing: a novel approach to curating reaction databases. J Cheminform. 2024;16(1):82.","journal-title":"J Cheminform"},{"key":"300_CR38","doi-asserted-by":"publisher","unstructured":"Phan TL. TieuLongPhan\/PartialAAMs: Prepare release v.0.0.2. Zenodo; 2025. https:\/\/doi.org\/10.5281\/zenodo.17649865.","DOI":"10.5281\/zenodo.17649865"},{"key":"300_CR39","unstructured":"Foundation PS. Pickle package for serialization of Python objects; 2025. https:\/\/docs.python.org\/3\/library\/pickle.html. Accessed 22 June, 2025."}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13015-026-00300-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-026-00300-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-026-00300-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T14:19:24Z","timestamp":1781878764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s13015-026-00300-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,19]]},"references-count":39,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["300"],"URL":"https:\/\/doi.org\/10.1186\/s13015-026-00300-5","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,19]]},"assertion":[{"value":"29 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest \/ Conflict of interest"}},{"value":"Springer journals and proceedings:","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Editorial Policies for:"}},{"order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Nature Portfolio journals:"}},{"order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Italic' removed-->Scientific Reports:"}},{"order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"BMC journals:"}}],"article-number":"10"}}