Skip to main content

Accelerating the Computation of Elementary Modes Using Pattern Trees

  • Conference paper
Algorithms in Bioinformatics (WABI 2006)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 4175))

Included in the following conference series:


Elementary flux modes (EFMs)—formalized metabolic pathways—are central and comprehensive tools for metabolic network analysis under steady state conditions. They act as a generating basis for all possible flux distributions and, thus, are a minimal (constructive) description of the solution space. Algorithms to compute EFMs descend from computational geometry; they are mostly synonymous to the enumeration of extreme rays of polyhedral cones. This problem is combinatorially complex, and algorithms do not scale well. Here, we introduce new concepts for the enumeration of adjacent rays, which is one of the critical and stubborn facets of the algorithms. They rely on variants of k-d-trees to store and analyze bit sets representing (intermediary) extreme rays. Bit set trees allow for speed-up of computations primarily for low-dimensional problems. Extensions to pattern trees to narrow candidate pairs for adjacency tests scale with problem size, yielding speed-ups on the order of one magnitude relative to current algorithms. Additionally, fast algebraic tests can easily be used in the framework. This constitutes one step towards EFM analysis at the whole-cell level.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others


  1. Klamt, S., Stelling, J.: Stoichiometric and constraint-based modeling. In: Szallasi, Z., Stelling, J., Periwal, V. (eds.) System Modeling in Cellular Biology, pp. 73–96. MIT Press, Cambridge (2006)

    Google Scholar 

  2. Price, N., Reed, J., Palsson, B.: Genome-scale models of microbial cells: Evaluating the consequences of constraints. Nat. Rev. Microbiol. 2, 886–897 (2004)

    Article  Google Scholar 

  3. Gagneur, J., Klamt, S.: Computation of elementary modes: A unifying framework and the new binary approach. BMC Bioinformatics 5, 175 (2004)

    Article  Google Scholar 

  4. Motzkin, T.S., Raiffa, H., Thompson, G., Thrall, R.M.: The double description method. In: Kuhn, H., Tucker, A. (eds.) Contributions to the Theory of Games II. Annals of Math. Studies, vol. 8, pp. 51–73. Princeton University Press, Princeton (1953)

    Google Scholar 

  5. Schuster, S., Hilgetag, C.: On elementary flux modes in biochemical reaction systems at steady state. J. Biol. Syst. 2, 165–182 (1994)

    Article  Google Scholar 

  6. Wagner, C.: Nullspace approach to determine the elementary modes of chemical reaction systems. J. Phys. Chem. B 108, 2425–2431 (2004)

    Article  Google Scholar 

  7. Fukuda, K., Prodon, A.: Double description method revisited. In: Combinatorics and Computer Science, pp. 91–111 (1995)

    Google Scholar 

  8. Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18, 509–517 (1975)

    Article  MATH  Google Scholar 

  9. Stelling, J., Klamt, S., Bettenbrock, K., Schuster, S., Gilles, E.: Metabolic network structure determines key aspects of functionality and regulation. Nature 420, 190–193 (2002)

    Article  Google Scholar 

  10. Klamt, S., Gagneur, J., von Kamp, A.: Algorithmic approaches for computing elementary modes in large biochemical reaction networks. IEE Proc. Systems Biol. 152, 249–255 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Terzer, M., Stelling, J. (2006). Accelerating the Computation of Elementary Modes Using Pattern Trees. In: Bücher, P., Moret, B.M.E. (eds) Algorithms in Bioinformatics. WABI 2006. Lecture Notes in Computer Science(), vol 4175. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-39583-6

  • Online ISBN: 978-3-540-39584-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics