Article thumbnail

Efficient computation of impact degrees for multiple reactions in metabolic networks with cycles

By Y Cong, T Tamura, T Akutsu and WK Ching

Abstract

Analysis of the robustness of a metabolic network against of single or multiple reaction(s) is useful for mining important enzymes/genes. For that purpose, the impact degree was proposed by Jiang et al. In this short paper, we extend the impact degree for metabolic networks containing cycles and develop a simple algorithm for its computation. Furthermore, we propose an improved algorithm for computing impact degrees for deletions of multiple reactions. The results of preliminary computational experiments suggest that the improved algorithm is several tens of times faster than a simple algorithm. Copyright 2009 ACM.link_to_subscribed_fulltex

Topics: Boolean Networks, Impact Degree, Metabolic Networks, Robustness
Publisher: 'Association for Computing Machinery (ACM)'
Year: 2009
DOI identifier: 10.1145/1651318.1651332
OAI identifier: oai:hub.hku.hk:10722/158870
Provided by: HKU Scholars Hub
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/10722/15... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.