Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner Systems
Abstract
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öbner systems. Considering rate constants as parameters, we compute comprehensive Gröbner systems for various reactions. In particular, we make automatic computations on nsite phosphorylations and biomodels from the Biomodels repository using the grobcov library of the computer algebra system Singular.
 Publication:

arXiv eprints
 Pub Date:
 July 2021
 arXiv:
 arXiv:2107.01706
 Bibcode:
 2021arXiv210701706R
 Keywords:

 Quantitative Biology  Molecular Networks;
 Computer Science  Symbolic Computation