Computing weakly reversible linearly conjugate chemical reaction networks with minimal deficiency |
| |
Authors: | Matthew D. Johnston David Siegel Gábor Szederkényi |
| |
Affiliation: | 1. Department of Mathematics, Division of Mathematical Statistics, Stockholm University, SE 106 91 Stockholm, Sweden;2. Department of Zoology, Division of Population Genetics, Stockholm University, SE 106 91 Stockholm, Sweden |
| |
Abstract: | Mass-action kinetics is frequently used in systems biology to model the behavior of interacting chemical species. Many important dynamical properties are known to hold for such systems if their underlying networks are weakly reversible and have a low deficiency. In particular, the Deficiency Zero and Deficiency One Theorems guarantee strong regularity with regards to the number and stability of positive equilibrium states. It is also known that chemical reaction networks with distinct reaction structure can admit mass-action systems with the same qualitative dynamics. The theory of linear conjugacy encapsulates the cases where this relationship is captured by a linear transformation. In this paper, we propose a mixed-integer linear programming algorithm capable of determining the minimal deficiency weakly reversible reaction network which admits a mass-action system which is linearly conjugate to a given reaction network. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|