Testing Binomiality of Chemical Reaction Networks Using Comprehensive\n Gr "obner Systems

2021/07/04 by Hamid Rahkooy, Rahkooy, Hamid, Thomas Sturm +1 · 1 citation
Computer Science · Decision Sciences · #Embedded Systems Design Techniques #FOS: Biological sciences #FOS: Computer and information sciences #Formal Methods in Verification #Molecular Networks (q-bio.MN) #Simulation Techniques and Applications #Symbolic Computation (cs.SC)

paper · pdf · doi:10.48550/arxiv.2107.01706

openalex publication_date 2021/07/04 · openalex created_date 2022/07/25 · openalex updated_date 2026/07/28

Abstract

We consider the problem of binomiality of the steady state ideals of\nbiochemical reaction networks. We are interested in finding polynomial\nconditions on the parameters such that the steady state ideal of a chemical\nreaction network is binomial under every specialisation of the parameters if\nthe conditions on the parameters hold. We approach the binomiality problem\nusing Comprehensive Gr "obner systems. Considering rate constants as\nparameters, we compute comprehensive Gr "obner systems for various reactions.\nIn particular, we make automatic computations on n-site phosphorylations and\nbiomodels from the Biomodels repository using the grobcov library of the\ncomputer algebra system Singular.\n

Cited by

• Degeneracy of Two-Dimensional Zero-One Reaction Networks with Up to Three Species

Related

• A Graph Theoretical Approach for Testing Binomiality of Reversible Chemical Reaction Networks
• When algebra twinks system biology: a conjecture on the structure of Gröbner bases in complex chemical reaction networks
• Mixed volumes of networks with binomial steady-states
• When do two networks have the same steady-state ideal?
• Algebraic approaches for the decomposition of reaction networks and the determination of existence and number of steady states