### Abstract

In this paper, a frequently used representation of mass-action type reaction networks is extended to a more general system class where the reaction rates are in rational function form. An algorithm is given to compute a possible reaction graph from the kinetic differential equations. However, this structure is generally non-unique, as it is illustrated through the phenomenon of dynamical equivalence, when different reaction network structures correspond to exactly the same dynamics. It is shown that under some technical assumptions, the so-called dense realization containing the maximal number of reactions, forms a super-structure in the sense that the reaction graph of any dynamically equivalent reaction network is the sub-graph of the dense realization. Additionally, optimization based methods are given to find dynamically equivalent realizations with preferred properties, such as dense realizations or sparse realizations. The introduced concepts are illustrated by examples.

Original language | English |
---|---|

Pages (from-to) | 1657-1686 |

Number of pages | 30 |

Journal | Journal of Mathematical Chemistry |

Volume | 53 |

Issue number | 8 |

DOIs | |

Publication status | Published - Sep 13 2015 |

### Fingerprint

### Keywords

- Biochemical reaction graph
- Dynamic equivalence
- Dynamic models
- Parameter-free model analysis

### ASJC Scopus subject areas

- Chemistry(all)
- Applied Mathematics

### Cite this

*Journal of Mathematical Chemistry*,

*53*(8), 1657-1686. https://doi.org/10.1007/s10910-015-0511-9