On dynamically generating relevant elementary flux modes in a metabolic network using optimization
From MaRDI portal
(Redirected from Publication:500343)
Abstract: Elementary flux modes (EFMs) are pathways through a metabolic reaction network that connect external substrates to products. Using EFMs, a metabolic network can be transformed into its macroscopic counterpart, in which the internal metabolites have been eliminated and only external metabolites remain. In EFMs-based metabolic flux analysis (MFA) experimentally determined external fluxes are used to estimate the flux of each EFM. It is in general prohibitive to enumerate all EFMs for complex networks, since the number of EFMs increases rapidly with network complexity. In this work we present an optimization-based method that dynamically generates a subset of EFMs and solves the EFMs-based MFA problem simultaneously. The obtained subset contains EFMs that contribute to the optimal solution of the EFMs-based MFA problem. The usefulness of our method was examined in a case-study using data from a Chinese hamster ovary cell culture and two networks of varied complexity. It was demonstrated that the EFMs-based MFA problem could be solved at a low computational cost, even for the more complex network. Additionally, only a fraction of the total number of EFMs was needed to compute the optimal solution.
Recommendations
- Dynamic optimization of metabolic networks coupled with gene expression
- Optimal flux patterns in cellular metabolic networks
- An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks
- Capturing the essence of a metabolic network: a flux balance analysis approach
- Enzyme allocation problems in kinetic metabolic networks: optimal solutions are elementary flux modes
- Metabolic networks, elementary flux modes, and polyhedral cones
- Sequential activation of metabolic pathways: a dynamic optimization approach
- Fast computation of minimal elementary decompositions of metabolic flux vectors
Cites work
Cited in
(14)- An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks
- Reaction routes in biochemical reaction systems: algebraic properties, validated calculation procedure and example from nucleotide metabolism
- Mixed-integer minimax dynamic optimization for structure identification of glycerol metabolic network
- An interval approach for dealing with flux distributions and elementary modes activity patterns
- Finding MEMo: minimum sets of elementary flux modes
- Robustness analysis of elementary flux modes generated by column generation
- Enzyme allocation problems in kinetic metabolic networks: optimal solutions are elementary flux modes
- scientific article; zbMATH DE number 1950551 (Why is no real title available?)
- Enumeration and Cartesian product decomposition of alternate optimal fluxes in cellular metabolism
- On the geometry of elementary flux modes
- A Markov constraint to uniquely identify elementary flux mode weights in unimolecular metabolic networks
- Parallelization of nullspace algorithm for the computation of metabolic pathways
- Fast computation of minimal elementary decompositions of metabolic flux vectors
- Regulatory dynamic enzyme-cost flux balance analysis: a unifying framework for constraint-based modeling
This page was built for publication: On dynamically generating relevant elementary flux modes in a metabolic network using optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q500343)
