Enzyme allocation problems in kinetic metabolic networks: optimal solutions are elementary flux modes

From MaRDI portal
Publication:2632634

DOI10.1016/J.JTBI.2013.11.015zbMATH Open1412.92124arXiv1308.0510OpenAlexW2048243530WikidataQ51137005 ScholiaQ51137005MaRDI QIDQ2632634FDOQ2632634


Authors: Stefan Müller, Georg Regensburger, Ralf Steuer Edit this on Wikidata


Publication date: 15 May 2019

Published in: Journal of Theoretical Biology (Search for Journal in Brave)

Abstract: The survival and proliferation of cells and organisms require a highly coordinated allocation of cellular resources to ensure the efficient synthesis of cellular components. In particular, the total enzymatic capacity for cellular metabolism is limited by finite resources that are shared between all enzymes, such as cytosolic space, energy expenditure for amino-acid synthesis, or micro-nutrients. While extensive work has been done to study constrained optimization problems based only on stoichiometric information, mathematical results that characterize the optimal flux in kinetic metabolic networks are still scarce. Here, we study constrained enzyme allocation problems with general kinetics, using the theory of oriented matroids. We give a rigorous proof for the fact that optimal solutions of the non-linear optimization problem are elementary flux modes. This finding has significant consequences for our understanding of optimality in metabolic networks as well as for the identification of metabolic switches and the computation of optimal flux distributions in kinetic metabolic networks.


Full work available at URL: https://arxiv.org/abs/1308.0510




Recommendations




Cites Work


Cited In (12)





This page was built for publication: Enzyme allocation problems in kinetic metabolic networks: optimal solutions are elementary flux modes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2632634)