{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:50:20Z","timestamp":1742975420954,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031575143"},{"type":"electronic","value":"9783031575150"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-57515-0_5","type":"book-chapter","created":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T11:02:01Z","timestamp":1713006121000},"page":"55-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing Motifs in\u00a0Hypergraphs"],"prefix":"10.1007","author":[{"given":"Duarte","family":"N\u00f3brega","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,14]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Aparicio, D., Paredes, P., Ribeiro, P.: A scalable parallel approach for subgraph census computation. In: Euro-Par 2014: Parallel Processing Workshops, Revised Selected Papers, pp. 194\u2013205 (2014)","DOI":"10.1007\/978-3-319-14313-2_17"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep03368","volume":"3","author":"L Chen","year":"2013","unstructured":"Chen, L., Qu, X., Cao, M., Zhou, Y., Li, W., Liang, B., Li, W., He, W., Feng, C., Jia, X., He, Y.: Identification of breast cancer patients based on human signaling network motifs. Sci. Rep. 3(1), 1\u20137 (2013)","journal-title":"Sci. Rep."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Chodrow, P.S.: Configuration models of random hypergraphs. J. Complex Netw. 8(3), cnaa018 (2020)","DOI":"10.1093\/comnet\/cnaa018"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC \u201971, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"issue":"39","key":"5_CR5","doi-asserted-by":"publisher","first-page":"19368","DOI":"10.1073\/pnas.1819529116","volume":"116","author":"AK Dey","year":"2019","unstructured":"Dey, A.K., Gel, Y.R., Vincent Poor, H.: What network motifs tell us about resilience and reliability of complex networks. Proc. Natl. Acad. Sci. 116(39), 19368\u201319373 (2019)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Hong-Lin, X., Han-Bing, Y., Cui-Fang, G., Ping, Z.: Social network analysis based on network motifs. J. Appl. Math. 2014 (2014)","DOI":"10.1155\/2014\/874708"},{"issue":"12","key":"5_CR7","doi-asserted-by":"publisher","first-page":"2256","DOI":"10.14778\/3407790.3407823","volume":"13","author":"G Lee","year":"2020","unstructured":"Lee, G., Ko, J., Shin, K.: Hypergraph motifs: concepts, algorithms, and discoveries. Proc. VLDB Endowment 13(12), 2256\u20132269 (2020)","journal-title":"Proc. VLDB Endowment"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Lotito, Q.F., Contisciani, M., De Bacco, C., Di Gaetano, L., Gallo, L., Montresor, A., Musciotto, F., Ruggeri, N., Battiston, F.: Hypergraphx: a library for higher-order network analysis. J. Complex Netw. 11(3), cnad019 (2023)","DOI":"10.1093\/comnet\/cnad019"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Lotito, Q.F., Musciotto, F., Battiston, F., Montresor, A.: Exact and sampling methods for mining higher-order motifs in large hypergraphs. Computing 1\u201320 (2023)","DOI":"10.1038\/s42005-022-00858-7"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1038\/s42005-022-00858-7","volume":"5","author":"QF Lotito","year":"2022","unstructured":"Lotito, Q.F., Musciotto, F., Montresor, A., Battiston, F.: Higher-order motif analysis in hypergraphs. Commun. Phys. 5(1), 79 (2022)","journal-title":"Commun. Phys."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, ii. J. Symb. Comput. 60, 94\u2013112 (2014)","journal-title":"J. Symb. Comput."},{"issue":"5594","key":"5_CR12","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":"5663","key":"5_CR13","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.1126\/science.1089167","volume":"303","author":"R Milo","year":"2004","unstructured":"Milo, R., Itzkovitz, S., Kashtan, N., Levitt, R., Shen-Orr, S., Ayzenshtat, I., Sheffer, M., Alon, U.: Superfamilies of evolved and designed networks. Science 303(5663), 1538\u20131542 (2004)","journal-title":"Science"},{"issue":"2\u20133","key":"5_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/rsa.3240060204","volume":"6","author":"M Molloy","year":"1995","unstructured":"Molloy, M., Reed, B.: A critical point for random graphs with a given degree sequence. Random Struct. Algorithms 6(2\u20133), 161\u2013180 (1995)","journal-title":"Random Struct. Algorithms"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cosrev.2012.12.001","volume":"7","author":"DF Nettleton","year":"2013","unstructured":"Nettleton, D.F.: Data mining of social networks represented as graphs. Comput. Sci. Rev. 7, 1\u201334 (2013)","journal-title":"Comput. Sci. Rev."},{"issue":"6","key":"5_CR16","first-page":"11","volume":"11","author":"DJ Nordman","year":"2015","unstructured":"Nordman, D.J., Berry, J.W., Phillips, C.A., Fostvedt, L.A., Wilson, A.G., Seshadhri, C.: Why do simple algorithms for triangle enumeration work in the real world? Internet Math. 11(6), 11 (2015)","journal-title":"Internet Math."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Paredes, P., Ribeiro, P.: Towards a faster network-centric subgraph census. In: 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013), pp. 264\u2013271 (2013)","DOI":"10.1145\/2492517.2492535"},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s13278-015-0256-2","volume":"5","author":"P Paredes","year":"2015","unstructured":"Paredes, P., Ribeiro, P.: Rand-fase: fast approximate subgraph census. Soc. Netw. Anal. Min. 5(1), 17 (2015)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"2","key":"5_CR19","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. (CSUR) 54(2), 1\u201336 (2021)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Ribeiro, P., Silva, F.: G-tries: an efficient data structure for discovering network motifs. In: Proceedings of the 2010 ACM Symposium on Applied Computing, pp. 1559\u20131566 (2010)","DOI":"10.1145\/1774088.1774422"},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/959242.959249","volume":"5","author":"T Washio","year":"2003","unstructured":"Washio, T., Motoda, H.: State of the art of graph-based data mining. ACM SIGKDD Explorat. Newsl 5(1), 59\u201368 (2003)","journal-title":"ACM SIGKDD Explorat. Newsl"},{"issue":"4","key":"5_CR22","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."}],"container-title":["Springer Proceedings in Complexity","Complex Networks XV"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-57515-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T11:02:38Z","timestamp":1713006158000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57515-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031575143","9783031575150"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57515-0_5","relation":{},"ISSN":["2213-8684","2213-8692"],"issn-type":[{"type":"print","value":"2213-8684"},{"type":"electronic","value":"2213-8692"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"14 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CompleNet-Live","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Exeter","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"complenet-live2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/complenet.weebly.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}