Graph transformation systems have the potential to be realistic models of chemistry, provided a comprehensive collection of reaction rules can be extracted from the body of chemical knowledge. A first key step for rule learning is the computation of atom-atom mappings, i.e., the atom-wise correspondence between products and educts of all published chemical reactions. This can be phrased as a maximum common edge subgraph problem with the constraint that transition states must have cyclic structure. We describe a search tree method well suited for small edit distance and an integer linear program best suited for general instances and demonstrate that it is feasible to compute atom-atom maps at large scales using a manually curated database of biochemical reactions as an example. In this context we address the network completion problem.
CITATION STYLE
Flamm, C., Merkle, D., Stadler, P. F., & Thorsen, U. (2016). Automatic inference of graph transformation rules using the cyclic nature of chemical reactions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9761, pp. 206–222). Springer Verlag. https://doi.org/10.1007/978-3-319-40530-8_13
Mendeley helps you to discover research relevant for your work.