Normalizing Chemical Reaction Networks by Confluent Structural Simplification
- 681 Downloads
Reaction networks can be simplified by eliminating linear intermediate species in partial steady states. In this paper, we study the question whether this rewrite procedure is confluent, so that for any given reaction network, a unique normal form will be obtained independently of the elimination order. We first contribute a counter example which shows that different normal forms of the same network may indeed have different structures. The problem is that different “dependent reactions” may be introduced in different elimination orders. We then propose a rewrite rule that eliminates such dependent reactions and prove that the extended rewrite system is confluent up to kinetic rates, i.e., all normal forms of the same network will have the same structure. However, their kinetic rates may still not be unique, even modulo the usual axioms of arithmetics. This might seem surprising given that the ODEs of these normal forms are equal modulo these axioms.
KeywordsReaction Network Extended Rewrite System Ordinary Differential Equations (ODEs) Linear Intermediates Unique Normal Form
- 12.Madelaine, G., Lhoussaine, C., Niehren, J.: Attractor equivalence: an observational semantics for reaction networks. In: Fages, F., Piazza, C. (eds.) FMMB 2014. LNCS, vol. 8738, pp. 82–101. Springer, Heidelberg (2014)Google Scholar
- 18.Radulescu, O., Gorban, A.N., Zinovyev, A., Noel, V.: Reduction of dynamical biochemical reactions networks in computational biology. Frontiers in Genetics (2012)Google Scholar
- 19.Sáez, M., Wiuf, C., Feliu, E.: Graphical reduction of reaction networks by linear elimination of species. arXiv preprint 2015. arXiv:1509.03153
- 21.Tonello, E., Owen, M.R., Farcot, E.: On the elimination of intermediate species in chemical reaction networks (2016, in preparation)Google Scholar