Algorithmic approaches for computing elementary modes in large biochemical reaction networks.

The concept of elementary (flux) modes provides a rigorous description of pathways in metabolic networks and proved to be valuable in a number of applications. However, the computation of elementary modes is a hard computational task that gave rise to several variants of algorithms during the last years. This work brings substantial progresses to this issue. The authors start with a brief review of results obtained from previous work regarding (a) a unified framework for elementary-mode computation, (b) network compression and redundancy removal and (c) the binary approach by which elementary modes are determined as binary patterns reducing the memory demand drastically without loss of speed. Then the authors will address herein further issues. First, a new way to perform the elementarity tests required during the computation of elementary modes which empirically improves significantly the computation time in large networks is proposed. Second, a method to compute only those elementary modes where certain reactions are involved is derived. Relying on this method, a promising approach for computing EMs in a completely distributed manner by decomposing the full problem in arbitrarity many sub-tasks is presented. The new methods have been implemented in the freely available software tools FluxAnalyzer and Metatool and benchmark tests in realistic networks emphasise the potential of our proposed algorithms.

[1]  D. Fell,et al.  A general definition of metabolic pathways useful for systematic organization and analysis of complex metabolic networks , 2000, Nature Biotechnology.

[2]  B. Palsson,et al.  Genome-scale models of microbial cells: evaluating the consequences of constraints , 2004, Nature Reviews Microbiology.

[3]  Komei Fukuda,et al.  Double Description Method Revisited , 1995, Combinatorics and Computer Science.

[4]  H. Raiffa,et al.  3. The Double Description Method , 1953 .

[5]  Stefan Schuster,et al.  Detecting strictly detailed balanced subnetworks in open chemical reaction networks , 1991 .

[6]  Juan Carlos Nuño,et al.  METATOOL: for studying metabolic networks , 1999, Bioinform..

[7]  Bernhard O. Palsson,et al.  Expa: a Program for Calculating Extreme Pathways in Biochemical Reaction Networks , 2005, Bioinform..

[8]  Steffen Klamt,et al.  Computation of elementary modes: a unifying framework and the new binary approach , 2004, BMC Bioinformatics.

[9]  Robert Urbanczik,et al.  An improved algorithm for stoichiometric network analysis: theory and applications , 2005, Bioinform..

[10]  R. Heinrich,et al.  The Regulation of Cellular Systems , 1996, Springer US.

[11]  J. Stelling,et al.  Combinatorial Complexity of Pathway Analysis in Metabolic Networks , 2004, Molecular Biology Reports.

[12]  C. Wagner.  Nullspace Approach to Determine the Elementary Modes of Chemical Reaction Systems , 2004 .

[13]  Raimund Seidel,et al.  How Good Are Convex Hull Algorithms? , 1997, Comput. Geom..

[14]  B. Palsson,et al.  Theory for the systemic definition of metabolic pathways and their use in interpreting metabolic function from a pathway-oriented perspective. , 2000, Journal of theoretical biology.

[15]  Nagiza F. Samatova,et al.  Parallel out-of-core algorithm for genome-scale enumeration of metabolic systemic pathways , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[16]  Jason A. Papin,et al.  Metabolic pathways in the post-genome era. , 2003, Trends in biochemical sciences.

[17]  Steffen Klamt,et al.  FluxAnalyzer: exploring structure, pathways, and flux distributions in metabolic networks on interactive flux maps , 2003, Bioinform..

[18]  C. Schilling,et al.  Flux coupling analysis of genome-scale metabolic network reconstructions. , 2004, Genome research.