Metabolites 2013, 3(3), 673-700; doi:10.3390/metabo3030673
On Functional Module Detection in Metabolic Networks
Molecular Bioinformatics group, Cluster of Excellence "Macromolecular Complexes", Johann Wolfgang Goethe-University Frankfurt (Main), Institute of Computer Science, Robert-Mayer-Strasse 11–15, Frankfurt (Main) 60325, Germany
*
Author to whom correspondence should be addressed.
Received: 31 May 2013 / Revised: 30 July 2013 / Accepted: 30 July 2013 / Published: 12 August 2013
(This article belongs to the Special Issue Metabolism and Systems Biology)
Abstract
Functional modules of metabolic networks are essential for understanding the metabolism of an organism as a whole. With the vast amount of experimental data and the construction of complex and large-scale, often genome-wide, models, the computer-aided identification of functional modules becomes more and more important. Since steady states play a key role in biology, many methods have been developed in that context, for example, elementary flux modes, extreme pathways, transition invariants and place invariants. Metabolic networks can be studied also from the point of view of graph theory, and algorithms for graph decomposition have been applied for the identification of functional modules. A prominent and currently intensively discussed field of methods in graph theory addresses the Q-modularity. In this paper, we recall known concepts of module detection based on the steady-state assumption, focusing on transition-invariants (elementary modes) and their computation as minimal solutions of systems of Diophantine equations. We present the Fourier-Motzkin algorithm in detail. Afterwards, we introduce the Q-modularity as an example for a useful non-steady-state method and its application to metabolic networks. To illustrate and discuss the concepts of invariants and Q-modularity, we apply a part of the central carbon metabolism in potato tubers (Solanum tuberosum) as running example. The intention of the paper is to give a compact presentation of known steady-state concepts from a graph-theoretical viewpoint in the context of network decomposition and reduction and to introduce the application of Q-modularity to metabolic Petri net models. View Full-TextKeywords:
metabolic networks; functional module; Petri net; t-invariant; Fourier-Motzkin algorithm; elementary mode; maximal common transition set; t-cluster; minimal cut set; community; Q-modularity
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).
Scifeed alert for new publications
Never miss any articles matching your research from any publisher- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Share & Cite This Article
MDPI and ACS Style
Koch, I.; Ackermann, J. On Functional Module Detection in Metabolic Networks. Metabolites 2013, 3, 673-700.
Related Articles
Article Metrics
Comments
[Return to top]
Metabolites
EISSN 2218-1989
Published by MDPI AG, Basel, Switzerland
RSS
E-Mail Table of Contents Alert