Computing linearly conjugate weakly reversible kinetic structures using optimization and graph theory
From MaRDI portal
Recommendations
- Computing all possible graph structures describing linearly conjugate realizations of kinetic systems
- A new efficient algorithm for determining all structurally different realizations of kinetic systems
- A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks
- Computing weakly reversible linearly conjugate chemical reaction networks with minimal defi\-ciency
- Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks
Cited in
(9)- A new efficient algorithm for determining all structurally different realizations of kinetic systems
- Optimal Reaction Coordinates: Variational Characterization and Sparse Computation
- Computing the Minimal Rebinding Effect Included in a Given Kinetics
- Realizations of kinetic differential equations
- A computational approach to the structural analysis of uncertain kinetic systems
- A linear programming approach to dynamical equivalence, linear conjugacy, and the deficiency one theorem
- Linear conjugacy in biochemical reaction networks with rational reaction rates
- A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks
- Computing all possible graph structures describing linearly conjugate realizations of kinetic systems
This page was built for publication: Computing linearly conjugate weakly reversible kinetic structures using optimization and graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5279158)
