acc-Motif: Accelerated network motif detection

IEEE/ACM Transactions on Computational Biology and Bioinformatics

Volumn 11, Issue 5, 2014, Pages 853-862

  Meira, Luis A A ^a   Máximo, Vinícius R ^b   Fazenda, Álvaro L ^b   Da Conceiҫão, Arlindo F ^b  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b FEDERAL UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Algorithm analysis; Network motifs; Subgraph counting

Indexed keywords

DIRECTED GRAPHS;

ALGORITHM ANALYSIS; BASIC BUILDING BLOCK; COMPUTATIONAL EXPERIMENT; GENE REGULATION NETWORK; INDUCED SUBGRAPHS; MOTIF DETECTIONS; NETWORK MOTIF; SUBGRAPHS;

COMPUTATIONAL COMPLEXITY;

ALGORITHM; BIOLOGY; GENE REGULATORY NETWORK; PROCEDURES;

ALGORITHMS; COMPUTATIONAL BIOLOGY; GENE REGULATORY NETWORKS;

EID: 84907962465     PISSN: 15455963     EISSN: 15579964     Source Type: Journal    
DOI: 10.1109/TCBB.2014.2321150     Document Type: Article

References (31)

1. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon, "Network motifs: Simple building blocks of complex networks," Science, vol. 298, pp. 824-887, 2002.
2. J. Kim and T. Wilhelm, (2008). What is a complex graph.Physica A: Statist. Mech. Appl. [Online]. 387(11), pp. 2637-2652. Available: http://www.sciencedirect.com/science/article/pii/S0378437108000319
3. K.-H. Yang, K.-Y. Chiou, H.-M. Lee, and J.-M. Ho. (2006). "Web appearance disambiguation of personal names based on network motif." in Proc. IEEE/WIC/ACM Int. Conf. Web Intell., pp. 386-389. [Online]. Available: http://dx.doi.org/10.1109/WI.2006.189
4. E. G. Allan, Jr., W. H. Turkett, Jr., and E. W. Fulp (2009). "Using network motifs to identify application protocols." in Proc. 28th IEEE Conf. Global Telecommun., pp. 4266-4272. [Online]. Available: http://portal.acm.org/citation.cfm?id=1811982.1812090
5. M. M. Babu, N. M. Luscombe, L. Aravind, M. Gerstein, and S. A. Teichmann, (2001). "Structure and evolution of transcriptional regulatory networks." Current Opinion Struct. Biol. [Online]. 14(3), pp. 283-291. Available: http://www.sciencedirect.com/science/article/pii/S0959440X04000788
6. G. C. Conant and A. Wagner, (2003, Jul.). Convergent evolution of gene circuits. Nature Genetics [Online]. 34(3), pp. 264-266. Available: http://dx.doi.org/10.1038/ng1181
7. N. Kashtan, S. Itzkovitz, R. Milo, and U. Alon, "Network motif detection tool: Mfinder tool guide," Dept. Molecular Cell Biol. Comput. Sci. Appl. Math., Weizman Inst. Sci., Rehovot, Israel, Tech. Rep., 2005.
8. N. Kashtan, S. Itzkovitz, R. Milo, and U. Alon, (2004, Jul.). Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics, [Online]. 20(11), pp. 1746-1758. Available: http://dx.doi.org/10.1093/bioinformatics/bth163
9. J. Chen, W. Hsu, M. L. Lee, and S.-K. Ng. (2006). "Nemofinder: Dissecting genome-wide protein-protein interactions with mesoscale network motifs," in Proc. 12th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, pp. 106-115. [Online]. Available: http://doi.acm.org/10.1145/1150402.1150418.
10. S. Wernicke and F. Rasche, "Fanmod: A tool for fast network motif detection," Bioinformatics, vol. 22, no. 9, pp. 1152-1153, 2006.
11. J. A. Grochow and M. Kellis. (2007). "Network motif discovery using subgraph enumeration and symmetry-breaking," in Proc. 11th Annu. Int. Conf. Res. Comput. Molecular Biol., pp. 92-106. [Online]. Available: http://dl.acm.org/citation.cfm?id=1758222.1758229.
12. S. Omidi, F. Schreiber, and A. Masoudi-Nejad, "MODA: An efficient algorithm for network motif discovery in biological networks," Genes Genetics Syst., vol. 84, pp. 385-395, 2009.
13. Z. Kashani, H. Ahrabian, E. Elahi, A. Nowzari-Dalini, E. Ansari, S. Asadi, S. Mohammadi, F. Schreiber, and A. Masoudi-Nejad, "Kavosh: A new algorithm for finding network motifs," BMC Bioinformat., vol. 10, no. 1, p. 318, 2009.
14. F. Schreiber and H. Schwöbbermeyer, "Mavisto: A tool for the exploration of network motifs," Bioinformatics, vol. 21, no. 17, pp. 3572-3574, 2005.
15. G. Ciriello and C. Guerra, "A review on models and algorithms for motif discovery in protein-protein interaction networks," Briefings Functional Genomics Proteomics, vol. 7, no. 2, pp. 147-156, 2008.
16. P. Ribeiro, F. Silva, and M. Kaiser. (2009). Strategies for network motifs discovery. in Proc. 5th IEEE Int. Conf. E-Sci., pp. 80-87. [Online]. Available: http://dx.doi.org/10.1109/e-Science.2009.20
17. E. Wong, B. Baur, S. Quader, and C.-H. Huang, "Biological network motif detection: Principles and practice," Brief Bioinformat., vol. 13, pp. 202-215, 2011.
18. D. Marcus and Y. Shavitt. (2010). "Efficient counting of network motifs," in. Proc. IEEE 30th Int. Conf. Distrib. Comput. Syst. Workshops, pp. 92-98. [Online]. Available: http://dx.doi.org/10.1109/ICDCSW.2010.41
19. D. Marcus and Y. Shavitt, "Rage - A rapid graphlet enumerator for large networks," Comput. Netw.: Int. J. Comput. Telecommun. Netw., vol. 56, pp. 810-819, Mar. 2012.
20. L. A. A. Meira, V. R. Máximo, Á. L. Fazenda, and A. F. da Conceic¸ão, "acc-Motif Detection Tool," CoRR, vol. abs/1203.3415, no. version 2, May 2012.
21. X. Li, D.S. Stones, H. Wang, H. Deng, X. Liu, and G. Wang, "Netmode: Network motif detection without nauty," PloS One, vol. 7, no. 12, p. e50093, 2012.
22. M. C. Lin, F. J. Soulignac, and J. L. Szwarcfiter, (2012). Arboricity, h-index, and dynamic algorithms. Theoretical Comput. Sci. [Online]. 426-427, pp. 75-90. Available: http://www.sciencedirect.com/science/article/pii/S0304397511009662
23. N. Pržulj, D. G. Corneil, and I. Jurisica, "Modeling interactome: Scale-free or geometric?" Bioinformatics, vol. 20, no. 18, pp. 3508-3515, 2004.
24. T. Milenkovic and N. Przulj. (2008, Jan.). "Uncovering biological network function via graphlet degree signatures.," arXiv, q-bio. MN. [Online]. Available: http://arxiv.org/abs/0802.0556v1
25. L. A. A. Meira, V. R. Máximo, Álvaro L. Fazenda, and A. F. da Conceic¸ão, "A new approach to count pattern motifs using combinatorial techniches," in Proc. 8th Int. Conf. Signal Image Tech. - Workshop Complex Netw., Nov. 2012, pp. 744-753.
26. S. Wernicke and F. Rasche., "Fanmod: A tool for fast network motif detection," Bioinformatics, vol. 22, pp. 1152-1153, 2006.
27. E. W. Weisstein, "Weakly connected digraph," From MathWorld-AWolfram Web Resource. (2014, Jun.). [Online]. Available: http://mathworld.wolfram.com/WeaklyConnectedDigraph.html
28. N. Chiba and T. Nishizeki, (1985, Feb). Arboricity and subgraph listing algorithms. SIAM J. Comput. [Online]. 14(1), pp. 210-223. Available: http://dx.doi.org/10.1137/0214017
29. U. Alon, (2012).,"Molecular cell biology lab: Data set" [Online]. Available: http://www.weizmann.ac.il/mcb/UriAlon/groupNetworksData.html
30. V. Batagelj and A. Mrvar, Pajek data sets. (2005) [Online]. Available: http://vlado.fmf.uni-lj.si/pub/networks/data/
31. T. Opsahl, (2012). Data sets tore opsahl. [Online]. Available: http://toreopsahl.com/datasets/#usairports