{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:03:17Z","timestamp":1772906597730,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031439797","type":"print"},{"value":"9783031439803","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43980-3_11","type":"book-chapter","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:02:15Z","timestamp":1695124935000},"page":"129-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["CAGE: Cache-Aware Graphlet Enumeration"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0770-2235","authenticated-orcid":false,"given":"Alessio","family":"Conte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7985-4222","authenticated-orcid":false,"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1273-2770","authenticated-orcid":false,"given":"Davide","family":"Rucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,20]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, N.K., Neville, J., Rossi, R.A., Duffield, N.: Efficient graphlet counting for large networks. In: 2015 IEEE International Conference on Data Mining, pp. 1\u201310. Atlantic City, NJ, USA, IEEE (2015)","DOI":"10.1109\/ICDM.2015.141"},{"issue":"10","key":"11_CR2","doi-asserted-by":"publisher","first-page":"e0205497","DOI":"10.1371\/journal.pone.0205497","volume":"13","author":"D Apar\u00edcio","year":"2018","unstructured":"Apar\u00edcio, D., Ribeiro, P., Silva, F.: Graphlet-orbit transitions (GoT): a fingerprint for temporal network comparison. PLoS ONE 13(10), e0205497 (2018)","journal-title":"PLoS ONE"},{"key":"11_CR3","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-030-36687-2_7","volume-title":"Complex Networks and Their Applications VIII","author":"D Apar\u00edcio","year":"2020","unstructured":"Apar\u00edcio, D., Ribeiro, P., Silva, F., Silva, J.: Finding dominant nodes using graphlets. In: Cherifi, H., Gaito, S., Mendes, J.F., Moro, E., Rocha, L.M. (eds.) COMPLEX NETWORKS 2019. SCI, vol. 881, pp. 77\u201389. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-36687-2_7"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Bhuiyan, M.A., Rahman, M., Rahman, M., Al Hasan, M.: Guise: uniform sampling of graphlets for large graph analysis. In: 2012 IEEE 12th International Conference on Data Mining, pp. 91\u2013100. IEEE (2012)","DOI":"10.1109\/ICDM.2012.87"},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3186586","volume":"12","author":"M Bressan","year":"2018","unstructured":"Bressan, M., Chierichetti, F., Kumar, R., Leucci, S., Panconesi, A.: Motif counting beyond five nodes. ACM TKDD 12(4), 1\u201325 (2018)","journal-title":"ACM TKDD"},{"issue":"15","key":"11_CR6","doi-asserted-by":"publisher","first-page":"11579","DOI":"10.1007\/s00521-019-04642-7","volume":"32","author":"A Dutta","year":"2020","unstructured":"Dutta, A., Riba, P., Llad\u00f3s, J., Forn\u00e9s, A.: Hierarchical stochastic graphlet embedding for graph-based pattern recognition. Neural Comput. Appl. 32(15), 11579\u201311596 (2020)","journal-title":"Neural Comput. Appl."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Elenberg, E.R., Shanmugam, K., Borokhovich, M., Dimakis, A.G.: Beyond triangles: a distributed framework for estimating 3-profiles of large graphs. In: ACM SIGKDD, pp. 229\u2013238 (2015)","DOI":"10.1145\/2783258.2783413"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. ACM Trans. Algorithms 8(1), 4:1\u20134:22 (2012)","DOI":"10.1145\/2071379.2071383"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Harris, S.L., Harris, D.: 8 - memory systems. In: Harris, S.L., Harris, D. (eds.) Digital Design and Computer Architecture, pp. 498\u2013541. Morgan Kaufmann, Burlington (2022)","DOI":"10.1016\/B978-0-12-820064-3.00008-8"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Jazayeri, A., Yang, C.C.: Motif discovery algorithms in static and temporal networks: a survey. J. Complex Netw. 8(4), cnaa031 (2020)","DOI":"10.1093\/comnet\/cnaa031"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1186\/1471-2105-10-318","volume":"10","author":"ZRM Kashani","year":"2009","unstructured":"Kashani, Z.R.M., et al.: Kavosh: a new algorithm for finding network motifs. BMC Bioinform. 10(1), 318 (2009)","journal-title":"BMC Bioinform."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.dam.2020.04.036","volume":"303","author":"C Komusiewicz","year":"2021","unstructured":"Komusiewicz, C., Sommer, F.: Enumerating connected induced subgraphs: improved delay and experimental comparison. Discret. Appl. Math. 303, 262\u2013282 (2021)","journal-title":"Discret. Appl. Math."},{"key":"11_CR13","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data"},{"key":"11_CR14","unstructured":"Marino, A. , Crescenzi, P.: LASAGNE Networks: Laboratory of Algorithms, modelS, and Analysis of Graphs and NEtworks (2015). http:\/\/www.pilucrescenzi.it\/lasagne\/content\/networks.html"},{"issue":"8","key":"11_CR15","doi-asserted-by":"publisher","first-page":"1372","DOI":"10.1093\/bioinformatics\/btx758","volume":"34","author":"I Melckenbeeck","year":"2017","unstructured":"Melckenbeeck, I., Audenaert, P., Colle, D., Pickavet, M.: Efficiently counting all orbits of graphlets of any order in a graph using autogenerated equations. Bioinformatics 34(8), 1372\u20131380 (2017)","journal-title":"Bioinformatics"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-018-2483-9","volume":"20","author":"I Melckenbeeck","year":"2019","unstructured":"Melckenbeeck, I., Audenaert, P., Van Parys, T., Van De Peer, Y., Colle, D., Pickavet, M.: Optimising orbit counting of arbitrary order by equation selection. BMC Bioinform. 20(1), 1\u201313 (2019)","journal-title":"BMC Bioinform."},{"issue":"5594","key":"11_CR17","doi-asserted-by":"publisher","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.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R Pagh","year":"2004","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. J. Algorithms 51(2), 122\u2013144 (2004)","journal-title":"J. Algorithms"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Paredes, P., Ribeiro, P.: Towards a faster network-centric subgraph census. In: IEEE\/ACM ASONAM, pp. 264\u2013271, New York, NY, USA, ACM (2013)","DOI":"10.1145\/2492517.2492535"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Pinar, A., Seshadhri, C., Vishal, V.: Escape: efficiently counting all 5-vertex subgraphs. In: The Web Conference (WWW), pp. 1431\u20131440 (2017)","DOI":"10.1145\/3038912.3052597"},{"issue":"2","key":"11_CR21","doi-asserted-by":"publisher","first-page":"e177","DOI":"10.1093\/bioinformatics\/btl301","volume":"23","author":"N Pr\u017eulj","year":"2007","unstructured":"Pr\u017eulj, N.: Biological network comparison using graphlet degree distribution. Bioinformatics 23(2), e177\u2013e183 (2007)","journal-title":"Bioinformatics"},{"issue":"2","key":"11_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3433652","volume":"54","author":"P Ribeiro","year":"2021","unstructured":"Ribeiro, P., Paredes, P., Silva, M.E., Aparicio, D., Silva, F.: A survey on subgraph counting: concepts, algorithms, and applications to network motifs and graphlets. ACM Comput. Surv. 54(2), 1\u201336 (2021)","journal-title":"ACM Comput. Surv."},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Rossi, R., Ahmed, N.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"11_CR24","unstructured":"Ruskey, F.: Combinatorial generation. Preliminary Working Draft, vol. 11, pp. 20. University of Victoria, Victoria, BC, Canada (2003)"},{"issue":"3","key":"11_CR25","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379\u2013423 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"11_CR26","unstructured":"Shervashidze, N., Vishwanathan, S.V.N., Petri, T., Mehlhorn, K., Borgwardt, K.: Efficient graphlet kernels for large graph comparison. In: van Dyk, D., Welling, M. (eds.) AISTATS, vol. 5, pp. 488\u2013495 (2009). PMLR 16\u201318"},{"issue":"3","key":"11_CR27","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1137\/S0097539794270881","volume":"26","author":"A Shioura","year":"1997","unstructured":"Shioura, A., Tamura, A., Uno, T.: An optimal algorithm for scanning all spanning trees of undirected graphs. SIAM J. Comput. 26(3), 678\u2013692 (1997)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"11_CR28","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theoret. Comput. Sci. 363(1), 28\u201342 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"11_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629564","volume":"9","author":"P Wang","year":"2014","unstructured":"Wang, P., Lui, J.C., Ribeiro, B., Towsley, D., Zhao, J., Guan, X.: Efficiently estimating motif statistics of large networks. ACM TKDD 9(2), 1\u201327 (2014)","journal-title":"ACM TKDD"},{"issue":"1","key":"11_CR30","first-page":"73","volume":"30","author":"P Wang","year":"2017","unstructured":"Wang, P., et al.: Moss-5: a fast method of approximating counts of 5-node graphlets in large graphs. IEEE TKDE 30(1), 73\u201386 (2017)","journal-title":"IEEE TKDE"},{"issue":"4","key":"11_CR31","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1109\/TCBB.2006.51","volume":"3","author":"S Wernicke","year":"2006","unstructured":"Wernicke, S.: Efficient detection of network motifs. IEEE\/ACM Trans. Comput. Biol. Bioinf. 3(4), 347\u2013359 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"1","key":"11_CR32","doi-asserted-by":"publisher","first-page":"e0261676","DOI":"10.1371\/journal.pone.0261676","volume":"17","author":"SF Windels","year":"2022","unstructured":"Windels, S.F., Malod-Dognin, N., Pr\u017eulj, N.: Graphlet eigencentralities capture novel central roles of genes in pathways. PLoS ONE 17(1), e0261676 (2022)","journal-title":"PLoS ONE"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43980-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:03:06Z","timestamp":1695124986000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43980-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031439797","9783031439803"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43980-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"20 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spire2023.isti.cnr.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}