G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-spaccamela et al., Complexity and approximation ? Combinatorial optimization problems and their approximability properties, 1999.

G. Ausiello, P. G. Franciosa, and D. Et-frigioni, Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach, éditeurs : ICTCS, volume 2202 de Lecture Notes in Computer Science, pp.312-327, 2001.
DOI : 10.1007/3-540-45446-2_20

J. Bang-jensen and G. Et-gutin, Digraphs: Theory, Algorithms and Applications?Äé, 2008.
DOI : 10.1007/978-1-84800-998-1

C. Berge, Hypergraphs, Combinatorics of Finite Sets, 1989.

R. Caspi, MetaCyc: a multiorganism database of metabolic pathways and enzymes, Nucleic Acids Research, vol.34, issue.90001, pp.511-516, 2006.
DOI : 10.1093/nar/gkj128

B. L. Clarke, Complete set of steady states for the general stoichiometric dynamical system, The Journal of Chemical Physics, vol.75, issue.10, pp.4970-4979, 1981.
DOI : 10.1063/1.441885

S. A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

L. Cottret, P. Milreu, V. Acuña, A. Marchetti-spaccamela, F. V. Martinez et al., Enumerating Precursor Sets of Target Metabolites in a Metabolic Network, Workshop on Algorithms in Bioinformatics (WABI), volume 5251 de Lecture Notes in Computer Science, pp.233-244, 2008.
DOI : 10.1007/978-3-540-87361-7_20
URL : https://hal.archives-ouvertes.fr/hal-00428200

M. W. Covert and B. O. Et-palsson, Constraints-based models: Regulation of Gene Expression Reduces the Steady-state Solution Space, Journal of Theoretical Biology, vol.221, issue.3, pp.309-325, 2003.
DOI : 10.1006/jtbi.2003.3071

R. Diestel, Graph theory, 2006.

M. Dyer, The Complexity of Vertex Enumeration Methods, Mathematics of Operations Research, vol.8, issue.3, pp.381-402, 1983.
DOI : 10.1287/moor.8.3.381

M. Dyer and L. Et-proll, An algorithm for determining all extreme points of a convex polytope, Mathematical Programming, vol.21, issue.1, pp.81-96, 1977.
DOI : 10.1007/BF01593771

J. S. Edwards, R. U. Ibarra, and B. O. Et-palsson, In silico predictions of Escherichia coli metabolic capabilities are consistent with experimental data, Nature Biotechnology, vol.19, issue.2, pp.125-130, 2001.
DOI : 10.1038/84379

J. S. Edwards and B. O. Et-palsson, Robustness Analysis of the Escherichia coli Metabolic Network, Biotechnology Progress, vol.16, issue.6, pp.927-939, 2000.
DOI : 10.1021/bp0000712

S. S. Fong and B. O. Et-palsson, Metabolic gene???deletion strains of Escherichia coli evolve to computationally predicted growth phenotypes, Nature Genetics, vol.36, issue.10, pp.1056-1058, 2004.
DOI : 10.1016/j.ymben.2003.09.002

C. Francke, R. J. Siezen, and B. Et-teusink, Reconstructing the metabolic network of a bacterium from its genome, Trends in Microbiology, vol.13, issue.11, pp.550-558, 2005.
DOI : 10.1016/j.tim.2005.09.001

M. Fredman and L. Et-khachiyan, On the Complexity of Dualization of Monotone Disjunctive Normal Forms, Journal of Algorithms, vol.21, issue.3, 1996.
DOI : 10.1006/jagm.1996.0062

K. Fukuda and A. Et-prodon, Double description method revisited, Combinatorics and Computer Science, pp.91-111, 1996.
DOI : 10.1007/3-540-61576-8_77

J. Gagneur and S. Et-klamt, Computation of elementary modes: a unifying framework and the new binary approach, BMC Bioinformatics, vol.5, issue.1, p.175, 2004.
DOI : 10.1186/1471-2105-5-175

G. Gallo, C. Gentile, D. Pretolani, and G. Et-rago, Max Horn SAT and the minimum cut problem in directed hypergraphs, Mathematical Programming, vol.1, issue.3, pp.213-237, 1998.
DOI : 10.1007/BF01581727

