Profile
Graph Transformation
Graph Transformation (also graph rewriting) is a rewriting system on graphs. Unsurprisingly, graph transformation constitutes a universal model of computation and has numerous applications in software engineering. Formally, graph transformation is an algebraic method, based on category theory. Nonetheless, graph transformation applications are often very intuitive, owning largely to the visual nature of graphs.
Within my work, the focus was on application of graph transformation to chemistry. "Drawing" molecules as graphs is very intuitive, and graphs have been a visual tool of chemists since the mid-19th century. Graph transformation rules then capture the chemical reactions, transforming the input molecules into output molecules. More precisely, each graph transformation rule specifies a class of reactions that perform the same chemical transformation, characterised by the graph pattern being rewritten. A graph transformation rule thus models a physico-chemical mechanism of a class of chemical reactions.
My focus has specifically been enzymatic reactions in biochemistry. Enzymatic reactions are specific in that the performed transformations are often very indirect and can be thought of as proceeding through a sequence of elementary reaction steps with a net energetically favourable effect. I worked on a technique to exploit the knowledge of such elementary steps, or enzymatic mechanisms, for some enzymatic reactions, to extrapolate and propose detailed mechanisms for other reactions as well [2021].
The individual steps of the enzymatic mechanisms often "undo" the effects of the previous ones, achieving the desired bond rearrangement by shifting charges between electron donor and acceptor groups of the molecules involved. Such transient changes to the molecular structure are invisible at the level of the overall enzymatic reaction. I have therefore worked to develop a fully formal method for classification of enzymatic reactions, and a clear visualisation of any transient transformations, which delimit crucial components of the molecules that allow the reaction to proceed [2022].
Last but not least, while staying true to the motivation in chemical application, I have worked on a method to automatically extract a set of graph transformation rules from empirical data, such as chemical reaction networks. The method is very general and can likely be adapted to other rewriting systems without much modification. It also ties directly into computing fundamentals via the notion of Kolmogorov complexity [TBD].
Boolean Networks
Boolean networks are a discrete dynamical model of interacting entities. Boolean networks consist of a finite set of variables and pairwise directed interactions between them, often signed (positive, negative). All variables of a Boolean network can only take on one of two values, 1 or 0, often read "active" or "inactive". The updates to variable updates are described in the realm of Boolean algebra, where the name of the model derives from.
While mechanistically simple, the interplay of various combinations of active and inactive interactions, as given by active and inactive variables, gives Boolean networks the ability to capture a wide range of dynamics, including but not limited to, multi-stationarity and multi-stability, long-range correlation and oscillation.
My work with Boolean networks has been largely centered around network inference by means of a formal verfication of an ensemble of plausible models [2019a], and model reduction on top of such ensembles [2019b]. I have also contributed to the development of most permissive semantics of Boolean networks [2020a]. Finally, my interest lies in understanding the expressivity of Boolean networks with respect to other dynamical models, especially Petri nets [2020b;2025].
My current focus are novel application areas for Boolean networks, and tackling the challenges that arise within. Life science application beyond gene regulation and cell signalling are of particular interest, both because of numerous interaction-driven complex systems, and due to the ability to benefit from the top-down abstraction potential of Boolean networks, as the systems are generally not fully understood.
Bielefeld University
Bielefeld, Germany
|
Sep 2024 – now
|
Postdoc
|
University of Southern Denmark
Odense, Denmark
|
Sep 2022 – August 2024
|
|
Harvard Medical School
Boston, MA, USA
|
Feb 2022 – August 2022
|
|
University of Southern Denmark
Odense, Denmark
|
Nov 2021 – Jan 2022
|
|
University of Vienna
Vienna, Austria
|
Aug 2021 – Oct 2021
|
|
University of Southern Denmark
Odense, Denmark
|
Sep 2020 – Jul 2021
|
|
ENS Paris-Saclay
Paris, France
|
Feb 2019 – Aug 2020
|
PhD Student
|
National Institute of Informatics
Tokyo, Japan
|
Aug 2018 – Jan 2019
|
|
ENS Paris-Saclay
Paris, France
|
Mar 2017 – Jul 2018
|
|
|
Feb 2016 – Jul 2016
|
Master Student
|
|
Masaryk University
Brno, Czech Republic
|
Feb 2015 – Feb 2016
|
|
Aalborg University
Aalborg, Denmark
|
Sep 2014 – Jan 2015
ERASMUS student exchange
|
|
Masaryk University
Brno, Czech Republic
|
Sep 2013 – Aug 2014
|
|
|
Sep 2010 – Jun 2013
|
Undergraduate Student
|