{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T17:05:42Z","timestamp":1767373542803},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,5,27]],"date-time":"2015-05-27T00:00:00Z","timestamp":1432684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s13278-015-0256-2","type":"journal-article","created":{"date-parts":[[2015,5,26]],"date-time":"2015-05-26T08:05:32Z","timestamp":1432627532000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Rand-FaSE: fast approximate subgraph census"],"prefix":"10.1007","volume":"5","author":[{"given":"Pedro","family":"Paredes","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,27]]},"reference":[{"issue":"18","key":"256_CR1","doi-asserted-by":"crossref","first-page":"3346","DOI":"10.1093\/bioinformatics\/bth402","volume":"20","author":"I Albert","year":"2004","unstructured":"Albert I, Albert R (2004) Conserved network motifs allow proteinprotein interaction prediction. Bioinformatics 20(18):3346\u20133352. doi: 10.1093\/bioinformatics\/bth402","journal-title":"Bioinformatics"},{"key":"256_CR2","unstructured":"Batagelj V, Mrvar A (2006) Pajek datasets. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/"},{"key":"256_CR3","doi-asserted-by":"crossref","unstructured":"Bhuiyan M, Rahman M, Rahman M, Hasan MA (2012) Guise: uniform sampling of graphlets for large graph analysis. In: IEEE international conference on data mining, ICDM, pp 91\u2013100","DOI":"10.1109\/ICDM.2012.87"},{"key":"256_CR4","doi-asserted-by":"crossref","unstructured":"Choobdar S, Ribeiro P, Bugla S, Silva F (2012a) Co-authorship network comparison across research fields using motifs. In: IEEE\/ACM international conference on advances in social networks analysis and mining, IEEE, pp 147\u2013152. doi: 10.1109\/ASONAM.2012.34","DOI":"10.1109\/ASONAM.2012.34"},{"key":"256_CR5","doi-asserted-by":"crossref","unstructured":"Choobdar S, Ribeiro P, Silva F (2012b) Motif mining in weighted networks. In: Data mining workshops (ICDMW), 2012 IEEE 12th international conference on, pp. 210\u2013217. doi: 10.1109\/ICDMW.2012.111","DOI":"10.1109\/ICDMW.2012.111"},{"key":"256_CR6","first-page":"151","volume-title":"The complexity of theorem-proving procedures. ACM Symposium on Theory of computing. ACM symposium on theory of computing (STOC)","author":"SA Cook","year":"1971","unstructured":"Cook SA (1971) The complexity of theorem-proving procedures. ACM Symposium on Theory of computing. ACM symposium on theory of computing (STOC). ACM, New York, NY, USA, pp 151\u2013158"},{"key":"256_CR7","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1080\/00018732.2011.572452","volume":"60","author":"L Costa","year":"2011","unstructured":"Costa L, Oliveira O Jr, Travieso G, Rodrigues F, Boas P, Antiqueira L, Viana M, Da Rocha L (2011) Analyzing and modeling real-world phenomena with complex networks: a survey of applications. Adv Phys 60:329\u2013412","journal-title":"Adv Phys"},{"issue":"3\u20135","key":"256_CR8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3\u20135):75\u2013174","journal-title":"Phys Rep"},{"key":"256_CR9","doi-asserted-by":"crossref","unstructured":"Gleiser PM, Danon L (2003) Community structure in jazz. Adv Complex Syst 06(04), pp. 565\u2013573. doi: 10.1142\/S0219525903001067","DOI":"10.1142\/S0219525903001067"},{"key":"256_CR10","doi-asserted-by":"crossref","unstructured":"Grochow J, Kellis M (2007) Network motif discovery using subgraph enumeration and symmetry-breaking. Res Comput Mol Biol, pp 92\u2013106","DOI":"10.1007\/978-3-540-71681-5_7"},{"key":"256_CR11","doi-asserted-by":"crossref","first-page":"016127","DOI":"10.1103\/PhysRevE.71.016127","volume":"71","author":"S Itzkovitz","year":"2005","unstructured":"Itzkovitz S, Levitt R, Kashtan N, Milo R, Itzkovitz M, Alon U (2005) Coarse-graining and self-dissimilarity of complex networks. Phys Rev E (Stat Nonlin Soft Matter Phys) 71:016127","journal-title":"Phys Rev E (Stat Nonlin Soft Matter Phys)"},{"key":"256_CR12","doi-asserted-by":"crossref","unstructured":"Janssen E, Hurshman M, Kalyaniwalla N (2012) Model selection for social networks using graphlets. Internet Math","DOI":"10.1080\/15427951.2012.671149"},{"issue":"1","key":"256_CR13","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1186\/1471-2105-10-318","volume":"10","author":"Z Kashani","year":"2009","unstructured":"Kashani Z, Ahrabian H, Elahi E, Nowzari-Dalini A, Ansari E, Asadi S, Mohammadi S, Schreiber F, Masoudi-Nejad A (2009) Kavosh: a new algorithm for finding network motifs. BMC Bioinform 10(1):318","journal-title":"BMC Bioinform"},{"issue":"11","key":"256_CR14","doi-asserted-by":"crossref","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N Kashtan","year":"2004","unstructured":"Kashtan N, Itzkovitz S, Milo R, Alon U (2004) Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 20(11):1746\u20131758","journal-title":"Bioinformatics"},{"issue":"7","key":"256_CR15","doi-asserted-by":"crossref","first-page":"e68073","DOI":"10.1371\/journal.pone.0068073","volume":"8","author":"S Khakabimamaghani","year":"2013","unstructured":"Khakabimamaghani S, Sharafuddin I, Dichter N, Koch I, Masoudi-Nejad A (2013) Quatexelero: an accelerated exact network motif detection algorithm. PLoS ONE 8(7):e68073. doi: 10.1371\/journal.pone.0068073","journal-title":"PLoS ONE"},{"issue":"1","key":"256_CR16","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/309739.309744","volume":"30","author":"DL Kreher","year":"1999","unstructured":"Kreher DL, Stinson DR (1999) Combinatorial algorithms: generation, enumeration, and search. SIGACT News 30(1):33\u201335","journal-title":"SIGACT News"},{"key":"256_CR17","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg JM, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov From Data 1(1). doi: 10.1145\/1217299.1217301","DOI":"10.1145\/1217299.1217301"},{"issue":"12","key":"256_CR18","doi-asserted-by":"crossref","first-page":"e50093","DOI":"10.1371\/journal.pone.0050093","volume":"7","author":"X Li","year":"2012","unstructured":"Li X, Stones DS, Wang H, Deng H, Liu X, Wang G (2012) Netmode: network motif detection without nauty. PLoS One 7(12):e50093","journal-title":"PLoS One"},{"key":"256_CR19","doi-asserted-by":"crossref","unstructured":"Marcus D, Shavitt Y (2010) Efficient counting of network motifs. In: ICDCS workshops, IEEE Computer Society, pp 92\u201398","DOI":"10.1109\/ICDCSW.2010.41"},{"key":"256_CR20","unstructured":"McKay B (2012) nauty. http:\/\/cs.anu.edu.au\/~bdm\/nauty\/"},{"issue":"5594","key":"256_CR21","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U (2002) Network motifs: simple building blocks of complex networks. Science 298(5594):824\u2013827","journal-title":"Science"},{"key":"256_CR22","doi-asserted-by":"crossref","unstructured":"Omidi S, Schreiber F, Masoudi-nejad A (2009) Moda: an efficient algorithm for network motif discovery in biological networks","DOI":"10.1266\/ggs.84.385"},{"key":"256_CR23","doi-asserted-by":"crossref","unstructured":"Paredes P, Ribeiro P (2013) Towards a faster network-centric subgraph census. In: Proceedings of the 2013 IEEE\/ACM international conference on advances in social networks analysis and mining, ACM, New York, NY, USA, ASONAM \u201913, pp 264\u2013271. doi: 10.1145\/2492517.2492535","DOI":"10.1145\/2492517.2492535"},{"issue":"6","key":"256_CR24","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1093\/bioinformatics\/btq091","volume":"26","author":"N Pr\u017eulj","year":"2010","unstructured":"Pr\u017eulj N (2010) Biological network comparison using graphlet degree distribution. Bioinformatics 26(6):853\u2013854","journal-title":"Bioinformatics"},{"key":"256_CR25","doi-asserted-by":"crossref","unstructured":"Ribeiro P, Silva F (2010) Efficient subgraph frequency estimation with g-tries. International Workshop on algorithms in bioinformatics, Springer, WABI, 6293:238\u2013249","DOI":"10.1007\/978-3-642-15294-8_20"},{"key":"256_CR26","doi-asserted-by":"crossref","unstructured":"Ribeiro P, Silva F (2014a) Discovering colored network motifs. In: Contucci P, Menezes R, Omicini A, Poncela-Casasnovas J (eds) Complex networks V, Studies in computational intelligence, vol 549, Springer International Publishing, pp 107\u2013118. doi: 10.1007\/978-3-319-05401-8_11","DOI":"10.1007\/978-3-319-05401-8_11"},{"key":"256_CR27","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10618-013-0303-4","volume":"28","author":"P Ribeiro","year":"2014","unstructured":"Ribeiro P, Silva F (2014b) G-tries: a data structure for storing and finding subgraphs. Data Min Knowl Discov 28:337\u2013377","journal-title":"Data Min Knowl Discov"},{"key":"256_CR28","doi-asserted-by":"crossref","unstructured":"Ribeiro P, Silva F, Kaiser M (2009) Strategies for network motifs discovery. In: IEEE international conference on e-Science, e-Science, pp 80\u201387","DOI":"10.1109\/e-Science.2009.20"},{"key":"256_CR29","unstructured":"Schreiber F, Schwobbermeyer H (2004) Towards motif detection in networks: frequency concepts and flexible search. In: International workshop on network tools and applications in biology, NetTAB, pp 91\u2013102"},{"key":"256_CR30","doi-asserted-by":"crossref","unstructured":"Slota GM, Madduri K (2013) Fast approximate subgraph counting and enumeration. In: 42nd international conference on parallel processing (ICPP), pp 210\u2013219","DOI":"10.1109\/ICPP.2013.30"},{"key":"256_CR31","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1371\/journal.pbio.0020369","volume":"2","author":"O Sporns","year":"2004","unstructured":"Sporns O, K\u00f6tter R (2004) Motifs in brain networks. PLoS Biol 2:369","journal-title":"PLoS Biol"},{"issue":"026","key":"256_CR32","first-page":"107","volume":"72","author":"S Valverde","year":"2005","unstructured":"Valverde S, Sol\u00e9 RV (2005) Network motifs in computational graphs: a case study in software architecture. Phys Rev E 72(026):107. doi: 10.1103\/PhysRevE.72.026107","journal-title":"Phys Rev E"},{"key":"256_CR33","doi-asserted-by":"crossref","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2019small-world\u2019 networks. Nature pp 440\u2013442","DOI":"10.1038\/30918"},{"key":"256_CR34","doi-asserted-by":"crossref","unstructured":"Wernicke S (2006) Efficient detection of network motifs. IEEE\/ACM Trans Comput Biol Bioinf, pp 347\u2013359","DOI":"10.1109\/TCBB.2006.51"},{"key":"256_CR35","doi-asserted-by":"crossref","unstructured":"Wu G, Harrigan M, Cunningham P (2011) Characterizing wikipedia pages using edit network motif profiles. In: 3rd International workshop on search and mining user-generated contents (SMUC), ACM, New York, NY, USA, pp 45\u201352","DOI":"10.1145\/2065023.2065036"},{"key":"256_CR36","doi-asserted-by":"crossref","unstructured":"Yang J, Leskovec J (2012) Defining and evaluating network communities based on ground-truth. In: Proceedings of the ACM SIGKDD workshop on mining data semantics, ACM, New York, NY, USA, MDS \u201912, pp 3:1\u20133:8. doi: 10.1145\/2350190.2350193","DOI":"10.1145\/2350190.2350193"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-015-0256-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-015-0256-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-015-0256-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T14:57:54Z","timestamp":1566745074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-015-0256-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,27]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["256"],"URL":"https:\/\/doi.org\/10.1007\/s13278-015-0256-2","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,27]]},"article-number":"17"}}