Rand-FaSE: fast approximate subgraph census

[1]  Fernando M. A. Silva,et al.  G-Tries: a data structure for storing and finding subgraphs , 2014, Data Mining and Knowledge Discovery.

[2]  Kamesh Madduri,et al.  Fast Approximate Subgraph Counting and Enumeration , 2013, 2013 42nd International Conference on Parallel Processing.

[3]  Pedro Manuel Pinto Ribeiro,et al.  Towards a faster network-centric subgraph census , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[4]  Ina Koch,et al.  QuateXelero: An Accelerated Exact Network Motif Detection Algorithm , 2013, PloS one.

[5]  Gang Wang,et al.  NetMODE: Network Motif Detection without Nauty , 2012, PloS one.

[6]  Mohammad Al Hasan,et al.  GUISE: Uniform Sampling of Graphlets for Large Graph Analysis , 2012, 2012 IEEE 12th International Conference on Data Mining.

[7]  Fernando M. A. Silva,et al.  Motif Mining in Weighted Networks , 2012, 2012 IEEE 12th International Conference on Data Mining Workshops.

[8]  Jeannette C. M. Janssen,et al.  Model Selection for Social Networks Using Graphlets , 2012, Internet Math..

[9]  Fernando M. A. Silva,et al.  Comparison of Co-authorship Networks across Scientific Fields Using Motifs , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[10]  Jure Leskovec,et al.  Defining and evaluating network communities based on ground-truth , 2012, Knowledge and Information Systems.

[11]  Padraig Cunningham,et al.  Characterizing Wikipedia pages using edit network motif profiles , 2011, SMUC '11.

[12]  Fernando M. A. Silva,et al.  Efficient Subgraph Frequency Estimation with G-Tries , 2010, WABI.

[13]  Yuval Shavitt,et al.  Efficient Counting of Network Motifs , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems Workshops.

[14]  Marcus Kaiser,et al.  Strategies for Network Motifs Discovery , 2009, 2009 Fifth IEEE International Conference on e-Science.

[15]  F. Schreiber,et al.  MODA: an efficient algorithm for network motif discovery in biological networks. , 2009, Genes & genetic systems.

[16]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[17]  Lucas Antiqueira,et al.  Analyzing and modeling real-world phenomena with complex networks: a survey of applications , 2007, 0711.3199.

[18]  Joshua A. Grochow,et al.  Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking , 2007, RECOMB.

[19]  Sebastian Wernicke,et al.  Efficient Detection of Network Motifs , 2006, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[20]  J. Leskovec,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[21]  Sergi Valverde,et al.  Network motifs in computational graphs: a case study in software architecture. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  O. Sporns,et al.  Motifs in Brain Networks , 2004, PLoS biology.

[23]  Uri Alon,et al.  Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs , 2004, Bioinform..

[24]  Réka Albert,et al.  Conserved network motifs allow protein-protein interaction prediction , 2004, Bioinform..

[25]  Uri Alon,et al.  Coarse-graining and self-dissimilarity of complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  Pablo M. Gleiser,et al.  Community Structure in Jazz , 2003, Adv. Complex Syst..

[27]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[28]  Hayo Thielecke,et al.  Continuations, functions and jumps , 1999, SIGA.

[29]  Donald L. Kreher,et al.  Combinatorial algorithms: generation, enumeration, and search , 1998, SIGA.

[30]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[31]  Marios Mavronicolas,et al.  An efficient counting network , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

[32]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[33]  Natasa Przulj.  Biological. , 1895, The journals of gerontology. Series A, Biological sciences and medical sciences.

[34]  Fernando M. A. Silva,et al.  Discovering Colored Network Motifs , 2014, CompleNet.

[35]  K. Erciyes.  Network Motif Discovery , 2014 .

[36]  BMC Bioinformatics BioMed Central Methodology article Kavosh: a new algorithm for finding network motifs , 2009 .

[37]  Falk Schreiber,et al.  Towards Motif Detection in Networks: Frequency Concepts and Flexible Search , 2004 .

[38]  S. Shen-Orr,et al.  Milo , Networks Network Motifs : Simple Building Blocks of Complex , 2002 .