Title :
On the Computation of Minimal Cut Sets in Genome Scale Metabolic Networks
Author :
Imielinski, Marcin ; Belta, Calin
Author_Institution :
Univ. of Pennsylvania, Philadelphia
Abstract :
A cut set for an objective reaction in a metabolic network is a set of reactions whose knockout disables flux through that reaction at steady state. Cut sets represent a particular type of failure mode of a metabolic network and may correspond to novel drug targets. In this paper, we demonstrate how cut sets can be obtained from the computation of sub-elementary modes (sub-EM). The sub-EM´s of a metabolic network are the elementary modes (EM) of a submatrix of the stoichiometry matrix formed by taking a subset of its rows. Sub-EM´s emerge naturally in the intermediate steps of the standard tableau algorithm for computation of EM, and are thus obtainable for a network of any size. By employing properties of the feasible flux cone, we show how cut sets for a reaction can be constructed by enumerating minimal hitting sets for the sub-EM´s containing that reaction. Though the resulting cut sets are not guaranteed to be minimal, they can be reduced to minimality via a second linear programming pruning step. We demonstrate the applicability of this approach to a recent genome scale metabolic model of E.coli.
Keywords :
biochemistry; linear programming; matrix algebra; set theory; drug targets; elementary modes; genome scale metabolic networks; linear programming pruning step; minimal cut sets; minimal hitting sets; stoichiometry matrix; subelementary modes; tableau algorithm; Biochemistry; Bioinformatics; Biological system modeling; Computer networks; Genomics; Information analysis; Linear programming; Organisms; Production systems; Steady-state;
Conference_Titel :
American Control Conference, 2007. ACC '07
Conference_Location :
New York, NY
Print_ISBN :
1-4244-0988-8
Electronic_ISBN :
0743-1619
DOI :
10.1109/ACC.2007.4282821