Computing knock out strategies in metabolic networks

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 behaviour. We describe an algorithm which 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 which 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.

12 pages

Cited by in corpus (5)

• Minimal Conflicting Sets for the Consecutive Ones Property in ancestral genome reconstruction
• Analysis of the impact degree distribution in metabolic networks using branching process approximation
• Theoretical estimation of metabolic network robustness against multiple reaction knockouts using branching process approximation
• Counting inequivalent monotone Boolean functions
• Incremental complexity of a bi-objective hypergraph transversal problem