Accelerating the Computation of Elementary Modes Using Pattern Trees

  • Marco Terzer
  • Jörg Stelling
Conference paper

DOI: 10.1007/11851561_31

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4175)
Cite this paper as:
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Marco Terzer
    • 1
  • Jörg Stelling
    • 1
  1. 1.Department of Computer ScienceETH ZurichZurichSwitzerland

Personalised recommendations