M. R. Garey and D. S. Et-johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness, 1979.

V. Gurvich and L. Et-khachiyan, On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions, Discrete Applied Mathematics, vol.96, issue.97, 1999.
DOI : 10.1016/S0166-218X(99)00099-2

P. Hall, On representatives of subsets, J. London Math. Soc, issue.1, pp.1-1026, 1935.

T. Handorf, N. Christian, O. Ebenhöh, and D. Et-kahn, An environmental perspective on metabolism, Journal of Theoretical Biology, vol.252, issue.3, 2007.
DOI : 10.1016/j.jtbi.2007.10.036
URL : https://hal.archives-ouvertes.fr/hal-00428159

T. Handorf, O. Ebenhöh, and R. Heinrich, Expanding Metabolic Networks: Scopes of Compounds, Robustness, and Evolution, Journal of Molecular Evolution, vol.268, issue.4, pp.498-512, 2005.
DOI : 10.1007/s00239-005-0027-1

D. Johnson, M. Yannakakis, and C. Et-papadimitriou, On generating all maximal independent sets, Information Processing Letters, vol.27, issue.3, pp.119-123, 1988.
DOI : 10.1016/0020-0190(88)90065-8

M. Kanehisa, From genomics to chemical genomics: new developments in KEGG, Nucleic Acids Research, vol.34, issue.90001, pp.354-357, 2006.
DOI : 10.1093/nar/gkj102

L. Khachiyan, E. Boros, K. Borys, K. Elbassioni, and V. Et-gurvich, Generating All Vertices of a Polyhedron Is Hard, Discrete & Computational Geometry, vol.9, issue.4, pp.174-190, 2008.
DOI : 10.1007/s00454-008-9050-5

L. Khachiyan, E. Boros, K. Elbassioni, V. Gurvich, and K. Et-makino, On the Complexity of Some Enumeration Problems for Matroids, SIAM Journal on Discrete Mathematics, vol.19, issue.4, pp.966-984, 2005.
DOI : 10.1137/S0895480103428338

S. Klamt, Generalized concept of minimal cut sets in biochemical networks, Biosystems, vol.83, issue.2-3, pp.233-247, 2006.
DOI : 10.1016/j.biosystems.2005.04.009

S. Klamt, J. Gagneur, and A. Et-von-kamp, Algorithmic approaches for computing elementary modes in large biochemical reaction networks, IEE Proceedings - Systems Biology, vol.152, issue.4, pp.249-255, 2005.
DOI : 10.1049/ip-syb:20050035

S. Klamt and E. D. Gilles, Minimal cut sets in biochemical reaction networks, Bioinformatics, vol.20, issue.2, pp.226-234, 2004.
DOI : 10.1093/bioinformatics/btg395

S. Klamt and J. Et-stelling, Combinatorial complexity of pathway analysis in metabolic networks, Molecular Biology Reports, vol.29, issue.1/2, pp.233-236, 2002.
DOI : 10.1023/A:1020390132244

S. Klamt and J. Et-stelling, Two approaches for metabolic pathway analysis?, Trends in Biotechnology, vol.21, issue.2, pp.64-69, 2003.
DOI : 10.1016/S0167-7799(02)00034-3

V. Lacroix, L. Cottret, P. Thébault, and M. Et-sagot, An Introduction to Metabolic Networks and Their Structural Analysis, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.5, issue.4, pp.594-617, 2008.
DOI : 10.1109/TCBB.2008.79
URL : https://hal.archives-ouvertes.fr/hal-00355497

V. Lacroix, C. G. Fernandes, and M. Et-sagot, Motif Search in Graphs: Application to Metabolic Networks, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.3, issue.4, pp.360-368, 2006.
DOI : 10.1109/TCBB.2006.55
URL : https://hal.archives-ouvertes.fr/hal-00427984

