Multi-enzyme pathway optimisation through star-shaped reachable sets

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This article studies the time evolution of multi-enzyme pathways. The non-linearity of the problem coupled with the infinite dimensionality of the time-dependent input usually results in a rather laborious optimization. Here we discuss how the optimization of the input enzyme concentrations might be efficiently reduced to a calculation of reachable sets. Under some general conditions, the original system has star-shaped reachable sets that can be derived by solving a partial differential equation. This method allows a thorough study and optimization of quite sophisticated enzymatic pathways with non-linear dynamics and possible inhibition. Moreover, optimal control synthesis based on reachable sets can be implemented and was tested on several simulated examples.

Cite

CITATION STYLE

APA

Mazurenko, S., Damborsky, J., & Prokop, Z. (2017). Multi-enzyme pathway optimisation through star-shaped reachable sets. In Advances in Intelligent Systems and Computing (Vol. 616, pp. 9–17). Springer Verlag. https://doi.org/10.1007/978-3-319-60816-7_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free