Fast computation of minimal elementary decompositions of metabolic flux vectors

Jungers, Raphaël;Zamorano, Francisca;Blondel, Vincent;Vande Wouwer, Alain;Bastin, Georges
(2011) Automatica — Vol. 47, n° 6, p. 1255-1259 (2011)

Files

90968.pdf
  • Restricted Access
  • Adobe PDF
  • 362.41 KB
Request a copy
paper94.pdf
  • Open Access
  • Adobe PDF
  • 602.56 KB
Download

Details

Authors
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.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Jungers, R., Zamorano, F., Blondel, V., Vande Wouwer, A., & Bastin, G. (2011). Fast computation of minimal elementary decompositions of metabolic flux vectors. Automatica, 47(6), 1255-1259. https://doi.org/10.1016/j.automatica.2011.01.011 (Original work published 2011)