Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks
From MaRDI portal
Publication:2014813
Recommendations
- Computing weakly reversible linearly conjugate chemical reaction networks with minimal defi\-ciency
- A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks
- On the complexity of reconstructing chemical reaction networks
- Polynomial time reachability analysis in discrete state chemical reaction networks obeying conservation laws
- Independent, incidence independent and weakly reversible decompositions of chemical reaction networks
- The computing power of determinism and reversibility in chemical reaction automata
- On the computational complexity of reaction systems, revisited
- Deterministic function computation with chemical reaction networks
- Deterministic Function Computation with Chemical Reaction Networks
- On design and analysis of chemical reaction network algorithms
Cites work
- scientific article; zbMATH DE number 44637 (Why is no real title available?)
- scientific article; zbMATH DE number 3795757 (Why is no real title available?)
- A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks
- Augmentation Problems
- Boundedness of trajectories for weakly reversible, single linkage class reaction systems
- Computing all sparse kinetic structures for a Lorenz system using optimization
- Computing sparse and dense realizations of reaction kinetic systems
- Computing weakly reversible linearly conjugate chemical reaction networks with minimal defi\-ciency
- Dynamical equivalence and linear conjugacy of chemical reaction networks: new results and methods
- Finding complex balanced and detailed balanced realizations of chemical reaction networks
- Linear conjugacy of chemical reaction networks
- Modeling and analysis of mass-action kinetics
- Nonnegative and compartmental dynamical systems
- On the existence of the positive steady states of weakly reversible deficiency-one mass action systems
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- The next wave in computing, optimization, and decision technologies. Papers from the ninth INFORMS Computing Society conference (ICS 2005), Annapolis, MD, USA, January 5--7, 2005.
Cited in
(14)- On the complexity of reconstructing chemical reaction networks
- Realizations of kinetic differential equations
- Weakly reversible single linkage class realizations of polynomial dynamical systems: an algorithmic perspective
- Computing linearly conjugate weakly reversible kinetic structures using optimization and graph theory
- 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
- A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks
- An efficient characterization of complex-balanced, detailed-balanced, and weakly reversible systems
- Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs
- An Algorithm for Finding Weakly Reversible Deficiency Zero Realizations of Polynomial Dynamical Systems
- Uniqueness of weakly reversible and deficiency zero realizations of dynamical systems
- Single-target networks
- A linear programming approach to dynamical equivalence, linear conjugacy, and the deficiency one theorem
- Source-Only Realizations, Weakly Reversible Deficiency One Networks, and Dynamical Equivalence
This page was built for publication: Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014813)
