Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks

Rudán, János and Szederkényi, Gábor and Hangos, Katalin and Péni, Tamás (2014) Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks. JOURNAL OF MATHEMATICAL CHEMISTRY, 52 (5). pp. 1386-1404. ISSN 0259-9791 10.1007/s10910-014-0318-0

[img]
Preview
Text
Rudan_1386_2538157_ny.pdf

Download (460kB) | Preview

Abstract

Weak reversibility is a crucial structural property of chemical reaction networks (CRNs) with mass action kinetics, because it has major implications related to the existence, uniqueness and stability of equilibrium points and to the boundedness of solutions. In this paper, we present two new algorithms to find dynamically equivalent weakly reversible realizations of a given CRN. They are based on linear programming and thus have polynomial time-complexity. Hence, these algorithms can deal with large-scale biochemical reaction networks, too. Furthermore, one of the methods is able to deal with linearly conjugate networks, too. © 2014 Springer International Publishing Switzerland.

Item Type: Article
Uncontrolled Keywords: Weak reversibility; Optimization; Linear conjugacy; Dynamical equivalence; Chemical reaction networks
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Systems and Control Lab
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 22 Sep 2014 07:48
Last Modified: 16 Feb 2016 19:44
URI: http://eprints.sztaki.hu/id/eprint/7971

Update Item Update Item