A comparative study on network motif discovery algorithms

作者：Kavurucu Yusuf^*

来源：International Journal of Data Mining and Bioinformatics, 2015, 11(2): 180-204.

DOI：10.1504/IJDMB.2015.066777

• network motif discovery
• graph mining
• subgraph isomorphism
• subgraph sampling
• complex networks
• bioinformatics

Subgraphs that occur in complex networks with significantly higher frequency than those in randomised networks are called network motifs. Such subgraphs often play important roles in the functioning of those networks. Finding network motifs is a computationally challenging problem. The main difficulties arise from the fact that real networks are large and the size of the search space grows exponentially with increasing network and motif size. Numerous methods have been developed to overcome these challenges. This paper provides a comparative study of the key network motif discovery algorithms in the literature and presents their algorithmic details on an example network.

• 出版日期2015
• 单位中国人民解放军海军大连舰艇学院