File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1145/1651318.1651332
- Scopus: eid_2-s2.0-74049140747
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Efficient computation of impact degrees for multiple reactions in metabolic networks with cycles
Title | Efficient computation of impact degrees for multiple reactions in metabolic networks with cycles |
---|---|
Authors | |
Keywords | Boolean Networks Impact Degree Metabolic Networks Robustness |
Issue Date | 2009 |
Citation | International Conference On Information And Knowledge Management, Proceedings, 2009, p. 67-70 How to Cite? |
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. |
Persistent Identifier | http://hdl.handle.net/10722/158870 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cong, Y | en_US |
dc.contributor.author | Tamura, T | en_US |
dc.contributor.author | Akutsu, T | en_US |
dc.contributor.author | Ching, WK | en_US |
dc.date.accessioned | 2012-08-08T09:04:01Z | - |
dc.date.available | 2012-08-08T09:04:01Z | - |
dc.date.issued | 2009 | en_US |
dc.identifier.citation | International Conference On Information And Knowledge Management, Proceedings, 2009, p. 67-70 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/158870 | - |
dc.description.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. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | International Conference on Information and Knowledge Management, Proceedings | en_US |
dc.subject | Boolean Networks | en_US |
dc.subject | Impact Degree | en_US |
dc.subject | Metabolic Networks | en_US |
dc.subject | Robustness | en_US |
dc.title | Efficient computation of impact degrees for multiple reactions in metabolic networks with cycles | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Ching, WK:wching@hku.hk | en_US |
dc.identifier.authority | Ching, WK=rp00679 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1145/1651318.1651332 | en_US |
dc.identifier.scopus | eid_2-s2.0-74049140747 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-74049140747&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.spage | 67 | en_US |
dc.identifier.epage | 70 | en_US |
dc.identifier.scopusauthorid | Cong, Y=35185897700 | en_US |
dc.identifier.scopusauthorid | Tamura, T=13609056800 | en_US |
dc.identifier.scopusauthorid | Akutsu, T=7102080520 | en_US |
dc.identifier.scopusauthorid | Ching, WK=13310265500 | en_US |