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

János Rudan, G. Szederkényi, K. Hangos, Tamás Péni

Research output: Contribution to journalArticle

3 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 - 2014

Fingerprint

Chemical Reaction Networks
Polynomial-time Algorithm
Chemical reactions
Polynomials
Polynomial-time Complexity
Biochemical Networks
Reaction Network
Boundedness of Solutions
Stability of Equilibria
Reversibility
Equilibrium Point
Structural Properties
Linear programming
Structural properties
Existence and Uniqueness
Linearly
Kinetics

Keywords

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

ASJC Scopus subject areas

  • Chemistry(all)
  • Applied Mathematics

Cite this

Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks. / Rudan, János; Szederkényi, G.; Hangos, K.; Péni, Tamás.

In: Journal of Mathematical Chemistry, Vol. 52, No. 5, 2014, p. 1386-1404.

Research output: Contribution to journalArticle

@article{caab0f535d6640abb58ebce55dd9a4fa,
title = "Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks",
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.",
keywords = "Chemical reaction networks, Dynamical equivalence, Linear conjugacy, Optimization, Weak reversibility",
author = "J{\'a}nos Rudan and G. Szederk{\'e}nyi and K. Hangos and Tam{\'a}s P{\'e}ni",
year = "2014",
doi = "10.1007/s10910-014-0318-0",
language = "English",
volume = "52",
pages = "1386--1404",
journal = "Journal of Mathematical Chemistry",
issn = "0259-9791",
publisher = "Springer Netherlands",
number = "5",

}

TY - JOUR

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

AU - Rudan, János

AU - Szederkényi, G.

AU - Hangos, K.

AU - Péni, Tamás

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - Chemical reaction networks

KW - Dynamical equivalence

KW - Linear conjugacy

KW - Optimization

KW - Weak reversibility

UR - http://www.scopus.com/inward/record.url?scp=84897429614&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84897429614&partnerID=8YFLogxK

U2 - 10.1007/s10910-014-0318-0

DO - 10.1007/s10910-014-0318-0

M3 - Article

VL - 52

SP - 1386

EP - 1404

JO - Journal of Mathematical Chemistry

JF - Journal of Mathematical Chemistry

SN - 0259-9791

IS - 5

ER -