Kavosh: a new algorithm for finding network motifs
Open Access
- 4 October 2009
- journal article
- Published by Springer Science and Business Media LLC in BMC Bioinformatics
- Vol. 10 (1), 318
- https://doi.org/10.1186/1471-2105-10-318
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: http://Lbb.ut.ac.ir/Download/LBBsoft/Kavosh/.Keywords
This publication has 14 references indexed in Scilit:
- Unraveling Protein Networks with Power Graph AnalysisPLoS Computational Biology, 2008
- ValgrindACM SIGPLAN Notices, 2007
- Clustering by common friends finds locally significant proteins mediating modulesBioinformatics, 2007
- Towards an Integrated Protein–Protein Interaction Network: A Relational Markov Network ApproachJournal of Computational Biology, 2006
- FANMOD: a tool for fast network motif detectionBioinformatics, 2006
- MAVisto: a tool for the exploration of network motifsBioinformatics, 2005
- Evidence for dynamically organized modularity in the yeast protein–protein interaction networkNature, 2004
- Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifsBioinformatics, 2004
- An automated method for finding molecular complexes in large protein interaction networksBMC Bioinformatics, 2003
- Specificity and Stability in Topology of Protein NetworksScience, 2002