Title: A comparative study on network motif discovery algorithms

Authors: Yusuf Kavurucu

Addresses: Department of Computer Engineering, Turkish Naval Academy, Tuzla, Istanbul, Turkey

Abstract: 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.

Keywords: network motif discovery; graph mining; subgraph isomorphism; subgraph sampling; complex networks; bioinformatics; network motifs.

DOI: 10.1504/IJDMB.2015.066777

International Journal of Data Mining and Bioinformatics, 2015 Vol.11 No.2, pp.180 - 204

Received: 16 Jul 2013
Accepted: 08 Feb 2014
Published online: 05 Jan 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article