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.
|Number of pages||22|
|Publication status||Published - Jan 1 2017|
ASJC Scopus subject areas
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics