期刊
JOURNAL OF COMPUTATIONAL BIOLOGY
卷 15, 期 3, 页码 259-268出版社
MARY ANN LIEBERT, INC
DOI: 10.1089/cmb.2007.0229
关键词
algorithms; elementary modes; hypergraph transversal; metabolic networks; minimal cut sets
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据