Journal
JOURNAL OF COMPUTATIONAL BIOLOGY
Volume 15, Issue 3, Pages 259-268Publisher
MARY ANN LIEBERT, INC
DOI: 10.1089/cmb.2007.0229
Keywords
algorithms; elementary modes; hypergraph transversal; metabolic networks; minimal cut sets
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available