Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks

DOI10.1007/s10910-014-0318-0zbMath1311.92223OpenAlexW2012543710MaRDI QIDQ2014813

Tamás Péni, Katalin Mária Hangos, János Rudan, Gábor Szederkényi

Publication date: 16 June 2014

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: http://eprints.sztaki.hu/7971/

zbMATH Keywords

optimizationchemical reaction networksdynamical equivalencelinear conjugacyweak reversibility

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Classical flows, reactions, etc. in chemistry (92E20)

Related Items (8)

A linear programming approach to dynamical equivalence, linear conjugacy, and the deficiency one theorem ⋮ An Algorithm for Finding Weakly Reversible Deficiency Zero Realizations of Polynomial Dynamical Systems ⋮ Source-Only Realizations, Weakly Reversible Deficiency One Networks, and Dynamical Equivalence ⋮ A computational approach to extinction events in chemical reaction networks with discrete state spaces ⋮ An Efficient Characterization of Complex-Balanced, Detailed-Balanced, and Weakly Reversible Systems ⋮ Realizations of kinetic differential equations ⋮ Uniqueness of weakly reversible and deficiency zero realizations of dynamical systems ⋮ Single-target networks

Uses Software

• GLPK
• YALMIP
• CLP
• CRNreals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks
• Finding complex balanced and detailed balanced realizations of chemical reaction networks
• Linear conjugacy of chemical reaction networks
• Boundedness of trajectories for weakly reversible, single linkage class reaction systems
• Computing sparse and dense realizations of reaction kinetic systems
• 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.
• Computing weakly reversible linearly conjugate chemical reaction networks with minimal defi\-ciency
• On the existence of the positive steady states of weakly reversible deficiency-one mass action systems
• Dynamical Equivalence and Linear Conjugacy of Chemical Reaction Networks: New Results and Methods
• COMPUTING ALL SPARSE KINETIC STRUCTURES FOR A LORENZ SYSTEM USING OPTIMIZATION
• Augmentation Problems
• Modeling and analysis of mass-action kinetics
• Sparse nonnegative solution of underdetermined linear equations by linear programming

This page was built for publication: Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks