MODA: An efficient algorithm for network motif discovery in biological networks

Genes and Genetic Systems

Volumn 84, Issue 5, 2009, Pages 385-395

  Omidi, Saeed ^a   Schreiber, Falk ^b,c   Masoudi Nejad, Ali ^a  

^a UNIVERSITY OF TEHRAN   (Iran)

^b MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

^c LEIBNIZ INSTITUTE OF PLANT GENETICS AND CROP PLANT RESEARCH IPK   (Germany)

Author keywords

Induced and non induced subgraphs; Network motifs; Pattern growth approach; Real world complex networks; Subgraph isomorphism; Subgraph sampling

Indexed keywords

ALGORITHM; ARTICLE; BIOINFORMATICS; BIOLOGY; COMPUTER; INTERNET; MATHEMATICAL ANALYSIS; NETWORK LEARNING; TECHNIQUE;

ALGORITHMS; AMINO ACID MOTIFS; COMPUTATIONAL BIOLOGY; PATTERN RECOGNITION, AUTOMATED; PROTEIN INTERACTION MAPPING; SOFTWARE;

EID: 76749118079     PISSN: 13417568     EISSN: None     Source Type: Journal    
DOI: 10.1266/ggs.84.385     Document Type: Article

References (38)

1. Agrawal, R., and Srikant, R. (1994) Fast Algorithms for Mining Association Rules in Large Databases. In: Proceedings of 20th International Conference on Very Large Data Bases (VLDB'94), pp. 487- 499. Morgan Kaufmann, Santiago de Chile, Chile.
2. Alon, U. (2007) Network motifs: theory and experimental approaches. Nature Review Genetics 8, 450-461.
3. Amaral, L. A., Scala, A., Barthelemy, M., and Stanley, H. E. (2000) Classes of small-world networks. Proc. Natl. Acad. Sci. USA 97, 11149-11152.
4. Barabási, A. L., and Albert, R. (1999) Emergence of scaling in random networks. Science 286, 509-512.
5. Baskerville, K., and Paczuski, M. (2006) Subgraph Ensembles and Motif Discovery Using a New Heuristic for Graph Isomorphism. Phys. Rev. E. Stat. Nonlin. Soft Matter Phys. 74, 051903.
6. Bornholdt, S. S., and Schuster, H. G. (2003) Handbook of Graphs and Networks: From the Genome to the Internet. Wiley-VCH, Weinheim.
7. Chen, J., Hsu, W., Lee, M.-L., and Ng, S. K. (2006) NeMoFinder: dissecting genome-wide protein-protein interactions with meso-scale network motifs. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'06), pp. 106-115. ACM SIGKDD, Philadelphia.
8. Ciriello, G., and Guerra, C. (2008) A review on models and algorithms for motif discovery in protein-protein interaction networks. Brief. in Func. Genomics and Proteomic 7, 147-156.
9. Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. (2004) Introduction to Algorithms. MIT Press, Massachusetts.
10. Diestel, R. (2005) Graph theory. Springer-Verlag, Heidelberg.
11. Dunne, J. A., Williams, R. J., and Martinez, N. D. (2002) Foodweb structure and network theory: The role of connectance and size. Proc. Natl. Acad. Sci. USA 99, 12917-12922.
12. Erdös, P., and Rényi, A. (1960) The Evolution of Random Graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl. 5, 17-61.
13. Faloutsos, M., Faloutsos, P., and Faloutsos, C. (1999) On powerlaw relationships of the internet topology. In: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM'99), pp. 251-262. ACM SIGCOMM , Massachusetts.
14. Garey, M. R., and Johnson, D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York.
15. Grochow, J. A., and Kellis, M. (2007) Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking. In: Proceedings of International Conference on Research in Computational Molecular Biology (RECOMB' 07), pp. 92-106. Springer-Verlag, Heidelberg.
16. Huan, J., Wang, W., and Prins, J. (2004) SPIN: mining maximal frequent subgraphs from graph databases. In: Proceedings of the tenth SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'04), pp. 581-586. ACM SIGKDD, Seattle.
17. Inokuchi, A., Washio, T., and Motoda, H. (2000) An Aprioribased algorithm for mining frequent substructures from graphs. In: Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD), pp. 13-23. Lyon, France.
18. Itzkovitz, S., Milo, R., Kashtan, N., Ziv, G., and Alon, U. (2003) Subgraphs in random networks. Phys. Rev. E 68, 026127.
19. Junker, B. H., and Schreiber, F. (2008) Analysis of biological networks. Wiley Series on Bioinformatics, Computational Techniques and Engineering. Wiley-VCH, Weinheim.
20. Kanehisa, M., Araki, M., Goto, S., Hattori, M., Hirakawa, M., Itoh, M., Katayama, T., Kawashima, S., Okuda, S., and Tokimatsu, T., et al. (2008) KEGG for linking genomes to life and the environment. Nucleic Acids Res. 36, 480-484.
21. Kashtan, N., Itzkovitz, S., Milo, R., and Alon, U. (2004) Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 20, 1746-1758.
22. Kuramochi, M., and Karypis, G. (2004) An efficient algorithm for discovering frequent subgraphs. IEEE Transactions on Knowledge and Data Engineering (TKDE), 1038-1051.
23. Mangan, S., and Alon, U. (2003) Structure and function of the feed-forward loop network motif. Proc. Natl. Acad. Sci. USA 100, 11980-11985.
24. Masoudi-Nejad, A., Goto, S., Jauregui, R., Ito, M., Kawashima, S., Moriya, Y., Endo, T., and Kanehisa, M. (2007) EGENES: transcriptome-based plant database of genes with metabolic pathway information and expressed sequence tag indices in KEGG. Plant Physiol. 44, 857-866.
25. Middendorf, M., Ziv, E., and Wiggins, C. H. (2005) Inferring network mechanisms: the Drosophila melanogaster protein interaction network. Proc. Natl. Acad. Sci. USA 102, 3192-3197.
26. Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., and Alon, U. (2002) Network motifs: Simple building blocks of complex networks. Science 298, 824-827.
27. Ouzounis, C. A., and Karp, D. P. (2000) Global properties of the metabolic map of Escherichia coli. Genome Res. 10, 568-576.
28. Papadimitriou, C. H. (1994) Computational complexity. pp. 439-447. Addison-Wesley, Massachusetts.
29. Przytycka, T. M. (2006) An important connection between network motifs and parsimony models. Lecture Notes in Computational Biology, pp. 321-335. Springer-Verlag, Heidelberg.
30. Razaghi Moghadam Kashani, Z., Ahrabian, H., Elahi, E., Nowzari-Dalini, A., Saberi Ansari, E., Asadi, S., Mohammadi, S., Schreiber, F., and Masoudi-Nejad, A. (2009) Kavosh: a new algorithm for finding network motifs. BMC Bioinformatics 10, 318.
31. Schreiber, F., and Schwöbbermeyer, H. (2005a) MAVisto: a tool for the exploration of network motifs. Bioinformatics 21, 3572-3574.
32. Schreiber, F., and Schwöbbermeyer, H. (2005b) Frequency concepts and pattern detection for the analysis of motifs in networks. In: Transactions on Computational Systems Biology III, pp. 89-104. Springer-Verlag, Heidelberg.
33. Shen-Orr, S., Milo, R., Mangan, S., and Alon, U. (2002) Network motifs in the transcriptional regulation network of Escherichia coli. Nature Genetics 31, 64-68.
34. Tsang, J., Zhu, J., and van Oudenaarden, A. (2007) MicroRNAmediated feedback and feedforward loops are recurrent network motifs in mammals. Mol. Cell 26, 753-767.
35. Vázquez, A. (2002) Degree correlations and clustering hierachy in networks: measures, origin and consequences. PhD Dissertation, La Scuola Internazionale Superiore di Studi Avanzati / International School for Advanced Studies, Trieste, Italy.
36. Vázquez, A., Dobrin, R., Sergi, D., Eckmann, J. P., Oltvai, Z. N., and Barabási, A. L. (2004) The topological relationship between the large-scale attributes and local interaction patterns of complex networks. Proc. Natl. Acad. Sci. USA 101, 17940-17945.
37. Watts, D. J., and Strogatz, S. H. (1998) Collective dynamics of 'small world' networks. Nature 393, 409-410.
38. Wernicke, S. (2006) Efficient detection of network motifs. IEEE/ACM Trans. Computational Biology and Bioinformatics 3, 347-359.