title: A note on the complexity of finding and enumerating elementary modes.
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.
authors: Université de Lyon, France. viacuna@biomserv.univ-lyon1.fr
authors: Vicente
authors: V
authors: Acuña
authors: Alberto
authors: A
authors: Marchetti-Spaccamela
authors: Marie-France
authors: MF
authors: Sagot
authors: Leen
authors: L
authors: Stougie
mesh_terms: D053858:Metabolic Networks and Pathways / Q000502:physiology; D008954:Models, Biological