Double Description Method Revisited
Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science
Accelerating the computation of elementary modes using pattern trees
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Minimum ratio cover of matrix columns by extreme rays of its induced cone
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Hi-index | 22.14 |
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.