Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner System

  title={Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gr{\"o}bner System},
  author={Hamid Rahkooy and Thomas Sturm},
. We consider the problem of binomiality of the steady state ideals of biochemical reaction networks. We are interested in finding polynomial conditions on the parameters such that the steady state ideal of a chemical reaction network is binomial under every specialisation of the parameters if the conditions on the parameters hold. We approach the binomiality problem using Comprehensive Gr¨obner systems. Considering rate constants as parameters, we compute comprehensive Gr¨obner systems for… 



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

Using a modified version of species-reaction graphs, an algorithm based on graph theory is presented which performs by adding and deleting edges and changing the labels of the edges in order to test unconditional binomiality.

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

An efficient algorithm for detecting unconditional binomiality is proposed that uses exclusively elementary column and row operations on the coefficient matrix and is proved to prove asymptotic worst case upper bounds on the time complexity of the algorithm.

Chemical Reaction Systems with Toric Steady States

The main result gives sufficient conditions for a chemical reaction system to have toric steady states, and the capacity of such a system to exhibit positive steady states and multistationarity is analyzed.

The Multistationarity Structure of Networks with Intermediates and a Binomial Core Network

A new determinant criterion to decide whether a network is multistationary is provided, which applies when the network obtained by removing intermediates has a binomial steady-state ideal.

The Structure of MESSI Biological Systems

A general framework for biological systems that describe Modifications of type Enzyme-Substrate or Swap with Intermediates, called MESSI systems, is introduced, and general results based on the network structure are proved.

Multistationarity in Structured Reaction Networks

This work builds on work of Conradi, Feliu, Mincheva, and Wiuf, who showed that for certain reaction networks whose steady states admit a positive parametrization, multistationarity is characterized by whether a certain “critical function” changes sign, and allows for more general parametic changes, which make it much easier to determine the existence of a sign change.

Detecting binomiality

On the number of steady states in a multiple futile cycle

The number of positive steady states of a general multisite phosphorylation–dephosphorylation cycle is studied, and it is shown that for some parameter ranges, there are at least n + 1 or n (if n is even) and there never are more than 2n − 1 steady states.

Complexity of Solving Systems with Few Independent Monomials and Applications to Mass-Action Kinetics

We design an algorithm for finding solutions with nonzero coordinates of systems of polynomial equations which has a better complexity bound than for known algorithms when a system contains a few

Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks

We investigate models of the mitogenactivated protein kinases (MAPK) network, with the aim of determining where in parameter space there exist multiple positive steady states. We build on recent