4.6 Article

Scalable computation of intracellular metabolite concentrations

Journal

COMPUTERS & CHEMICAL ENGINEERING
Volume 145, Issue -, Pages -

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.compchemeng.2020.107164

Keywords

Constraint-based models; Metabolomics; Thermodynamic constraints; Polynomial optimization; Global optimization; Semidefinite programs; Algebraic geometry

Funding

  1. Novo Nurlisk Foundation [NNFIOCC1016517]

Ask authors/readers for more resources

Quantitative characterization of intracellular metabolite concentrations is essential for predictive models of cellular functions. Researchers have introduced tractable computational techniques to characterize intracellular metabolite concentrations within a constraint-based modeling framework, which can generally be nonconvex and disconnected. Three approaches based on polynomial optimization, random sampling, and global optimization are examined, with global optimization showing more desirable scaling properties for handling large-scale metabolic networks.
Quantitative characterization of intracellular metabolite concentrations is central to predictive models of cellular functions. Current constraint-based models of metabolism and macromolecular expression provide genotype-phenotype predictions without accounting for intracellular concentrations using simplifying assumptions and optimality principles. However, optimality principles do not generally apply under stress conditions, rendering these predictions unreliable. Incorporation of intracellular concentrations into constraint-based or kinetic models of cellular functions introduces nonlinearities that are computationally challenging to handle, limiting their applicability to small-scale biological networks. Here, we introduce tractable computational techniques to characterize intracellular metabolite concentrations within a constraint-based modeling framework. This model provides a feasible concentration set, which can generally be nonconvex and disconnected. We examine three approaches based on polynomial optimization, random sampling, and global optimization. We leverage the sparsity and algebraic structure of the underlying biophysical models to enhance the computational efficiency of these techniques. We then compare their performance in two case studies, showing that the global-optimization formulation exhibits more desirable scaling properties than the random-sampling and polynomial-optimization formulation, and, thus, is a promising candidate for handling large-scale metabolic networks. (C) 2020 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available