The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration

被引:17
|
作者
Houbraken, Maarten [1 ]
Demeyer, Sofie [2 ]
Michoel, Tom [2 ]
Audenaert, Pieter [1 ]
Colle, Didier [1 ]
Pickavet, Mario [1 ]
机构
[1] Univ Ghent, Dept Informat Technol, iMinds, B-9000 Ghent, Belgium
[2] Univ Edinburgh, Roslin Inst, Div Genet & Genom, Edinburgh EH8 9YL, Midlothian, Scotland
来源
PLOS ONE | 2014年 / 9卷 / 05期
基金
比利时弗兰德研究基金会;
关键词
NETWORK;
D O I
10.1371/journal.pone.0097896
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Subgraph matching algorithms are used to find and enumerate specific interconnection structures in networks. By enumerating these specific structures/subgraphs, the fundamental properties of the network can be derived. More specifically in biological networks, subgraph matching algorithms are used to discover network motifs, specific patterns occurring more often than expected by chance. Finding these network motifs yields information on the underlying biological relations modelled by the network. In this work, we present the Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS), an improved version of the Index-based Subgraph Matching Algorithm (ISMA). ISMA quickly finds all instances of a predefined motif in a network by intelligently exploring the search space and taking into account easily identifiable symmetric structures. However, more complex symmetries (possibly involving switching multiple nodes) are not taken into account, resulting in superfluous output. ISMAGS overcomes this problem by using a customised symmetry analysis phase to detect all symmetric structures in the network motif subgraphs. These structures are then converted to symmetry-breaking constraints used to prune the search space and speed up calculations. The performance of the algorithm was tested on several types of networks (biological, social and computer networks) for various subgraphs with a varying degree of symmetry. For subgraphs with complex (multi-node) symmetric structures, high speed-up factors are obtained as the search space is pruned by the symmetry-breaking constraints. For subgraphs with no or simple symmetric structures, ISMAGS still reduces computation times by optimising set operations. Moreover, the calculated list of subgraph instances is minimal as it contains no instances that differ by only a subgraph symmetry. An implementation of the algorithm is freely available at https://github.com/mhoubraken/ISMAGS.
引用
收藏
页数:15
相关论文
共 17 条
  • [1] The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees
    Demeyer, Sofie
    Michoel, Tom
    Fostier, Jan
    Audenaert, Pieter
    Pickavet, Mario
    Demeester, Piet
    [J]. PLOS ONE, 2013, 8 (04):
  • [2] A subgraph matching algorithm based on subgraph index for knowledge graph
    Yunhao Sun
    Guanyu Li
    Jingjing Du
    Bo Ning
    Heng Chen
    [J]. Frontiers of Computer Science, 2022, 16
  • [3] A subgraph matching algorithm based on subgraph index for knowledge graph
    Sun, Yunhao
    Li, Guanyu
    Du, Jingjing
    Ning, Bo
    Chen, Heng
    [J]. FRONTIERS OF COMPUTER SCIENCE, 2022, 16 (03)
  • [4] A subgraph matching algorithm based on subgraph index for knowledge graph
    Yunhao SUN
    Guanyu LI
    Jingjing DU
    Bo NING
    Heng CHEN
    [J]. Frontiers of Computer Science., 2022, 16 (03) - 141
  • [5] A star identification algorithm based on simplest general subgraph
    Liu, Hao
    Wei, Xinguo
    Li, Jian
    Wang, Gangyi
    [J]. ACTA ASTRONAUTICA, 2021, 183 : 11 - 22
  • [6] Similar Group Finding Algorithm Based on Temporal Subgraph Matching
    Cai, Yizhu
    Li, Mo
    Xin, Junchang
    [J]. ADVANCED DATA MINING AND APPLICATIONS, ADMA 2019, 2019, 11888 : 221 - 235
  • [7] Optimized Distributed Subgraph Matching Algorithm Based on Partition Replication
    Yuan, Ling
    Bin, Jiali
    Pan, Peng
    [J]. ELECTRONICS, 2020, 9 (01)
  • [8] BFS-based distributed algorithm for parallel local-directed subgraph enumeration
    Levinas, Itay
    Scherz, Roy
    Louzoun, Yoram
    [J]. JOURNAL OF COMPLEX NETWORKS, 2022, 10 (06)
  • [9] SCBT-index:Subgraph Indexing Algorithm Based on Spectral Coding
    Shi, Wei-Jie
    Dong, Yi-Hong
    Qian, Jiang-Bo
    Chen, Hua-Hui
    Xin, Yu
    [J]. Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2020, 48 (01): : 110 - 117
  • [10] Ontology matching algorithm based on subgraph approximate isomorphic in pathology e-learning resource
    Ye, Huaqiao
    Huang, Chunguo
    Dai, Renjun
    [J]. BASIC & CLINICAL PHARMACOLOGY & TOXICOLOGY, 2019, 125 : 11 - 11