A new efficient algorithm for determining all structurally different realizations of kinetic systems

Bernadett Ács, G. Szederkényi, Dávid Csercsik

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this paper we present a novel algorithm for computing all possible reaction graph structures representing linearly conjugate realizations of a polynomial kinetic system assuming a fixed set of complexes. The computation is based on the repeated application of linear programming steps. The correctness of the method is formally proved. The approach is compared to the only solution known from the literature using two examples, and it is shown that the number of optimization steps and the overall execution time are significantly lower in the case of the proposed new method.

Original languageEnglish
Pages (from-to)299-320
Number of pages22
JournalMatch
Volume77
Issue number2
Publication statusPublished - Jan 1 2017

ASJC Scopus subject areas

  • Chemistry(all)
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A new efficient algorithm for determining all structurally different realizations of kinetic systems'. Together they form a unique fingerprint.

  • Cite this