| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 2076385 | Biosystems | 2010 | 5 Pages |
Abstract
In the context of the study into elementary modes of metabolic networks, we prove two complexity results. Enumerating elementary modes containing a specific reaction is hard in an enumeration complexity sense. The decision problem if there exists an elementary mode containing two specific reactions is NP-complete. The complexity of enumerating all elementary modes remains open.
Related Topics
Physical Sciences and Engineering
Mathematics
Modelling and Simulation
Authors
Vicente Acuña, Alberto Marchetti-Spaccamela, Marie-France Sagot, Leen Stougie,