Name
Abstract | ||
|---|---|---|
Given a metabolic network in terms of its metabolites and reactions, our goal is to efficiently compute the minimal knock-out sets of reactions required to block a given behavior. We describe an algorithm that improves the computation of these knock-out sets when the elementary modes (minimal functional subsystems) of the network are given. We also describe an algorithm that computes both the knock-out sets and the elementary modes containing the blocked reactions directly from the description of the network and whose worst-case computational complexity is better than the algorithms currently in use for these problems. Computational results are included. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1089/cmb.2007.0229 | JOURNAL OF COMPUTATIONAL BIOLOGY |
Keywords | Field | DocType |
algorithms,elementary modes,hypergraph transversal,metabolic networks,minimal cut sets | Metabolic network,Theoretical computer science,Artificial intelligence,Machine learning,Mathematics,Computation,Computational complexity theory | Journal |
Volume | Issue | ISSN |
15.0 | 3 | 1066-5277 |
Citations | PageRank | References |
28 | 1.50 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Utz-Uwe Haus | 1 | 226 | 18.47 |
| Steffen Klamt | 2 | 915 | 77.99 |
| Tamon Stephen | 3 | 121 | 16.03 |