MNetDec: A Flexible Algorithm for Metabolic Network Decomposition

被引:2
|
作者
Hao, Tong [1 ]
Wang, Bin [1 ]
Yu, Ailing [1 ]
Liu, Anan [2 ]
Sun, Jinsheng [1 ,3 ]
机构
[1] Tianjin Normal Univ, Coll Life Sci, Tianjin Key Lab Anim & Plant Resistance, Tianjin 300387, Peoples R China
[2] Tianjin Univ, Sch Elect Informat Engn, Tianjin 300072, Peoples R China
[3] Tianjin Aquat Anim Infect Dis Control & Prevent C, Tianjin 300221, Peoples R China
关键词
Metabolic network; Decomposition; Modularity; Dendrogram;
D O I
10.1007/978-3-319-08991-1_88
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Relevant modules of a metabolic network can reveal the underlying structure of the metabolic system and hence provide the insight into its function. Modularity is a useful standard for decomposing a complex network. However, it has been shown that simply optimizing modularity failed to find the most natural community structure by overpartition or under partition the network. Here, a novel network decomposition algorithm, called MNetDec, is proposed by integrating the dendrogram and modularity features of a metabolic network. By dealing with MNetDec, the small modules with questionable biological function are eliminated. Moreover, the size of the smallest module and final number of the modules in the decomposition result can be flexibly set by the users based on their own specific needs. The application of this algorithm on brain specific human metabolic network shows that MNetDec can generate biological reasonable modules with high modularity.
引用
收藏
页码:839 / 845
页数:7
相关论文
共 50 条
  • [1] A Modified Benders Decomposition Algorithm for a Last-Mile Network with Flexible Delivery Options
    Zahedi-Anaraki A.
    Tavakkoli-Moghaddam R.
    Sadeghian R.
    [J]. International Journal of Engineering, Transactions B: Applications, 2022, 35 (08):
  • [2] A Modified Benders Decomposition Algorithm for a Last-mile Network with Flexible Delivery Options
    Zahedi-Anaraki, A.
    Tavakkoli-Moghaddam, R.
    Sadeghian, R.
    [J]. INTERNATIONAL JOURNAL OF ENGINEERING, 2022, 35 (08): : 1547 - 1557
  • [3] Network Slicing via Function Decomposition and Flexible Network Design
    Michalopoulos, Diomidis S.
    Doll, Mark
    Sciancalepore, Vincenzo
    Bega, Dario
    Schneider, Peter
    Rost, Peter
    [J]. 2017 IEEE 28TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2017,
  • [4] A DECOMPOSITION ALGORITHM FOR SHORTEST PATHS IN A NETWORK
    HU, TC
    [J]. OPERATIONS RESEARCH, 1968, 16 (01) : 91 - &
  • [5] DECOMPOSITION ALGORITHM FOR NETWORK RELIABILITY ANALYSIS
    SHOGAN, AW
    [J]. NETWORKS, 1978, 8 (03) : 231 - 251
  • [6] A DECOMPOSITION ALGORITHM FOR MULTITERMINAL NETWORK FLOWS
    SHING, MT
    HU, TC
    [J]. DISCRETE APPLIED MATHEMATICS, 1986, 13 (2-3) : 165 - 181
  • [7] A decomposition algorithm for network reliability evaluation
    Carlier, J
    Lucet, C
    [J]. DISCRETE APPLIED MATHEMATICS, 1996, 65 (1-3) : 141 - 156
  • [8] Benders Decomposition Algorithm for Reference Network
    Zhang, Jie
    Cao, Xiangyang
    Tian, Xin
    Wang, Zhen
    Wang, Mingqiang
    Han, Xueshan
    Li, Shan
    [J]. TENCON 2015 - 2015 IEEE REGION 10 CONFERENCE, 2015,
  • [9] Image decomposition for selective encryption and flexible network services
    Scopigno, RM
    Belfiore, S
    [J]. GLOBECOM '04: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6, 2004, : 2302 - 2307
  • [10] SHORTCUT IN DECOMPOSITION ALGORITHM FOR SHORTEST PATHS IN A NETWORK
    HU, TC
    TORRES, WT
    [J]. IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1969, 13 (04) : 387 - &