From this page you can download a tool to detect network motifs as described in
and is much faster than any other available motif detection tool, especially for larger motifs of size >4. Additionally, it allows for the detection of network motifs in colored networks.
You may use FANMOD for all of your research purposes as long as you do the following:
Absolutely no guarantees or warranties are made concerning the suitability, correctness, or any other aspect of the distributed files. Any use is at your own risk. This software uses the nauty program version 2.2 by Brendan McKay; note that hence nauty's license restrictions also apply to your use of FANMOD.
Last updated on July 14th, 2006.
Some testdata is available from the webpage of Uri Alon at the Weizmann Institute here.
We had some people experience problems with the Linux version of FANMOD because different distributions contain different libraries. Therefore we make the source available, but under some restrictions:
If this seems agreeable to you, you can download the FANMOD source here. The ZIP-file also contains a compile script for the GNU gcc/g++ compiler, assuming you have a working version of the wxWidgets framework version 2.6 installed. Please understand that we cannot give any support concerning the compilation - it works fine on our machines. :)
If you want to download the C++-sourcecodes mentioned in the WABI paper, these are available
Both sources have been written for and tested with the GNU gcc/g++ compiler collection. Thanks to Sergi Valverde (homepage, email) at the Universitat Pompeu Fabra, Barcelona, Spain, there is also a version of the RAND-ESU code available for compilation with Microsoft Visual C++, it can be downloaded here.
Note that the subgraph concentration tool is only a proof-of-concept and much less mature and tested than the motif detection tool. Since the release of FANMOD, both sources are no longer actively maintained.
The program was written by Florian Rasche and Sebastian Wernicke (homepage, email). Sebastian Wernicke's research is funded by a scholarship from the Deutsche Telekom Stiftung. Florian Rasche's position as a student research assistant is funded by the Deutsche Forschungsgemeinschaft, project PEAL (Parameterized Complexity and Exact Algorithms), NI 369/1.
Happy motif detecting!