Testing binomiality of chemical reaction networks using comprehensive Gröbner systems
From MaRDI portal
Publication:831995
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"obner systems. Considering rate constants as parameters, we compute comprehensive Gr"obner 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.
Recommendations
- On the complexity of reconstructing chemical reaction networks
- Fast enumeration of non-isomorphic chemical reaction networks
- Deterministic function computation with chemical reaction networks
- Deterministic Function Computation with Chemical Reaction Networks
- Composable Computation in Discrete Chemical Reaction Networks
- Composable computation in discrete chemical reaction networks
- A compositional framework for reaction networks
- Verifying chemical reaction network implementations: a pathway decomposition approach
- Verifying chemical reaction network implementations: a bisimulation approach
- Verifying chemical reaction network implementations: a bisimulation approach
Cites work
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- A linear algebra approach for detecting binomiality of steady state ideals of reversible chemical reaction networks
- A new algorithm for discussing Gröbner bases with parameters.
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- An alternative approach to comprehensive Gröbner bases
- An efficient method for computing comprehensive Gröbner bases
- Binomial ideals
- Canonical comprehensive Gröbner bases
- Chemical reaction systems with toric steady states
- Complexity of deciding Tarski algebra
- Complexity of solving systems with few independent monomials and applications to mass-action kinetics
- Comprehensive Gröbner bases
- Comprehensive Gröbner bases and regular rings
- Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm
- Detecting binomiality
- Efficiently and effectively recognizing toricity of steady state varieties
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Erratum to ``A new algorithm for discussing Gröbner bases with parameters [J. Symbolic Comput. 33 (1-2) (2002) 183-208]
- First-order tests for toricity
- Foundations of chemical reaction network theory
- Generalized mass action law and thermodynamics of nonlinear Markov processes
- Gröbner systems conversion
- Introduction to Toric Varieties. (AM-131)
- Multistationarity in structured reaction networks
- On the number of steady states in a multiple futile cycle
- Parametric FGLM algorithm
- Real quantifier elimination is doubly exponential
- Symbolic versus numerical computation and visualization of parameter regions for multistationarity of biological networks
- The Gröbner cover
- The complexity of linear problems in fields
- The complexity of the word problems for commutative semigroups and polynomial ideals
- The multistationarity structure of networks with intermediates and a binomial core network
- The structure of MESSI biological systems
- Three Waves of Chemical Dynamics
- Toric dynamical systems
Cited in
(5)- Efficiently and effectively recognizing toricity of steady state varieties
- Mixed volumes of networks with binomial steady-states
- Gröbner bases of reaction networks with intermediate species
- Detecting binomiality
- Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs
This page was built for publication: Testing binomiality of chemical reaction networks using comprehensive Gröbner systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831995)
