MODA: an efficient algorithm for network motif discovery in biological networks. In recent years, interest has been growing in the study of complex networks. Since Erdös and Rényi (1960) proposed their random graph model about 50 years ago, many researchers have investigated and shaped this field. Many indicators have been proposed to assess the global features of networks. Recently, an active research area has developed in studying local features named motifs as the building blocks of networks. Unfortunately, network motif discovery is a computationally hard problem and finding rather large motifs (larger than 8 nodes) by means of current algorithms is impractical as it demands too much computational effort. In this paper, we present a new algorithm (MODA) that incorporates techniques such as a pattern growth approach for extracting larger motifs efficiently. We have tested our algorithm and found it able to identify larger motifs with more than 8 nodes more efficiently than most of the current state-of-the-art motif discovery algorithms. While most of the algorithms rely on induced subgraphs as motifs of the networks, MODA is able to extract both induced and non-induced subgraphs simultaneously. The MODA source code is freely available at:

References in zbMATH (referenced in 4 articles )

Showing results 1 to 4 of 4.
Sorted by year (citations)

  1. Erciyes, K.: Distributed and sequential algorithms for bioinformatics (2015)
  2. Ribeiro, Pedro; Silva, Fernando: G-Tries: a data structure for storing and finding subgraphs (2014)
  3. Ribeiro, Pedro; Silva, Fernando; Lopes, Luís: Parallel discovery of network motifs (2012) ioport
  4. Fionda, Valeria: Biological network analysis and comparison: mining new biological knowledge (2011) ioport