MODA: an efficient algorithm for network motif discovery in biological networks.

Area of Science:

• Complex networks
• Graph theory
• Computational biology

Background:

• The study of complex networks has a rich history, originating from the Erdös and Rényi random graph model.
• While global network features are well-studied, local features like network motifs are crucial building blocks.
• Discovering large network motifs (over 8 nodes) is computationally challenging with existing algorithms.

Purpose of the Study:

• To present a novel algorithm, MODA, for efficient network motif discovery.
• To address the computational limitations of current methods for identifying large motifs.

Main Methods:

• Developed the MODA algorithm, employing a pattern growth approach.
• Tested MODA's efficiency in extracting large motifs compared to state-of-the-art algorithms.
• Enabled simultaneous extraction of both induced and non-induced subgraphs.

Main Results:

• MODA demonstrates superior efficiency in identifying large network motifs (more than 8 nodes).
• The algorithm outperforms existing methods in computational performance for motif discovery.
• MODA successfully extracts both induced and non-induced subgraphs.

Conclusions:

• MODA offers a computationally efficient solution for discovering large network motifs.
• The algorithm advances the field of network motif discovery by handling both subgraph types.
• The MODA source code is publicly available for further research and application.