Approximating the number of network motifs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5427 LNCS, Issue , 2009, Pages 13-24

  Gonen, Mira ^a   Shavitt, Yuval ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; NEURAL NETWORKS; WORLD WIDE WEB;

BOUNDED TREEWIDTH; CHEMICAL SYSTEMS; COLOR CODING; DEGREE SEQUENCES; EFFICIENT ALGORITHMS; INTERACTING SPECIES; NETWORK MOTIFS; PRACTICAL ALGORITHMS; SUB-GRAPHS; TIME COMPLEXITY;

MATHEMATICAL MODELS;

EID: 61649112052     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-95995-3_2     Document Type: Conference Paper

References (17)

1. Alon, N., Dao, P., Hajirasouliha, I., Hormozdiari, F., Sahinalp, S.C.: Biomolecular network motif counting and discovery by color coding. Bioinformatics 1, 1-9 (2008)
2. Alon, N., Gutner, S.: Balanced families of perfect hash functions and their applications. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 435-446. Springer, Heidelberg (2007)
3. Alon, N., Yuster, R., Zwick, U.: Color-coding. Journal of the ACM 42(4), 844 (1995)
4. Arvind, V., Raman, V.: Approximation algorithms for some parameterized counting problems. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 453-464. Springer, Heidelberg (2002)
5. Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 16-24 (2008)
6. Dost, B., Shlomi, T., Gupta, N., Ruppin, E., Bafna, V., Sharan, R.: QNet: A tool for querying protein interaction networks. In: Speed, T., Huang, H. (eds.) RECOMB 2007. LNCS (LNBI), vol. 4453, pp. 1-15. Springer, Heidelberg (2007)
7. Gonen, M., Shavitt, Y.: Approximating the number of network motifs. Technical report, School of Electrical Enjeneering, Tel Aviv University (2008)
8. Grochow, J.A., Kellis, M.: Network motif discovery using subgraph enumeration and symmetry-breaking. In: Speed, T., Huang, H. (eds.) RECOMB 2007. LNCS (LNBI), vol. 4453, pp. 92-106. Springer, Heidelberg (2007)
9. Hales, D., Arteconi, S.: Motifs in evolving cooperative networks look like protein structure networks. Special Issue of ECCS 2007 in The Journal of Networks and Heterogeneous Media 3(2), 239-249 (2008)
10. Hormozdiari, F., Berenbrink, P., Przulj, N., Sahinalp, S.C.: Not all scale-free networks are born equal: The role of the seed graph in ppi network evolution. PLoS: Computational Biology 3(7), e118 (2007)
11. Kashtan, N., Itzkovitz, S., Milo, R., Alon, U.: Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 20(11), 1746 (2004)
12. Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: Simple building blocks of complex networks. Science 298, 824-827 (2002)
13. Przulj, N.: Biological network comparison using graphlet degree distribution. Bioinformatics 23(2), e177-e183 (2007)
14. Przulj, N., Corneil, D.G., Jurisica, I.: Modeling interactome: Scale- free or geometric? Bioinformatics 150, 216-231 (2005)
15. Scott, J., Ideker, T., Karp, R.M., Sharan, R.: Efficient algorithms for detecting signaling pathways in protein interaction networks. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol. 3500, pp. 1-13. Springer, Heidelberg (2005)
16. Shlomi, T., Segal, D., Ruppin, E.: QPath: a method for querying pathways in a protein-protein interaction network. Bioinformatics 7, 199 (2006)
17. Wernicke, S.: Efficient detection of network motifs. IEEE/ACM Transactions on Computational Biology and Bioinformatics 3(4), 347-359 (2006)