Disconnection Rules are Complete for Chemical Reactions
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916420704534528 |
|---|---|
| author | Gale, Ella Lobski, Leo Zanasi, Fabio |
| author_facet | Gale, Ella Lobski, Leo Zanasi, Fabio |
| contents | We provide a category theoretical framework capturing two approaches to graph-based models of chemistry: formal reactions and disconnection rules. We model a translation from the latter to the former as a functor, which is faithful, and full up to isomorphism. This allows us to state, as our main result, that the disconnection rules are sound, complete and universal with respect to the reactions. Concretely, this means that every reaction can be decomposed into a sequence of disconnection rules in an essentially unique way. This provides a uniform way to store reaction data, and gives an algorithmic interface between (forward) reaction prediction and (backward) reaction search or retrosynthesis. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_01421 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Disconnection Rules are Complete for Chemical Reactions Gale, Ella Lobski, Leo Zanasi, Fabio Logic in Computer Science Category Theory 05C92 F.4.1; J.2 We provide a category theoretical framework capturing two approaches to graph-based models of chemistry: formal reactions and disconnection rules. We model a translation from the latter to the former as a functor, which is faithful, and full up to isomorphism. This allows us to state, as our main result, that the disconnection rules are sound, complete and universal with respect to the reactions. Concretely, this means that every reaction can be decomposed into a sequence of disconnection rules in an essentially unique way. This provides a uniform way to store reaction data, and gives an algorithmic interface between (forward) reaction prediction and (backward) reaction search or retrosynthesis. |
| title | Disconnection Rules are Complete for Chemical Reactions |
| topic | Logic in Computer Science Category Theory 05C92 F.4.1; J.2 |
| url | https://arxiv.org/abs/2410.01421 |