Mathematics – Dynamical Systems
Scientific paper
2011-11-06
Mathematics
Dynamical Systems
29 pages, 1 figure
Scientific paper
In the first part of this paper, we propose new optimization-based methods for the computation of preferred (dense, sparse, reversible, detailed and complex balanced) linearly conjugate reaction network structures with mass action dynamics. The developed methods are extensions of previously published results on dynamically equivalent reaction networks and are based on mixed-integer linear programming. As related theoretical contributions we show that (i) dense linearly conjugate networks define a unique super-structure for any positive diagonal state transformation if the set of chemical complexes is given, and (ii) the existence of linearly conjugate detailed balanced and complex balanced networks do not depend on the selection of equilibrium points. In the second part of the paper it is shown that determining dynamically equivalent realizations to a network that is structurally fixed but parametrically not can also be written and solved as a mixed-integer linear programming problem. Several examples illustrate the presented computation methods.
Johnston Matthew D.
Siegel David
Szederkenyi Gabor
No associations
LandOfFree
Dynamical Equivalence and Linear Conjugacy of Chemical Reaction Networks: New Results and Methods does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Dynamical Equivalence and Linear Conjugacy of Chemical Reaction Networks: New Results and Methods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamical Equivalence and Linear Conjugacy of Chemical Reaction Networks: New Results and Methods will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-704904