This Article 
 Bibliographic References 
 Add to: 
Efficient Detection of Network Motifs
October-December 2006 (vol. 3 no. 4)
pp. 347-359
Motifs in a given network are small connected subnetworks that occur in significantly higher frequencies than would be expected in random networks. They have recently gathered much attention as a concept to uncover structural design principles of complex networks. Kashtan et al. [Bioinformatics, 2004] proposed a sampling algorithm for performing the computationally challenging task of detecting network motifs. However, among other drawbacks, this algorithm suffers from a sampling bias and scales poorly with increasing subgraph size. Based on a detailed analysis of the previous algorithm, we present a new algorithm for network motif detection which overcomes these drawbacks. Furthermore, we present an efficient new approach for estimating the frequency of subgraphs in random networks that, in contrast to previous approaches, does not require the explicit generation of random networks. Experiments on a testbed of biological networks show our new algorithms to be orders of magnitude faster than previous approaches, allowing for the detection of larger motifs in bigger networks than previously possible and thus facilitating deeper insight into the field.

[1] I. Albert and R. Albert, “Conserved Network Motifs Allow Protein-Protein Interaction Prediction,” Bioinformatics, vol. 20, no. 18, pp. 3346-3352, 2004.
[2] N. Alon, R. Yuster, and U. Zwick, “Finding and Counting Given Length Cycles,” Algorithmica, vol. 17, no. 3, pp. 209-223, 1997.
[3] L.A.N. Amaral, A. Scala, M. Barthélémy, and H.E. Stanley, “Classes of Small-World Networks,” Proc. Nat'l Academy of Sciences, vol. 97, no. 21, pp. 11149-11152, 2000.
[4] Y. Artzy-Randrup, S.J. Fleishman, N. Ben-Tal, and L. Stone, “Comment on 'Network Motifs: Simple Building Blocks of Complex Networks' and 'Superfamilies of Designed and Evolved Networks',” Science, vol. 305, no. 5687, p. 1007c, 2004.
[5] A.L. Barabási and R. Albert, “Emergence of Scaling in Random Networks,” Science, vol. 286, no. 5439, pp. 509-512, 1999.
[6] E.A. Bender, “The Asymptotic Number of Non-Negative Matrices with Given Row and Column Sums,” Discrete Math., vol. 10, no. 2, pp. 217-223, 1974.
[7] E.A. Bender and E.R. Canfield, “The Asymptotic Number of Labeled Graphs with Given Degree Sequences,” J. Combinatorial Theory Series A, vol. 24, no. 3, pp. 296-307, 1978.
[8] J. Berg and M. Lässig, “Local Graph Alignment and Motif Search in Biological Networks,” Proc. Nat'l Academy of Sciences, vol. 101, no. 41, pp. 14689-14694, 2004.
[9] D.A. Berque, M.K. Goldberg, and J.A. Edmonds, “Implementing Progress Indicators for Recursive Algorithms,” Proc. Fifth ACM-SIGAPP Symp. Applied Computing (SAC '93), pp. 533-538, 1993.
[10] R.A. Duke, H. Lefmann, and V. Rödl, “A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph,” SIAM J. Computing, vol. 24, no. 3, pp. 598-620, 1995.
[11] R.L. Graham, D.E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, second ed. Addison-Wesley, 1994.
[12] S. Itzkovitz et al., “Coarse-Graining and Self-Dissimilarity of Complex Networks,” Physical Rev. E, vol. 71, p. 016127, 2005.
[13] S. Itzkovitz et al., “Subgraphs in Random Networks,” Physical Rev. E, vol. 68, p. 026127, 2003.
[14] S. Kalir et al., “Ordering Genes in a Flagella Pathway by Analysis of Expression Kinetics from Living Bacteria,” Science, vol. 292, no. 5524, pp. 2080-2083, 2001.
[15] N. Kashtan, S. Itzkovitz, R. Milo, and U. Alon, “Efficient Sampling Algorithm for Estimating Subgraph Concentrations and Detecting Network Motifs,” Bioinformatics, vol. 20, no. 11, pp. 1746-1758, 2004.
[16] D.E. Knuth, “Estimating the Efficiency of Backtrack Programs,” Selected Papers on Analysis of Algorithms, Stanford Junior Univ., Palo Alto, Calif., 2000.
[17] M. Koyutürk, A. Grama, and and W. Szpankowski, “An Efficient Algorithm for Detecting Frequent Subgraphs in Biological Networks,” Bioinformatics, vol. 20, no. supplement 1, pp. i200-i207, 2004.
[18] T.I. Lee et al., “Transcriptional Regulatory Networks in Saccharomyces Cerevisiae,” Science, vol. 298, no. 5594, pp. 799-804, 2002.
[19] S. Li et al., “A Map of the Interactome Network of the Metazoan C. Elegans,” Science, vol. 303, no. 5657, pp. 540-543, 2004.
[20] B.D. McKay, “Practical Graph Isomorphism,” Congressus Numerantium, vol. 30, pp. 45-87, 1981.
[21] B.D. McKay, “Nauty User's Guide (Version 1.5),” Technical Report TR-CS-90-02, Dept. of Computer Science, Australian Nat'l Univ., 1990.
[22] R. Milo et al., “Response to Comment on 'Network Motifs: Simple Building Blocks of Complex Networks' and 'Superfamilies of Designed and Evolved Networks',” Science, vol. 305, no. 5687, p.1007d, 2004.
[23] R. Milo et al., “Superfamilies of Designed and Evolved Networks,” Science, vol. 303, no. 5663, pp. 1538-1542, 2004.
[24] R. Milo et al., “Network Motifs: Simple Building Blocks of Complex Networks,” Science, vol. 298, no. 5594, pp. 824-827, 2002.
[25] M.E.J. Newman, S.H. Strogatz, and D.J. Watts, “Random Graphs with Arbitrary Degree Distributions and Their Applications,” Physical Rev. E, vol. 64, p. 026118, 2001.
[26] S. Ott, A. Hansen, S. Kim, and S. Miyano, “Superiority of Network Motifs over Optimal Networks and an Application to the Revelation of Gene Network Evolution,” Bioinformatics, vol. 21, no. 2, pp. 227-238, 2005.
[27] M. Ronen, R. Rosenberg, B.I. Shraiman, and U. Alon, “Assigning Numbers to the Arrows: Parameterizing a Gene Regulation Network by Using Accurate Expression Kinetics,” Proc. Nat'l Academy of Sciences, vol. 99, no. 16, pp. 10555-10560, 2002.
[28] S.S. Shen-Orr, R. Milo, S. Mangan, and U. Alon, “Network Motifs in the Transcriptional Regulation Network of Escherichia Coli,” Nature Genetics, vol. 31, no. 1, pp. 64-68, 2002.
[29] E. Szemerédi, “Regular Partitions of Graphs,” Problèmes Combinatoires et Théorie des Graphes, no. 260 in Colloques internationaux CNRS, pp. 399-401, 1976.
[30] A. Vázquez et al., “The Topological Relationship between the Large-Scale Attributes and Local Interaction Patterns of Complex Networks,” Proc. Nat'l Academy of Sciences, vol. 101, no. 52, pp.17940-17945, 2004.
[31] A. Vespignani, “Evolution Thinks Modular,” Nature Genetics, vol. 35, no. 2, pp. 118-119, 2003.
[32] D.J. Watts, Small Worlds: The Dynamics of Networks between Order and Randomness. Princeton Univ. Press, 1999.
[33] S. Wernicke and F. Rasche, “FANMOD: A Tool for Fast Network Motif Detection,” Bioinformatics, vol. 22, no. 9, pp. 1152-1153, 2006.
[34] H.S. Wilf, Generatingfunctionology, second ed. Academic Press, 1994.
[35] R.J. Williams and N.D. Martinez, “Simple Rules Yield Complex Food Webs,” Nature, vol. 404, no. 6774, pp. 180-183, 2000.
[36] S.H. Yook, Z.N. Oltvai, and A.L. Barabási, “Functional and Topological Characterization of Protein Interaction Networks,” Proteomics, vol. 4, no. 4, pp. 928-942, 2004.

Index Terms:
Network motif detection algorithm, subgraph enumeration, subgraph sampling, subgraph concentration in random graphs.
Sebastian Wernicke, "Efficient Detection of Network Motifs," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 3, no. 4, pp. 347-359, Oct.-Dec. 2006, doi:10.1109/TCBB.2006.51
Usage of this product signifies your acceptance of the Terms of Use.