DeepAI AI Chat
Log In Sign Up

Efficient Modular Graph Transformation Rule Application

by   Jakob L. Andersen, et al.

Graph transformation formalisms have proven to be suitable tools for the modelling of chemical reactions. They are well established in theoretical studies and increasingly also in practical applications in chemistry. The latter is made feasible via the development of programming frameworks which makes the formalisms executable. The application of such frameworks to large networks of chemical reactions, however, poses unique computational challenges. One such characteristic is the inherent combinatorial nature of the graphs involved. The graphs consist of many connected components, representing individual molecules. While the existing methods for implementing graph transformations can be applied to such graphs, the combinatorics of constructing graph matches quickly becomes a computational bottleneck as the size of the chemical reaction network grows. In this contribution, we develop a new method of enumerating graph transformation rule applications, designed to improve performance in these scenarios. The method is based on constructing graph matches component-wise, in an iterative fashion, allowing redundant applications to be detected early and pruned. We further extend the algorithm with an efficient heuristic, based on local symmetries of the graphs, which allow us to detect and discard isomorphic applications early. Finally, we conduct chemical network generation experiments on real-life as well as synthetic data and compare against state-of-the-art in the field.


Graph Transformation Policy Network for Chemical Reaction Prediction

We address a fundamental problem in chemistry known as chemical reaction...

A Graph-Based Tool to Embed the π-Calculus into a Computational DPO Framework

Graph transformation approaches have been successfully used to analyse a...

Graph Transformation for Enzymatic Mechanisms

Motivation: The design of enzymes is as challenging as it is consequenti...

Chemical Transformation Motifs - Modelling Pathways as Integer Hyperflows

We present an elaborate framework for formally modelling pathways in che...

AI-driven Hypernetwork of Organic Chemistry: Network Statistics and Applications in Reaction Classification

Rapid discovery of new reactions and molecules in recent years has been ...

A graph isomorphism invariant based on neighborhood aggregation

This paper presents a new graph isomorphism invariant, called 𝔴-labeling...

Representing catalytic mechanisms with rule composition

Reaction mechanisms are often presented as sequences of elementary steps...