Discovery of network motifs based on induced subgraphs using a dynamic expansion tree

被引:0
|
作者
Patra, Sabyasachi [1 ]
机构
[1] IIIT, Dept Comp Sci, Bioinformat Lab, Bhubaneswar, India
关键词
Biological network; Network motif; Induced subgraph; Subgraph isomorphism; Static expansion tree; Dynamic expansion tree; BUILDING-BLOCKS; ALGORITHM; PATTERNS; TOOL;
D O I
10.1016/j.compbiolchem.2021.107530
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Biological networks are powerful representations of topological features in biological systems. Finding network motifs in biological networks is a computationally hard problem due to their huge size and abrupt increase of search space with the increase of motif size. Motivated by the computational challenges of network motif discovery and considering the importance of this topic, an efficient and scalable network motif discovery algorithm based on induced subgraphs in a dynamic expansion tree is proposed. This algorithm uses a pruning strategy to overcome the space limitation of the static expansion tree. The proposed algorithm can identify large network motifs up to size 15 by significantly reducing the computationally expensive subgraph isomorphism checks. Further, the present work avoids the unnecessary growth of patterns that do not have any statistical significance. The runtime performance of the proposed algorithm outperforms most of the existing algorithms for large network motifs.
引用
收藏
页数:11
相关论文
共 50 条
  • [1] Discovery of network motifs based on induced subgraphs using a dynamic expansion tree
    Patra, Sabyasachi
    [J]. Computational Biology and Chemistry, 2021, 93
  • [2] Motif discovery in biological network using expansion tree
    Patra, Sabyasachi
    Mohapatra, Anjali
    [J]. JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 2018, 16 (06)
  • [3] Application of dynamic expansion tree for finding large network motifs in biological networks
    Patra, Sabyasachi
    Mohapatra, Anjali
    [J]. PEERJ, 2019, 7
  • [4] Distributed discovery of frequent subgraphs of a network using MapReduce
    Saeed Shahrivari
    Saeed Jalili
    [J]. Computing, 2015, 97 : 1101 - 1120
  • [5] Distributed discovery of frequent subgraphs of a network using MapReduce
    Shahrivari, Saeed
    Jalili, Saeed
    [J]. COMPUTING, 2015, 97 (11) : 1101 - 1120
  • [6] Dynamic Network Link Prediction by Learning Effective Subgraphs using CNN-LSTM
    Selvarajah, Kalyani
    Ragunathan, Kumaran
    Kobti, Ziad
    Kargar, Mehdi
    [J]. 2020 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2020,
  • [7] Research of directed network capacity expansion based on spanning tree diagram
    Xu, Kaihua
    Liu, Yuhua
    Huang, Hao
    Zhu, Haiyan
    [J]. ICNC 2007: THIRD INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 5, PROCEEDINGS, 2007, : 69 - +
  • [8] Research of undirected network capacity expansion based on the spanning-tree
    Liu, Yuhua
    Xu, Kaihua
    Huang, Hao
    Teng, Wei
    [J]. SIMULATED EVOLUTION AND LEARNING, PROCEEDINGS, 2006, 4247 : 228 - 235
  • [9] BinRank: Scaling Dynamic Authority-Based Search Using Materialized SubGraphs
    Hwang, Heasoo
    Balmin, Andrey
    Reinwald, Berthold
    Nijkamp, Erik
    [J]. ICDE: 2009 IEEE 25TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2009, : 66 - 77
  • [10] BinRank: Scaling Dynamic Authority-Based Search Using Materialized Subgraphs
    Hwang, Heasoo
    Balmin, Andrey
    Reinwald, Berthold
    Nijkamp, Erik
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2010, 22 (08) : 1176 - 1190