Computing knock out strategies in metabolic networks

Simple item page
dc.creatorHaus, Utz-Uwe
dc.creatorKlamt, Steffen
dc.creatorStephen, Tamon
dc.date2007-12-29
dc.date.accessioned2026-07-07T09:58:33Z
dc.date.available2026-07-07T09:58:33Z
dc.descriptionGiven 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.
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/0801.0082
dc.identifierhttp://arxiv.org/abs/0801.0082
dc.identifierJournal of Computational Biology. April 1, 2008, 15(3): 259-268
dc.identifierdoi:10.1089/cmb.2007.0229
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/167759
dc.subjectQuantitative Methods
dc.titleComputing knock out strategies in metabolic networks
dc.typetext

Files

Collections

arXiv