New interface

# Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner Systems

3 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
4 MOSEL - Proof-oriented development of computer-based systems
LORIA - FM - Department of Formal Methods
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.
Keywords :
Document type :
Conference papers
Domain :

https://hal.archives-ouvertes.fr/hal-03438171
Contributor : Thomas Sturm Connect in order to contact the contributor
Submitted on : Sunday, November 21, 2021 - 7:50:06 AM
Last modification on : Friday, February 18, 2022 - 6:58:02 AM

### File

2107.01706.pdf
Files produced by the author(s)

### Citation

Hamid Rahkooy, Thomas Sturm. Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner Systems. CASC 2021 - Computer Algebra in Scientific Computing, Sep 2021, Sochi, Russia. pp.334-352, ⟨10.1007/978-3-030-85165-1_19⟩. ⟨hal-03438171⟩

Record views