G-tries: An efficient data structure for discovering network motifs

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2010, Pages 1559-1566

  Ribeiro, Pedro ^a   Silva, Fernando ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

algorithms; biological networks; complex networks; data structures; graph mining; network motifs; tries

Indexed keywords

ALGORITHMS AND DATA STRUCTURES; BIOLOGICAL NETWORKS; COMMON PLATFORM; COMPLEX NETWORKS; EFFICIENT DATA STRUCTURES; GRAPH MINING; MULTIWAY TREE; NETWORK MOTIF; PREFIX TREES; SUBGRAPHS;

CIRCUIT THEORY; DATA STRUCTURES;

ALGORITHMS;

EID: 77954747857     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1774088.1774422     Document Type: Conference Paper

References (25)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pages 487-499, 1994.
2. I. Albert and R. Albert. Conserved network motifs allow protein-protein interaction prediction. Bioinformatics, 20(18):3346-3352, December 2004.
3. V. Batagelj and A. Mrvar. Pajek datasets, 2006. http://vlado.fmf.uni-lj. si/pub/networks/data/.
4. D. Bu, Y. Zhao, L. Cai, H. Xue, X. Zhu, H. Lu, J. Zhang, S. Sun, L. Ling, N. Zhang, G. Li, and R. Chen. Topological structure analysis of the protein-protein interaction network in budding yeast. Nucl. Acids Res., 31(9):2443-2450, May 2003.
5. D. Chakrabarti and C. Faloutsos. Graph mining: Laws, generators, and algorithms. ACM Computing Surveys, 38:1, 2006.
6. L. da F. Costa, F. A. Rodrigues, G. Travieso, and P. R. V. Boas. Characterization of complex networks: A survey of measurements. Advances In Physics, 56:167, 2007.
7. R. Dobrin, Q. K. Beg, A. Barabasi, and Z. Oltvai. Aggregation of topological motifs in the escherichia coli transcriptional regulatory network. BMC Bioinformatics, 5:10, 2004.
8. E. Fredkin. Trie memory. Commun. ACM, 3(9):490-499, September 1960.
9. J. Grochow and M. Kellis. Network motif discovery using subgraph enumeration and symmetry-breaking. pages 92-106. 2007.
10. J. Han and M. Kamber. Data Mining, Second Edition: Concepts and Techniques. Morgan Kaufmann, September 2006.
11. S. Itzkovitz, R. Levitt, N. Kashtan, R. Milo, M. Itzkovitz, and U. Alon. Coarse-graining and self-dissimilarity of complex networks. Phys Rev E Stat Nonlin Soft Matter Phys, 71(1 Pt 2), January 2005.
12. N. Kashtan, S. Itzkovitz, R. Milo, and U. Alon. Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics, 20(11):1746-1758, 2004.
13. M. Kondoh. Building trophic modules into a persistent food web. Proceedings of the National Academy of Sciences, 105(43):16631-16635, 2008.
14. M. Kuramochi and G. Karypis. Frequent subgraph discovery. Data Mining, IEEE International Conference on, 0:313, 2001.
15. A. Lancichinetti, S. Fortunato, and F. Radicchi. Benchmark graphs for testing community detection algorithms. Physical Review E (Statistical, Nonlinear, and Soft Matter Ph ysics), 78(4), 2008.
16. D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, and S. M. Dawson. The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. can geographic isolation explain this unique trait? Behavioral Ecology and Sociobiology, 54(4):396-405, 2003.
17. B. McKay. Practical graph isomorphism. Cong. Numerantium, 30:45-87, 1981.
18. 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.
19. M. Newman. Network data, september, 2009. http://www-personal.umich.edu/ ~mejn/netdata/.
20. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45, 2003.
21. O. Sporns and R. Kotter. Motifs in brain networks. PLoS Biology, 2, 2004.
22. S. Wasserman, K. Faust, and D. Iacobucci. Social Network Analysis : Methods and Applications (Structural Analysis in the Social Sciences). Cambridge University Press, November 1994.
23. D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393(6684):440-442, June 1998.
24. S. Wernicke. Efficient detection of network motifs. IEEE/ACM Trans. Comput. Biol. Bioinformatics, 3(4):347-359, 2006.
25. S. Wernicke and F. Rasche. Fanmod: a tool for fast network motif detection. Bioinformatics, 22(9):1152-1153, May 2006.