A computational approach to the structural analysis of uncertain kinetic systems
arXiv:1704.08633 · doi:10.1016/j.cpc.2018.03.002
Abstract
A computation-oriented representation of uncertain kinetic systems is introduced and analysed in this paper. It is assumed that the monomial coefficients of the ODEs belong to a polytopic set, which defines a set of dynamical systems for an uncertain model. An optimization-based computation model is proposed for the structural analysis of uncertain models. It is shown that the so-called dense realization containing the maximum number of reactions (directed edges) is computable in polynomial time, and it forms a super-structure among all the possible reaction graphs corresponding to an uncertain kinetic model, assuming a fixed set of complexes. The set of core reactions present in all reaction graphs of an uncertain model is also studied. Most importantly, an algorithm is proposed to compute all possible reaction graph structures for an uncertain kinetic model.
23 pages, 5 figures
References in corpus (4)
- Finding complex balanced and detailed balanced realizations of chemical reaction networks
- Toric Differential Inclusions and a Proof of the Global Attractor Conjecture
- Maximal and minimal realizations of reaction kinetic systems: computation and properties
- Computing all possible graph structures describing linearly conjugate realizations of kinetic systems