Your browser does not support JavaScript!

Building blocks of biological networks: a review on major network motif discovery algorithms

Building blocks of biological networks: a review on major network motif discovery algorithms

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Systems Biology — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In recent years, there has been a great interest in studying different aspects of complex networks in a range of fields. One important local property of networks is network motifs, recurrent and statistically significant sub-graphs or patterns, which assists researchers in the identification of functional units in the networks. Although network motifs may provide a deep insight into the network's functional abilities, their detection is computationally challenging. Therefore several algorithms have been introduced to resolve this computationally hard problem. These algorithms can be classified under various paradigms such as exact counting methods, sampling methods, pattern growth methods and so on. Here, the authors will give a review on computational aspects of major algorithms and enumerate their related benefits and drawbacks from an algorithmic perspective.


    1. 1)
      • Grochow, J.A., Kellis, M.: `Network motif discovery using sub-graph enumeration and symmetry-breaking', RECOMB, 2007, p. 92–106.
    2. 2)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
      • Ribeiro, P., Silva, F.: `-tries: an efficient data structure for discovering network motifs', ACM, 2010.
    7. 7)
      • S. Bornholdt , H.G. Schuster . (2003) Handbook of graphs and networks: from the genome to the Internet.
    8. 8)
    9. 9)
    10. 10)
    11. 11)
      • Huan, J., Wang, W., Prins, J.: `SPIN: mining maximal frequent sub-graphs from graph databases', Proc. Tenth ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, 2004, p. 581–586.
    12. 12)
    13. 13)
    14. 14)
    15. 15)
    16. 16)
    17. 17)
      • H. Schwöbbermeyer , B.H. Junker , F.H. Schreiber . (2008) Network motifs, Analysis of biological networks.
    18. 18)
      • B.D. McKay . Practical graph isomorphism. Congr. Numer. , 45 - 87
    19. 19)
    20. 20)
      • F. Harary . (1969) Graph theory.
    21. 21)
    22. 22)
    23. 23)
    24. 24)
    25. 25)
    26. 26)
      • Grochow, J.A.: `Massachusetts institute of technology. dept. of electrical engineering and computer science.: on the structure and evolution of protein interaction networks', 2006, MEng, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science.
    27. 27)
    28. 28)
    29. 29)
      • Chen, J., Hsu, W., Li Lee, M.: `NeMoFinder: dissecting genome-wide protein–protein interactions with meso-scale network motifs', Proc. 12th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining 2006;, 2006, Philadelphia, PA, USA, p. 106–115.
    30. 30)
    31. 31)
    32. 32)
      • U. Alon . (2006) An introduction to systems biology: design principles of biological circuits.
    33. 33)

Related content

This is a required field
Please enter a valid email address