In this paper an algorithm is given to determine all possible structurally different linearly conjugate realizations of a given kinetic polynomial system. The solution is based on the iterative search for constrained dense realizations using linear programming. Since there might exist exponentially many different reaction graph structures, we cannot expect to have a polynomial-time algorithm, but it can be shown that polynomial time is elapsed between displaying any two consecutive realizations. The correctness of the algorithm is proved, and the possibilities of parallel implementation are outlined . The operation of the method is shown on two illustrative examples.
In this paper an algorithm is given to determine all possible structurally different linearly conjugate realizations of a given kinetic polynomial system. The solution is based on the iterative search for constrained dense realizations using linear programming. Since there might exist exponentially many different reaction graph structures, we cannot expect to have a polynomial-time algorithm, but we URLanize the computation in such a way that polynomial time is elapsed between displaying any two consecutive realizations. The correctness of the algorithm is proved, and possibilities of a parallel implementation are discussed . The operation of the method is shown on two illustrative examples.
R
it can be shown
we URLanize the computation in such a way
R
the possibilities of
possibilities of a
R
outlined
discussed