Name
Abstract | ||
|---|---|---|
Constraint-based approaches recently brought new insight into our understanding of metabolism. By making very simple assumptions such as that the system is at steady-state and some reactions are irreversible, and without requiring kinetic parameters, general properties of the system can be derived. A central concept in this methodology is the notion of an elementary mode (EM for short) which represents a minimal functional subsystem. The computation of EMs still forms a limiting step in metabolic studies and several algorithms have been proposed to address this problem leading to increasingly faster methods. However, although a theoretical upper bound on the number of elementary modes that a network may possess has been established, surprisingly, the complexity of this problem has never been systematically studied. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.biosystems.2008.06.015 | Biosystems |
Keywords | Field | DocType |
Metabolic networks,Algorithms,Computational complexity,Stoichiometry,Linear programming,Enumeration | Cut,Approximation algorithm,Polynomial,Computer science,Upper and lower bounds,Algorithm,Linear programming,Artificial intelligence,Time complexity,Machine learning,Computation,Computational complexity theory | Journal |
Volume | Issue | ISSN |
95 | 1 | 0303-2647 |
Citations | PageRank | References |
34 | 2.04 | 20 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vicente Acuña | 1 | 84 | 7.94 |
| Flavio Chierichetti | 2 | 626 | 39.42 |
| Vincent Lacroix | 3 | 301 | 21.03 |
| Alberto Marchetti-Spaccamela | 4 | 1584 | 150.60 |
| Marie-France Sagot | 5 | 1337 | 109.23 |
| Leen Stougie | 6 | 892 | 107.93 |