Maximal and minimal realizations of reaction kinetic systems: computation and properties

Abstract

This paper presents new results about the optimization based generation of chemical reaction networks (CRNs) of higher deficiency. Firstly, it is shown that the graph structure of the realization containing the maximal number of reactions is unique if the set of possible complexes is fixed. Secondly, a mixed integer programming based numerical procedure is given for computing a realization containing the minimal/maximal number of complexes. Moreover, the linear inequalities corresponding to full reversibility of the CRN realization are also described. The theoretical results are illustrated on meaningful examples.

23 pages, 4 figures

References in corpus (1)

• Invariant grids for reaction kinetics

Cited by in corpus (5)

• Finding complex balanced and detailed balanced realizations of chemical reaction networks
• Computing all possible graph structures describing linearly conjugate realizations of kinetic systems
• Finding weakly reversible realizations of chemical reaction networks using optimization
• A computational approach to the structural analysis of uncertain kinetic systems
• Realizations of kinetic differential equations