Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Algorithmic approaches for computing elementary modes in large biochemical reaction networks

Algorithmic approaches for computing elementary modes in large biochemical reaction networks

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Systems Biology — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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.

References

    1. 1)
      • S. Klamt , J. Stelling , M. Ginkel , E.D. Gilles . FluxAnalyzer: exploring structure, pathways, and flux distributions in metabolic networks on interactive flux maps. Bioinformatics , 261 - 269
    2. 2)
      • S. Schuster , R. Schuster . Detecting strictly detailed balanced subnetworks in open chemical reaction networks. J. Math. Chem. , 17 - 40
    3. 3)
      • R. Urbanczik , C. Wagner . An improved algorithm for stoichiometric network analysis: theory and applications. Bioinformatics , 1203 - 1210
    4. 4)
      • C. Wagner . Nullspace approach to determine the elementary modes of chemical reaction systems. J. Phys. Chem. B , 2425 - 2431
    5. 5)
      • K. Fukuda , A. Prodon , M. Deza , R. Euler , I. Manoussakis . (1996) Double description method revisited, Combinatorics and computer science.
    6. 6)
      • J.A. Papin , N.D. Price , S.J. Wiback , D.A. Fell , B.O. Palsson . Metabolic pathways in the post-genome era. Trends Biochem. Sci. , 250 - 258
    7. 7)
      • J. Gagneur , S. Klamt . Computation of elementary modes: a unifying framework and the new binary approach. BMC Bioinformatics
    8. 8)
      • S. Schuster , D.A. Fell , T. Dandekar . A general definition of metabolic pathways useful for systematic organization and analysis of complex metabolic networks. Nat. Biotechnol. , 326 - 332
    9. 9)
      • T. Pfeiffer , I. Sanchez-Valdenebro , J.C. Nuno , F. Montero , S. Schuster . METATOOL: for studying metabolic networks. Bioinformatics , 251 - 257
    10. 10)
      • S. Klamt , J. Stelling . Combinatorial complexity of pathway analysis in metabolic networks. Mol. Biol. Rep. , 233 - 236
    11. 11)
      • R. Heinrich , S. Schuster . (1996) The regulation of cellular systems.
    12. 12)
      • A.P. Burgard , E.V. Nikolaev , C.H. Schilling , C.D. Maranas . Flux coupling analysis of genome-scale metabolic network reconstructions. Genome Res. , 301 - 312
    13. 13)
      • S.L. Bell , B.O. Palsson . Expa: a program for calculating extreme pathways in biochemical reaction networks. Bioinformatics , 1739 - 1740
    14. 14)
      • N.F. Samatova , A. Geist , G. Ostrouchov , A. Melechko . (2002) Parallel out-of-core algorithm for genome-scale enumeration of metabolic systemic pathways, Proc. Hi--COMB 2002.
    15. 15)
      • C.H. Schilling , D. Letscher , B.Ø. Palsson . Theory for the systemic definition of metabolic pathways and their use in interpreting metabolic function from a pathway-oriented perspective. J. Theor. Biol. , 229 - 248
    16. 16)
      • T.S. Motzkin , H. Raiffa , G.L. Thompson , R.M. Thrall . (1953) The double description method, Annals of mathematical studies.
    17. 17)
      • N.D. Price , J.L. Reed , B.O. Palsson . Genome-scale models of microbial cells: evaluating the consequences of constraints. Nat. Rev. Microbiol. , 886 - 897
    18. 18)
      • D. Avis , D. Brenner , R. Seidel . How good are convex hull algorithms. Comput. Geom.: Theory Appl. , 265 - 302
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-syb_20050035
Loading

Related content

content/journals/10.1049/ip-syb_20050035
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address