Computing Knock-Out Strategies in Metabolic Networks

  • Haus U
  • Klamt S
  • Stephen T
  • 37


    Mendeley users who have this article in their library.
  • 46


    Citations of this article.


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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Utz-Uwe Haus

  • Steffen Klamt

  • Tamon Stephen

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free