Computing weakly reversible deficiency zero network translations using elementary flux modes
From MaRDI portal
Abstract: We present a computational method for performing structural translation, which has been studied recently in the context of analyzing the steady states and dynamical behavior of mass-action systems derived from biochemical reaction networks. Our procedure involves solving a binary linear programming problem where the decision variables correspond to interactions between the reactions of the original network. We call the resulting network a reaction-to-reaction graph and formalize how such a construction relates to the original reaction network and the structural translation. We demonstrate the efficacy and efficiency of the algorithm by running it on 508 networks from the European Bioinformatics Institutes' BioModels database. We also summarize how this work can be incorporated into recently proposed algorithms for establishing mono and multistationarity in biochemical reaction systems.
Recommendations
- A computational approach to steady state correspondence of regular and generalized mass action systems
- Computational Translation Framework Identifies Biochemical Reaction Networks with Special Topologies and Their Long-Term Dynamics
- Network translation and steady-state properties of chemical reaction systems
- Computing weakly reversible linearly conjugate chemical reaction networks with minimal defi\-ciency
- Translated chemical reaction networks
Cites work
- A Petri net approach to the study of persistence in chemical reaction networks
- A computational approach to steady state correspondence of regular and generalized mass action systems
- A global convergence result for processive multisite phosphorylation systems
- An introduction to systems biology. Design principles of biological circuits.
- Chemical reaction systems with toric steady states
- Generalized mass action systems: complex balancing equilibria and sign vectors of the stoichiometric and kinetic-order subspaces
- Generalized mass-action systems and positive solutions of polynomial equations with real and symbolic exponents (invited talk)
- How far is complex balancing from detailed balancing?
- Integer Programming with a Fixed Number of Variables
- Mathematical modeling in systems biology. An introduction
- Multiple steady states for chemical reaction networks of deficiency one
- Network translation and steady-state properties of chemical reaction systems
- Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry
- The existence and uniqueness of steady states for a class of chemical reaction networks
- The structure of MESSI biological systems
- Toric dynamical systems
- Translated chemical reaction networks
Cited in
(12)- Network translation and steady-state properties of chemical reaction systems
- On the bijectivity of families of exponential/generalized polynomial maps
- Network transformation-based analysis of biochemical systems
- Comparative analysis of kinetic realizations of insulin signaling
- A network-based parametrization of positive steady states of power-law kinetic systems
- Squeezing stationary distributions of stochastic chemical reaction systems
- Analysis of mass-action systems by split network translation
- A decomposition-based approach for deriving positive steady states of a class of chemical reaction networks with non-mass-action kinetics
- A computational approach to steady state correspondence of regular and generalized mass action systems
- Single-target networks
- Translated chemical reaction networks
- Computational Translation Framework Identifies Biochemical Reaction Networks with Special Topologies and Their Long-Term Dynamics
This page was built for publication: Computing weakly reversible deficiency zero network translations using elementary flux modes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2417529)
