Computing all possible graph structures describing linearly conjugate realizations of kinetic systems

DOI10.1016/j.cpc.2016.02.020zbMath1375.92081arXiv1509.06225OpenAlexW2276916781MaRDI QIDQ1682512

Zsolt Tuza, Bernadett Ács, Gábor Szederkényi, Zoltán A. Tuza

Publication date: 30 November 2017

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.06225

zbMATH Keywords

linear programminglinear conjugacyreaction networksreaction graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Classical flows, reactions, etc. in chemistry (92E20)

Related Items (5)

Polynomial Time Reachability Analysis in Discrete State Chemical Reaction Networks Obeying Conservation Laws ⋮ Persistence and stability of a class of kinetic compartmental models ⋮ Source-Only Realizations, Weakly Reversible Deficiency One Networks, and Dynamical Equivalence ⋮ Reachability analysis of low-order discrete state reaction networks obeying conservation laws ⋮ A computational approach to the structural analysis of uncertain kinetic systems

Uses Software

• Matlab
• YALMIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A tutorial on chemical reaction network dynamics
• Linear conjugacy of chemical reaction networks
• Toric dynamical systems
• Computing sparse and dense realizations of reaction kinetic systems
• Identifiability of chemical reaction networks
• Computing weakly reversible linearly conjugate chemical reaction networks with minimal defi\-ciency
• Quadratic first integrals of kinetic differential equations
• COMPUTING ALL SPARSE KINETIC STRUCTURES FOR A LORENZ SYSTEM USING OPTIMIZATION
• A Proof of the Global Attractor Conjecture in the Single Linkage Class Case
• Modeling and analysis of mass-action kinetics

This page was built for publication: Computing all possible graph structures describing linearly conjugate realizations of kinetic systems