FANMOD fast network motif detection – manual –

fanmod [6] is a tool for finding so-called networks motifs in a network, that is, it finds small vertex-induced subgraphs that occur significantly more often than in random networks. For a general introduction to the concept of network motifs, see [3, 2]. fanmod is able to search for network motifs of size between three and eight vertices. It can also analyze colored networks, allowing the user to bring more information into the network rather than just connectivities. fanmod detects motifs by using the so-called rand-esu algorithm which makes it faster than similar programs based on other algorithms, especially for larger motifs. More details on the rand-esu algorithm can be found in [5]. fanmod features a graphical interface for easy setup of algorithm parameters; the results can be exported to html. Even though this manual has become quite long by covering all the details, the use of fanmod should be quite intuitive. We have paid attention to giving all parameters sound default values, so if you wish to start detecting motifs right away the short introduction in Section 3 should be all you need. Whenever you want to tune the parameters, find out more about some details of the program, or if anything else remains unclear, please consult the more detailed sections: