Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner Systems
H Rahkooy, T Sturm - International Workshop on Computer Algebra in …, 2021 - Springer
H Rahkooy, T Sturm
International Workshop on Computer Algebra in Scientific Computing, 2021•SpringerWe 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 …
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 …
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 n-site phosphorylations and biomodels from the Biomodels repository using the grobcov library of the computer algebra system Singular.
Springer
Showing the best result for this search. See all results