Computing sparse and dense realizations of reaction kinetic systems
From MaRDI portal
Publication:848181
DOI10.1007/s10910-009-9525-5zbMath1198.92052OpenAlexW2016440384MaRDI QIDQ848181
Publication date: 2 March 2010
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-009-9525-5
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Classical flows, reactions, etc. in chemistry (92E20)
Related Items
A linear programming approach to dynamical equivalence, linear conjugacy, and the deficiency one theorem, Linear conjugacy in biochemical reaction networks with rational reaction rates, Realizations of quasi-polynomial systems and application for stability analysis, Computing all possible graph structures describing linearly conjugate realizations of kinetic systems, A computational approach to steady state correspondence of regular and generalized mass action systems, Computing zero deficiency realizations of kinetic systems, An Algorithm for Finding Weakly Reversible Deficiency Zero Realizations of Polynomial Dynamical Systems, A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks, Parametric uniqueness of deficiency zero reaction networks, On classes of reaction networks and their associated polynomial dynamical systems, A computational approach to persistence, permanence, and endotacticity of biochemical reaction systems, Complex Balancing Reconstructed to the Asymptotic Stability of Mass-Action Chemical Reaction Networks with Conservation Laws, A computational approach to linear conjugacy in a class of power law kinetic systems, Quadratic first integrals of kinetic differential equations, Linear conjugacy of chemical reaction networks, An inverse problem in reaction kinetics, Engineering model reduction and entropy-based Lyapunov functions in chemical reaction kinetics, Reaction network realizations of rational biochemical systems and their structural properties, Conditions for extinction events in chemical reaction networks with discrete state spaces, A computational approach to extinction events in chemical reaction networks with discrete state spaces, Finding complex balanced and detailed balanced realizations of chemical reaction networks, Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks, Realizations of kinetic differential equations, Analysis of mass-action systems by split network translation, Reachability analysis of low-order discrete state reaction networks obeying conservation laws, A computational approach to the structural analysis of uncertain kinetic systems, COMPUTING ALL SPARSE KINETIC STRUCTURES FOR A LORENZ SYSTEM USING OPTIMIZATION
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modeling and integer programming techniques applied to propositional calculus
- Local dissipative Hamiltonian description of reversible reaction networks
- Identifiability of chemical reaction networks
- Local controllability of reactions
- On local observability of chemical systems
- Control of systems integrating logic, dynamics, and constraints
- Alternative integer-linear-programming formulations of the Clar problem in hexagonal systems
- Structure and stability of certain chemical networks and applications to the kinetic proofreading model of T-cell receptor signal transduction
- Permuting Sparse Rectangular Matrices into Block-Diagonal Form
- Understanding bistability in complex enzyme-driven reaction networks
- Multiple Equilibria in Complex Chemical Reaction Networks: I. The Injectivity Property
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Multiple Equilibria in Complex Chemical Reaction Networks: II. The Species-Reaction Graph