A. Larhlimi and A. Et-bockmayr, A new constraint-based description of the steady-state flux cone of metabolic networks, Discrete Applied Mathematics, vol.157, issue.10, pp.2257-2266, 2009.
DOI : 10.1016/j.dam.2008.06.039

T. Motzkin, H. Raiffa, G. Thompson, and R. Et-thrall, 3. The Double Description Method, éditeurs : Contributions to the Theory of Games, volume II, pp.51-73, 1953.
DOI : 10.1515/9781400881970-004

J. G. Oxley, Matroid theory, 1992.
DOI : 10.1093/acprof:oso/9780198566946.001.0001

B. O. Palsson, The challenges of in silico biology, Nature Biotechnology, vol.18, issue.11, pp.1147-1150, 2000.
DOI : 10.1038/81125

C. H. Papadimitriou, Computational complexity, 1994.

R. Raz and S. Et-safra, A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.475-484, 1997.
DOI : 10.1145/258533.258641

P. R. Romero and P. Et-karp, NUTRIENT-RELATED ANALYSIS OF PATHWAY/GENOME DATABASES, Biocomputing 2001, pp.471-482, 2001.
DOI : 10.1142/9789814447362_0046

C. H. Schilling, D. Letscher, and B. O. Et-palsson, Theory for the Systemic Definition of Metabolic Pathways and their use in Interpreting Metabolic Function from a Pathway-Oriented Perspective, Journal of Theoretical Biology, vol.203, issue.3, pp.229-248, 2000.
DOI : 10.1006/jtbi.2000.1073

A. Schrijver, Theory of Linear and Integer Programming, 1986.

A. Schrijver, Combinatorial optimization: Polyhedra and Efficiency, volume 24 de Algorithms and Combinatorics, 2003.

S. Schuster, D. A. Fell, and T. Et-dandekar, A general definition of metabolic pathways useful for systematic organization and analysis of complex metabolic networks, Nature Biotechnology, vol.18, issue.3, pp.326-332, 2000.
DOI : 10.1038/73786

S. Schuster and C. Et-hilgetag, ON ELEMENTARY FLUX MODES IN BIOCHEMICAL REACTION SYSTEMS AT STEADY STATE, Journal of Biological Systems, vol.02, issue.02, pp.165-182, 1994.
DOI : 10.1142/S0218339094000131

S. Schuster, C. Hilgetag, J. H. Woods, and D. A. Et-fell, Reaction routes in biochemical reaction systems: Algebraic properties, validated calculation procedure and example from nucleotide metabolism, Journal of Mathematical Biology, vol.45, issue.2, pp.153-181, 2002.
DOI : 10.1007/s002850200143

S. Schuster, T. Pfeiffer, F. Moldenhauer, I. Koch, and T. Et-dandekar, Exploring the pathway structure of metabolism: decomposition into subnetworks and application to Mycoplasma pneumoniae, Bioinformatics, vol.18, issue.2, pp.351-361, 2002.
DOI : 10.1093/bioinformatics/18.2.351

J. Schwartz and M. Et-kanehisa, Quantitative elementary mode analysis of metabolic pathways: the example of yeast glycolysis, BMC Bioinformatics, vol.7, issue.1, p.186, 2006.
DOI : 10.1186/1471-2105-7-186

P. D. Seymour, The matroids with the max-flow min-cut property, Journal of Combinatorial Theory, Series B, vol.23, issue.2-3, pp.189-222, 1977.
DOI : 10.1016/0095-8956(77)90031-4

J. Stelling, Mathematical models in microbial systems biology, Current Opinion in Microbiology, vol.7, issue.5, 2004.
DOI : 10.1016/j.mib.2004.08.004

Z. Szallasi, J. Stelling, and V. Et-periwal, System Modeling in Cellular Biology: From Concepts to Nuts and Bolts, 2006.
DOI : 10.7551/mitpress/9780262195485.001.0001

M. Terzer, Large Scale Methods to Enumerate Extreme Rays and Elementary Modes, 2009.

L. G. Valiant, The complexity of computing the permanent, Theoretical Computer Science, vol.8, issue.2, pp.189-201, 1979.
DOI : 10.1016/0304-3975(79)90044-6