A graph-based approach to analyze flux-balanced pathways in metabolic networks

@article{Arabzadeh2018AGA,
  title={A graph-based approach to analyze flux-balanced pathways in metabolic networks},
  author={Mona Arabzadeh and Morteza Saheb Zamani and Mehdi Sedighi and Sayed-Amir Marashi},
  journal={Bio Systems},
  year={2018},
  volume={165},
  pages={
          40-51
        }
}

Figures and Tables from this paper

A system architecture for parallel analysis of flux-balanced metabolic pathways
Finding MEMo: Minimum sets of elementary flux modes
TLDR
This article studies MEMos or minimum sets of EFMs that can generate all possible steady-state behaviours of a metabolic network and can compute generating sets ofEFMs in metabolic networks where the whole set of EFM is too large to be enumerated.
Finding MEMo: minimum sets of elementary flux modes.
TLDR
This article studies MEMos or minimum sets of EFMs that can generate all possible steady-state behaviours of a metabolic network and can compute generating sets ofEFMs in metabolic networks where the whole set of EFM is too large to be enumerated.
Boosting the extraction of elementary flux modes in genome-scale metabolic networks using the linear programming approach
TLDR
This work proposes a new method called EFM-Ta that boosts the efficiency rate by analyzing the information provided by the LP solver, and obtains many more EFMs for each LP problem posed, improving the efficiency rates of previously proposed methods by more than one order of magnitude.
Challenges and opportunities at the interface of network science and metabolic modelling
TLDR
How the integration of both approaches promises to deliver insights on the structure and function of metabolic systems with wide-ranging implications in basic discovery science, precision medicine and industrial biotechnology is highlighted.
Reduction, Projection, and Simplification of Metabolic Networks
TLDR
This thesis introduces different methods which reduce given data in metabolic networks in a meaningful way and provides procedures that reduce the number of variables in a given problem in order to accelerate (already existing) algorithms by using information given by the data.
Towards scaling elementary flux mode computation
TLDR
It is concluded that continued scaling of EFM computation is necessary to apply EFM to genome-scale models and that pathway analysis methods that target specific pathway properties can provide powerful alternatives to EFM analysis.
Review of Machine Learning Methods for the Prediction and Reconstruction of Metabolic Pathways
TLDR
The research progress of metabolic pathway reconstruction and prediction based on machine learning is reviewed and some challenging issues in the reconstruction of metabolic pathways are discussed.
Improving the EFMs quality by augmenting their representativeness in LP methods
TLDR
A proposal to improve the representativeness of the full set of metabolic reactions in the set of computed modes by penalizing the eventual high frequency of occurrence of some reactions during the extraction by applying any linear programming based extraction existent method.

References

SHOWING 1-10 OF 42 REFERENCES
Combinatorial Complexity of Pathway Analysis in Metabolic Networks
TLDR
Some estimations on the combinatorial complexity including theoretical upper bounds for the number of elementary flux modes in a network of a given size are given.
A New Approach to Obtain EFMs Using Graph Methods Based on the Shortest Path between End Nodes
TLDR
A new approach to obtain EFMs based on graph methods and the shortest path between end nodes is proposed, which finds all the pathways in the metabolic network and it is able to prioritize the pathway search accounting the biological mean pursued.
A general definition of metabolic pathways useful for systematic organization and analysis of complex metabolic networks
TLDR
This work analyzes the interplay between the pentose phosphate pathway (PPP) and glycolysis to define and comprehensively describe all metabolic routes that are both stoichiometrically and thermodynamically feasible for a group of enzymes.
Computing the shortest elementary flux modes in genome-scale metabolic networks
TLDR
A novel procedure to efficiently determine the K-shortest EFMs in large-scale metabolic networks is presented, finding that glucose catabolism, ammonium assimilation, lysine anabolism and cofactor balancing were correctly predicted.
Computing Elementary Flux Modes in Genome-scale Metabolic Networks
TLDR
The method presented here extends EFM analysis to genome-scale models and determined the parts of three metabolic networks that can be used to produce particular amino acids and found that these parts correspond to significant portions of the entire networks.
Computing Elementary Flux Modes Involving a Set of Target Reactions
  • L. Dávid, A. Bockmayr
  • Computer Science
    IEEE/ACM Transactions on Computational Biology and Bioinformatics
  • 2014
TLDR
A novel method is presented that allows computing EMs containing a given set of target reactions in genome-scale metabolic networks, and generalizes previous algorithms where the set of targets consists of a single reaction.
Metabolomics integrated elementary flux mode analysis in large metabolic networks
TLDR
This work presents thermodynamic EFMA (tEFMA), which calculates only the small(er) subset of thermodynamically feasible EFMs, and integrates network embedded thermodynamics into EFMA and shows that it can use the metabolome to identify and remove thermodynamic infeasible EFMs during an EFMA without losing biologically relevant EFMs.
gEFM: An Algorithm for Computing Elementary Flux Modes Using Graph Traversal
TLDR
GEFM is shown to be competitive with state-of-the-art EFM computational techniques for several networks, but less so for networks with a larger number of EFMs, and it is demonstrated that knowledge of the underlying network structure leads to better constraint ordering.
...
...