Brief paper: Fast computation of minimal elementary decompositions of metabolic flux vectors

  • Authors:
  • Raphael M. Jungers;Francisca Zamorano;Vincent D. Blondel;Alain Vande Wouwer;Georges Bastin

  • Affiliations:
  • Massachusetts Institute of Technology, 77 Massachusetts Avenue, Room 32D-668. Cambridge, MA 02139, USA;Service d'Automatique, Université de Mons, 31 Boulevard Dolez, 7000 Mons, Belgium;Center for Systems Engineering and Applied Mechanics (CESAME), Department of Mathematical Engineering, Batiment Euler, Avenue Georges Lemaitre, 4, 1348 Louvain-La-Neuve, Belgium;Service d'Automatique, Université de Mons, 31 Boulevard Dolez, 7000 Mons, Belgium;Center for Systems Engineering and Applied Mechanics (CESAME), Department of Mathematical Engineering, Batiment Euler, Avenue Georges Lemaitre, 4, 1348 Louvain-La-Neuve, Belgium

  • Venue:
  • Automatica (Journal of IFAC)
  • Year:
  • 2011

Quantified Score

Hi-index 22.14

Visualization

Abstract

The concept of elementary flux vector is valuable in a number of applications of metabolic engineering. For instance, in metabolic flux analysis, each admissible flux vector can be expressed as a non-negative linear combination of a small number of elementary flux vectors. However a critical issue concerns the total number of elementary flux vectors which may be huge because it combinatorially increases with the size of the metabolic network. In this paper we present a fast algorithm that randomly computes a decomposition of admissible flux vectors in a minimal number of elementary flux vectors without explicitly enumerating all of them.