Table of Contents Author Guidelines Submit a Manuscript
Scientific Programming
Volume 2015 (2015), Article ID 901321, 11 pages
http://dx.doi.org/10.1155/2015/901321
Research Article

Fast Parallel All-Subgraph Enumeration Using Multicore Machines

Computer Engineering Department, Tarbiat Modares University (TMU), Tehran 14115-111, Iran

Received 28 January 2014; Revised 21 November 2014; Accepted 21 November 2014

Academic Editor: Przemyslaw Kazienko

Copyright © 2015 Saeed Shahrivari and Saeed Jalili. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  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, no. 5594, pp. 824–827, 2002. View at Publisher · View at Google Scholar · View at Scopus
  2. P. Ribeiro and F. Silva, “g-tries: an efficient data structure for discovering network motifs,” in Proceedings of the ACM Symposium on Applied Computing (SAC '10), pp. 1559–1566, 2010. View at Publisher · View at Google Scholar
  3. Z. R. M. Kashani, H. Ahrabian, E. Elahi et al., “Kavosh: a new algorithm for finding network motifs,” BMC Bioinformatics, vol. 10, no. 1, article 318, 2009. View at Publisher · View at Google Scholar · View at Scopus
  4. S. Wernicke and F. Rasche, “FANMOD: a tool for fast network motif detection,” Bioinformatics, vol. 22, no. 9, pp. 1152–1153, 2006. View at Publisher · View at Google Scholar · View at Scopus
  5. J. Grochow and M. Kellis, “Network motif discovery using subgraph enumeration and symmetry-breaking,” in Research in Computational Molecular Biology, T. Speed and H. Huang, Eds., vol. 4453 of Lecture Notes in Computer Science, pp. 92–106, Springer, Berlin, Germany, 2007. View at Google Scholar
  6. F. Harary and E. Palmer, “The enumeration methods of Redfield,” American Journal of Mathematics, vol. 89, no. 2, pp. 373–384, 1967. View at Publisher · View at Google Scholar · View at MathSciNet
  7. D. S. Johnson, “The NP-completeness column,” ACM Transactions on Algorithms, vol. 1, no. 1, pp. 160–176, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  8. P. Ribeiro, F. Silva, and L. Lopes, “Parallel discovery of network motifs,” Journal of Parallel and Distributed Computing, vol. 72, no. 2, pp. 144–154, 2012. View at Publisher · View at Google Scholar · View at Scopus
  9. Z. Zhao, M. Khan, V. S. A. Kumar, and M. V. Marathe, “Subgraph enumeration in large social contact networks using parallel color coding and streaming,” in Proceedings of the 39th International Conference on Parallel Processing (ICPP '10), vol. 10, pp. 594–603, September 2010. View at Publisher · View at Google Scholar · View at Scopus
  10. F. Schreiber and H. Schwbbermeyer, “Towards motif detection in networks: frequency concepts and fiexible search,” in Proceedings of the International Workshop on Network Tools and Applications in Biology, pp. 91–102, 2004.
  11. M. Kiyomi, Studies on subgraph and supergraph enumeration algorithms [Ph.D. thesis], The Graduate University for Advanced Studies, 2006.
  12. P. Ribeiro, Efficient and scalable algorithms for network motifs discovery [Ph.D. thesis], Porto University, 2011.
  13. A. Masoudi-Nejad, F. Schreiber, and Z. R. M. Kashani, “Building blocks of biological networks: a review on major network motif discovery algorithms,” IET Systems Biology, vol. 6, no. 5, pp. 164–174, 2012. View at Publisher · View at Google Scholar · View at Scopus
  14. S. Wernicke, “Efficient detection of network motifs,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 3, no. 4, pp. 347–359, 2006. View at Publisher · View at Google Scholar · View at Scopus
  15. E. Wong, B. Baur, S. Quader, and C.-H. Huang, “Biological network motif detection: principles and practice,” Briefings in Bioinformatics, vol. 13, no. 2, pp. 202–215, 2012. View at Publisher · View at Google Scholar · View at Scopus
  16. P. Ribeiro and F. Silva, “G-tries: a data structure for storing and finding subgraphs,” Data Mining and Knowledge Discovery, vol. 28, no. 2, pp. 337–377, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. P. Paredes and P. Ribeiro, “Towards a faster network-centric subgraph census,” in Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM '13), pp. 264–271, IEEE, August 2013. View at Publisher · View at Google Scholar · View at Scopus
  18. 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, Article ID e50093, 2012. View at Publisher · View at Google Scholar · View at Scopus
  19. S. Khakabimamaghani, I. Sharafuddin, N. Dichter, I. Koch, and A. Masoudi-Nejad, “QuateXelero: an accelerated exact network motif detection algorithm,” PLoS ONE, vol. 8, no. 7, Article ID e68073, 2013. View at Publisher · View at Google Scholar · View at Scopus
  20. W. Tie, J. W. Touchman, Z. Weiyi, E. B. Suh, and X. Guoliang, “A parallel algorithm for extracting transcriptional regulatory network motifs,” in Proceedings of the 5th IEEE Symposium on Bioinformatics and Bioengineering (BIBE '05), pp. 193–200, October 2005. View at Publisher · View at Google Scholar · View at Scopus
  21. M. Schatz, E. Cooper-Balis, and A. Bazinet, Parallel Network Motif Finding, 2008.
  22. P. Ribeiro, F. Silva, and L. Lopes, “Efficient parallel subgraph counting using G-tries,” in Proceedings of the IEEE International Conference on Cluster Computing (CLUSTER), pp. 217–226, 2010.
  23. J. Dean and S. Ghemawat, “MapReduce: a flexible data processing tool,” Communications of the ACM, vol. 53, no. 1, pp. 72–77, 2010. View at Publisher · View at Google Scholar · View at Scopus
  24. T. White, Hadoop: The Definitive Guide, Yahoo Press, 2012.
  25. Z. Zhao, G. Wang, A. R. Butt, M. Khan, V. S. A. Kumar, and M. V. Marathe, “SAHAD: subgraph analysis in massive networks using Hadoop,” in Proceedings of the IEEE 26th International Parallel and Distributed Processing Symposium (IPDPS '12), pp. 390–401, Shanghai, China, May 2012. View at Publisher · View at Google Scholar · View at Scopus
  26. Z. Zhao, “Subgraph querying in relational networks: a mapreduce approach,” in Proceedings of the IEEE 26th International Parallel and Distributed Processing Symposium Workshops (IPDPSW '12), pp. 2502–2505, May 2012. View at Publisher · View at Google Scholar · View at Scopus
  27. J. Cohen, “Graph twiddling in a MapReduce world,” Computing in Science and Engineering, vol. 11, no. 4, Article ID 5076317, pp. 29–41, 2009. View at Publisher · View at Google Scholar · View at Scopus
  28. B. Wu and Y. Bai, “An efficient distributed subgraph mining algorithm in extreme large graphs,” in Artificial Intelligence and Computational Intelligence, vol. 6319 of Lecture Notes in Computer Science, pp. 107–115, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar
  29. F. N. Afrati, D. Fotakis, and J. D. Ullman, “Enumerating subgraph instances using map-reduce,” in Proceedings of the 29th International Conference on Data Engineering (ICDE '13), pp. 62–73, April 2013. View at Publisher · View at Google Scholar · View at Scopus
  30. A. G. Rudi, S. Shahrivari, S. Jalili, and Z. R. M. Kashani, “RANGI: a fast list-colored graph motif finding algorithm,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 10, no. 2, pp. 504–513, 2013. View at Publisher · View at Google Scholar · View at Scopus
  31. G. Blin, F. Sikora, and S. Vialette, “GraMoFoNe: a cytoscape plugin for querying motifs without topology in protein-protein interactions networks,” in Proceedings of the 2nd International Conference on Bioinformatics and Computational Biology (BICoB '10), pp. 38–43, March 2010. View at Scopus
  32. G. Blin, Combinatorial objects in bio-algorithmics: related problems and complexities [Ph.D. thesis], Université Paris-Est, 2012.
  33. L. Babai and E. M. Luks, “Canonical labeling of graphs,” in Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pp. 171–183, 1983.
  34. B. D. McKay, “Practical graph isomorphism,” Congressus Numerantium, vol. 30, pp. 45–87, 1981. View at Google Scholar
  35. T. Junttila and P. Kaski, “Engineering an efficient canonical labeling tool for large and sparse graphs,” in Proceedings of the 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics, pp. 135–149, January 2007. View at Scopus
  36. H. Katebi, K. Sakallah, and I. Markov, “Conflict anticipation in the search for graph automorphisms,” in Logic for Programming, Artificial Intelligence, and Reasoning, N. Bjørner and A. Voronkov, Eds., vol. 7180 of Lecture Notes in Computer Science, pp. 243–257, Springer, Berlin, Germany, 2012. View at Publisher · View at Google Scholar
  37. 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. View at Publisher · View at Google Scholar · View at Scopus
  38. M. G. Pablo and L. Danon, “Community structure in jazz,” Advances in Complex Systems, vol. 6, no. 4, pp. 565–573, 2003. View at Publisher · View at Google Scholar
  39. J. Stehlé, N. Voirin, A. Barrat et al., “High-resolution measurements of face-to-face contact patterns in a primary school,” PLoS ONE, vol. 6, no. 8, Article ID e23176, 2011. View at Publisher · View at Google Scholar · View at Scopus
  40. A.-C. Gavin, P. Aloy, P. Grandi et al., “Proteome survey reveals modularity of the yeast cell machinery,” Nature, vol. 440, no. 7084, pp. 631–636, 2006. View at Publisher · View at Google Scholar · View at Scopus
  41. J. Leskovec, J. Kleinberg, and C. Faloutsos, “Graph evolution: densification and shrinking diameters,” ACM Transactions on Knowledge Discovery from Data, vol. 1, no. 1, article 2, 2007. View at Publisher · View at Google Scholar · View at Scopus
  42. J. Leskovec, D. Huttenlocher, and J. Kleinberg, “Predicting positive and negative links in online social networks,” in Proceedings of the 19th International World Wide Web Conference (WWW '10), pp. 641–650, April 2010. View at Publisher · View at Google Scholar · View at Scopus
  43. J. Leskovec and J. McAuley, “Learning to discover social circles in ego networks,” in Proceedings of the 26th Annual Conference on Neural Information Processing Systems (NIPS '12), pp. 539–547, December 2012. View at Scopus
  44. R. Albert, H. Jeong, and A.-L. Barabási, “Internet: diameter of the World-Wide Web,” Nature, vol. 401, no. 6749, pp. 130–131, 1999. View at Publisher · View at Google Scholar · View at Scopus