Zahra R.M. Kashani, Hayedeh Ahrabian, Elahe Elahi, Abbas Nowzari-Dalini, Elnaz S. Ansari, Sahar Asadi, Shahin Mohammadi, Falk Schreiber and Ali Masoudi-Nejad
Kavosh: a new algorithm for finding network motifs
BMC Bioinformatics, Volume 10, Issue 318, 2009.
Abstract: Background Complex networks are studied across many fields of science and are particularly important to understand biological processes. Motifs in networks are small connected sub-graphs that occur significantly in higher frequencies than in random networks. They have recently gathered much attention as a useful concept to uncover structural design principles of complex networks. Existing algorithms for finding network motifs are extremely costly in CPU time and memory consumption and have practically restrictions on the size of motifs. Results We present a new algorithm (Kavosh), for finding k-size network motifs with less memory and CPU time in comparison to other existing algorithms. Our algorithm is based on counting all k-size sub-graphs of a given graph (directed or undirected). We evaluated our algorithm on biological networks of E. coli and S. cereviciae, and also on non-biological networks: a social and an electronic network. Conclusion The efficiency of our algorithm is demonstrated by comparing the obtained results with three well-known motif finding tools. For comparison, the CPU time, memory usage and the similarities of obtained motifs are considered. Besides, Kavosh can be employed for finding motifs of size greater than eight, while most of the other algorithms have restriction on motifs with size greater than eight. The Kavosh source code and help files are freely available at:
Paper: [PDF (0.8MB)]
  AUTHOR = {Zahra R.M. Kashani and Hayedeh Ahrabian and Elahe Elahi and Abbas Nowzari-Dalini and Elnaz S. Ansari and Sahar Asadi and Shahin Mohammadi and Falk Schreiber and Ali Masoudi-Nejad},
  TITLE = {Kavosh: a new algorithm for finding network motifs},
  JOURNAL = {BMC Bioinformatics},
  YEAR = {2009},
  VOLUME = {10},
  NUMBER = {318},
  DOI = {10.1186/1471-2105-10-318}