File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1587/transinf.E94.D.2393
- Scopus: eid_2-s2.0-82655179239
- WOS: WOS:000298304900013
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: An efficient method of computing impact degrees for multiple reactions in metabolic networks with cycles
Title | An efficient method of computing impact degrees for multiple reactions in metabolic networks with cycles | ||||
---|---|---|---|---|---|
Authors | |||||
Keywords | Boolean networks Impact degree Metabolic networks Robustness | ||||
Issue Date | 2011 | ||||
Publisher | Institute of Electronics, Information and Communication Engineers. The Journal's web site is located at http://search.ieice.org/bin/index.php?category=D&lang=E&curr=1 | ||||
Citation | IEICE Transactions On Information And Systems, 2011, v. E94-D n. 12, p. 2393-2399 How to Cite? | ||||
Abstract | The impact degree is a measure of the robustness of a metabolic network against deletion of single or multiple reaction(s). Although such a measure is useful for mining important enzymes/genes, it was defined only for networks without cycles. In this paper, we extend the impact degree for metabolic networks containing cycles and develop a simple algorithm to calculate the impact degree. Furthermore we improve this algorithm to reduce computation time for the impact degree by deletions of multiple reactions. We applied our method to the metabolic network of E. coli, that includes reference pathways, consisting of 3281 reaction nodes and 2444 compound nodes, downloaded from KEGG database, and calculate the distribution of the impact degree. The results of our computational experiments show that the improved algorithm is 18.4 times faster than the simple algorithm for deletion of reaction-pairs and 11.4 times faster for deletion of reaction-triplets. We also enumerate genes with high impact degrees for single and multiple reaction deletions. © 2011 The Institute of Electronics, Information and Communication Engineers. | ||||
Persistent Identifier | http://hdl.handle.net/10722/146395 | ||||
ISSN | 2023 Impact Factor: 0.6 2023 SCImago Journal Rankings: 0.277 | ||||
ISI Accession Number ID |
Funding Information: The work was partially supported by JSPS KAKENHI 23700017. | ||||
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tamura, T | en_HK |
dc.contributor.author | Cong, Y | en_HK |
dc.contributor.author | Akutsu, T | en_HK |
dc.contributor.author | Ching, WK | en_HK |
dc.date.accessioned | 2012-04-24T07:51:25Z | - |
dc.date.available | 2012-04-24T07:51:25Z | - |
dc.date.issued | 2011 | en_HK |
dc.identifier.citation | IEICE Transactions On Information And Systems, 2011, v. E94-D n. 12, p. 2393-2399 | en_HK |
dc.identifier.issn | 0916-8532 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/146395 | - |
dc.description.abstract | The impact degree is a measure of the robustness of a metabolic network against deletion of single or multiple reaction(s). Although such a measure is useful for mining important enzymes/genes, it was defined only for networks without cycles. In this paper, we extend the impact degree for metabolic networks containing cycles and develop a simple algorithm to calculate the impact degree. Furthermore we improve this algorithm to reduce computation time for the impact degree by deletions of multiple reactions. We applied our method to the metabolic network of E. coli, that includes reference pathways, consisting of 3281 reaction nodes and 2444 compound nodes, downloaded from KEGG database, and calculate the distribution of the impact degree. The results of our computational experiments show that the improved algorithm is 18.4 times faster than the simple algorithm for deletion of reaction-pairs and 11.4 times faster for deletion of reaction-triplets. We also enumerate genes with high impact degrees for single and multiple reaction deletions. © 2011 The Institute of Electronics, Information and Communication Engineers. | en_HK |
dc.language | eng | en_US |
dc.publisher | Institute of Electronics, Information and Communication Engineers. The Journal's web site is located at http://search.ieice.org/bin/index.php?category=D&lang=E&curr=1 | en_HK |
dc.relation.ispartof | IEICE Transactions on Information and Systems | en_HK |
dc.rights | IEICE Transactions on Information and Systems. Copyright © Institute of Electronics, Information and Communication Engineers. | - |
dc.subject | Boolean networks | en_HK |
dc.subject | Impact degree | en_HK |
dc.subject | Metabolic networks | en_HK |
dc.subject | Robustness | en_HK |
dc.title | An efficient method of computing impact degrees for multiple reactions in metabolic networks with cycles | en_HK |
dc.type | Article | en_HK |
dc.identifier.email | Ching, WK:wching@hku.hk | en_HK |
dc.identifier.authority | Ching, WK=rp00679 | en_HK |
dc.description.nature | published_or_final_version | - |
dc.identifier.doi | 10.1587/transinf.E94.D.2393 | en_HK |
dc.identifier.scopus | eid_2-s2.0-82655179239 | en_HK |
dc.identifier.hkuros | 199183 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-82655179239&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | E94-D | en_HK |
dc.identifier.issue | 12 | en_HK |
dc.identifier.spage | 2393 | en_HK |
dc.identifier.epage | 2399 | en_HK |
dc.identifier.isi | WOS:000298304900013 | - |
dc.publisher.place | Japan | en_HK |
dc.identifier.scopusauthorid | Tamura, T=13609056800 | en_HK |
dc.identifier.scopusauthorid | Cong, Y=35185897700 | en_HK |
dc.identifier.scopusauthorid | Akutsu, T=7102080520 | en_HK |
dc.identifier.scopusauthorid | Ching, WK=13310265500 | en_HK |
dc.identifier.issnl | 0916-8532 | - |