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

János Rudan, Gábor Szederkényi, Katalin M. Hangos, Tamás Péni

Research output: Contribution to journalArticle

5 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)1386-1404
Number of pages19
JournalJournal of Mathematical Chemistry
Volume52
Issue number5
DOIs
Publication statusPublished - May 2014

    Fingerprint

Keywords

  • Chemical reaction networks
  • Dynamical equivalence
  • Linear conjugacy
  • Optimization
  • Weak reversibility

ASJC Scopus subject areas

  • Chemistry(all)
  • Applied Mathematics

Cite this