A Graph Theoretical Approach for Testing Binomiality of Reversible Chemical Reaction Networks

10/23/2020
by   Hamid Rahkooy, et al.
0

We study binomiality of the steady state ideals of chemical reaction networks. Considering rate constants as indeterminates, the concept of unconditional binomiality has been introduced and an algorithm based on linear algebra has been proposed in a recent work for reversible chemical reaction networks, which has a polynomial time complexity upper bound on the number of species and reactions. In this article, using a modified version of species–reaction graphs, we present an algorithm based on graph theory which performs by adding and deleting edges and changing the labels of the edges in order to test unconditional binomiality. We have implemented our graph theoretical algorithm as well as the linear algebra one in Maple and made experiments on biochemical models. Our experiments show that the performance of the graph theoretical approach is similar to or better than the linear algebra approach, while it is drastically faster than Groebner basis and quantifier elimination methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/28/2020

A Linear Algebra Approach for Detecting Binomiality of Steady State Ideals of Reversible Chemical Reaction Networks

Motivated by problems from Chemical Reaction Network Theory, we investig...
research
09/19/2023

Information geometric bound on general chemical reaction networks

We investigate the dynamics of chemical reaction networks (CRNs) with th...
research
03/21/2018

Groebner bases of reaction networks with intermediate species

In this work we consider the computation of Groebner bases of the steady...
research
07/07/2021

Defining Autocatalysis in Chemical Reaction Networks

Autocatalysis is a deceptively simple concept, referring to the situatio...
research
05/13/2021

Tracelet Hopf algebras and decomposition spaces

Tracelets are the intrinsic carriers of causal information in categorica...
research
09/24/2018

Graphical Requirements for Multistationarity in Reaction Networks and their Verification in BioModels

Thomas's necessary conditions for the existence of multiple steady state...
research
03/27/2023

Complexity of Reconfiguration in Surface Chemical Reaction Networks

We analyze the computational complexity of basic reconfiguration problem...

Please sign up or login with your details

Forgot password? Click here to reset