Querying subgraph sets with G-tries

Proceedings of the 2nd ACM SIGMOD Workshop on Databases and Social Networks, DBSocial 2012

Volumn , Issue , 2012, Pages 25-30

  Ribeiro, Pedro ^a   Silva, Fernando ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

G tries; Graph mining; Network motifs; Subgraphs

Indexed keywords

CANONICAL FORM; G-TRIES; GRAPH MINING; NETWORK MOTIF; SOCIAL NETWORKS; SUBGRAPHS; SYMMETRY-BREAKING; TOPOLOGICAL INFORMATION;

DATA STRUCTURES;

SOCIAL NETWORKING (ONLINE);

EID: 84864064983     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2304536.2304541     Document Type: Conference Paper

References (26)

1. V. Batagelj and A. Mrvar. Pajek datasets. 2006. http://vlado.fmf.uni-lj. si/pub/networks/data/.
2. V. Bonnici, A. Ferro, R. Giugno, A. Pulvirenti, and D. Shasha. Enhancing graph database indexing by suffix tree structure. In 5th IAPR Int. Conference on Pattern Recognition in Bioinformatics (PRIB), pages 195-203, Berlin, 2010. Springer.
3. D. Chakrabarti and C. Faloutsos. Graph mining: Laws, generators, and algorithms. ACM Computing Surveys, 38:1, 2006.
4. H. Cheng, D. Lo, Y. Zhou, X. Wang, and X. Yan. Identifying bug signatures using discriminative graph mining. In 18th Int. Symposium on Software Testing and Analysis, pages 141-152, NY, USA, 2009. ACM.
5. S. A. Cook. The complexity of theorem-proving procedures. In 3rd ACM Symposium on Theory of computing (STOC), pages 151-158, NY, USA, 1971.
6. R. Giugno and D. Shasha. Graphgrep: A fast and universal method for querying graphs. In 16th International Conference on Pattern Recognition, volume 2, pages 112-115, 2002. (Pubitemid 44844693)
7. J. Grochow and M. Kellis. Network motif discovery using subgraph enumeration and symmetry-breaking. Research in Computational Molecular Biology, pages 92-106, 2007. (Pubitemid 47164534)
8. R. Guimerà, L. Danon, A. D. Guilera, F. Giralt, and A. Arenas. Self-similar community structure in a network of human interactions. Physical Review E, 68(6):065103+, 2003.
9. H. He and A. K. Singh. Closure-tree: An index structure for graph queries. In 22nd International Conference on Data Engineering (ICDE), pages 38-, Washington, DC, USA, 2006. IEEE CS. (Pubitemid 44539830)
10. E. Janssen, M. Hurshman, and N. Kalyaniwalla. Model selection for social networks using graphlets. Internet Mathematics, 2012.
11. 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 Bioinformatics, 10(1):318, 2009.
12. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In 1st IEEE International Conference on Data Mining (ICDM), page 313, Los Alamitos, CA, USA, 2001. IEEE CS.
13. B. McKay. Practical graph isomorphism. Congressus Numerantium, 30:45-87, 1981.
14. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. Network motifs: simple building blocks of complex networks. Science, 298(5594):824-827, October 2002. (Pubitemid 35231534)
15. M. E. J. Newman. The structure of scientific collaboration networks. National Academy of Sciences of the USA, 98(2):404-409, 2001. (Pubitemid 32105053)
16. N. Přzulj. Biological network comparison using graphlet degree distribution. Bioinformatics, 23:e177-e183, Jan. 2007. (Pubitemid 46189654)
17. P. Ribeiro. Efficient and Scalable Algorithms for Network Motifs Discovery. PhD thesis, University of Porto, 2011.
18. P. Ribeiro and F. Silva. Efficient subgraph frequency estimation with g-tries. In International Workshop on Algorithms in Bioinformatics (WABI), volume 6293 of LNCS, pages 238-249. Springer, September 2010.
19. P. Ribeiro and F. Silva. G-tries: an efficient data structure for discovering network motifs. In 25th ACM Symposium on Applied Computing (SAC), pages 1559-1566. ACM, March 2010.
20. P. Ribeiro, F. Silva, and M. Kaiser. Strategies for network motifs discovery. In 5th IEEE International Conference on e-Science, pages 80-87, Oxford, UK, December 2009. IEEE CS.
21. P. Ribeiro, F. Silva, and L. Lopes. Efficient parallel subgraph counting using g-tries. In IEEE International Conference on Cluster Computing (Cluster), pages 1559-1566. IEEE CS, September 2010.
22. F. Schreiber and H. Schwobbermeyer. Towards motif detection in networks: Frequency concepts and flexible search. In International Workshop on Network Tools and Applications in Biology, pages 91-102, 2004.
23. S. Wernicke. Efficient detection of network motifs. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3(4):347-359, 2006. (Pubitemid 44950084)
24. S. Wernicke and F. Rasche. Fanmod: a tool for fast network motif detection. Bioinformatics, 22(9):1152-1153, May 2006.
25. G. Wu, M. Harrigan, and P. Cunningham. Characterizing wikipedia pages using edit network motif profiles. In 3rd Int. workshop on search and mining user-generated contents (SMUC), pages 45-52, New York, NY, USA, 2011. ACM.
26. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In 2nd IEEE International Conference on Data Mining (ICDM), page 721, Washington, DC, USA, 2002. IEEE CS Press.