A computational approach to steady state correspondence of regular and generalized mass action systems

From MaRDI portal
Publication:891844

DOI10.1007/S11538-015-0077-5zbMATH Open1327.80016arXiv1407.4796OpenAlexW2962826425WikidataQ50927848 ScholiaQ50927848MaRDI QIDQ891844FDOQ891844


Authors: Matthew D. Johnston Edit this on Wikidata


Publication date: 17 November 2015

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

Abstract: It has been recently observed that the dynamical properties of mass action systems arising from many models of biochemical reaction networks can be derived by considering the corresponding properties of a related generalized mass action system. The correspondence process known as network translation in particular has been shown to be useful in characterizing a system's steady states. In this paper, we further develop the theory of network translation with particular focus on a subclass of translations known as improper translations. For these translations, we derive conditions on the network topology of the translated network which are sufficient to guarantee the original and translated systems share the same steady states. We then present a mixed-integer linear programming (MILP) algorithm capable of determining whether a mass action system can be corresponded to a generalized system through the process of network translation.


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




Recommendations




Cites Work


Cited In (12)





This page was built for publication: A computational approach to steady state correspondence of regular and generalized mass action systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891844)