{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T20:37:36Z","timestamp":1771015056035,"version":"3.50.1"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031552472","type":"print"},{"value":"9783031552489","type":"electronic"}],"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-55248-9_12","type":"book-chapter","created":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T11:02:20Z","timestamp":1710500540000},"page":"250-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Motif Finding Algorithms: A Performance Comparison"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9760-887X","authenticated-orcid":false,"given":"Emanuele","family":"Martorana","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grasso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4953-026X","authenticated-orcid":false,"given":"Giovanni","family":"Micale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4825-7617","authenticated-orcid":false,"given":"Salvatore","family":"Alaimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis","family":"Shasha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9843-7638","authenticated-orcid":false,"given":"Rosalba","family":"Giugno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9764-0295","authenticated-orcid":false,"given":"Alfredo","family":"Pulvirenti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,16]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Adamic, L.A., Glance, N.: The political blogosphere and the 2004 U.S. election: divided they blog. In: ACM, pp. 36\u201343 (2005)","DOI":"10.1145\/1134271.1134277"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Ahmed, N., Neville, J., Rossi, R., Duffield, N.: Efficient graphlet counting for large networks. In: ICDM, pp. 1\u201310 (2015)","DOI":"10.1109\/ICDM.2015.141"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Ahmed, N., Neville, J., Rossi, R., Duffield, N.: Fast parallel graphlet counting for large networks. Technical report, arXiv:1506.04322 (2016)","DOI":"10.1109\/ICDM.2015.141"},{"issue":"47","key":"12_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(47), 47\u201397 (2002)","journal-title":"Rev. Mod. Phys."},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-31843-9_52","volume-title":"Graph Drawing","author":"C Bachmaier","year":"2005","unstructured":"Bachmaier, C., Brandenburg, F.J., Forster, M., Holleis, P., Raitner, M.: Gravisto: graph visualization toolkit. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 502\u2013503. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31843-9_52"},{"key":"12_CR6","unstructured":"Batagelj, V., Mrvar, M., Zavesnik, M.: Network analysis of dictionaries. In: Language Technologies, pp. 135\u2013142 (2002)"},{"issue":"25","key":"12_CR7","doi-asserted-by":"publisher","first-page":"15879","DOI":"10.1073\/pnas.252631999","volume":"99","author":"F Chung","year":"2002","unstructured":"Chung, F., Lu, L.: The average distances in random graphs with given expected degrees. Proc. Natl. Acad. Sci. 99(25), 15879\u201315882 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1093\/bfgp\/eln015","volume":"7","author":"G Ciriello","year":"2008","unstructured":"Ciriello, G., Guerra, C.: A review on models and algorithms for motif discovery in protein-protein interaction networks. Brief. Funct. Genomic. Proteomic. 7(2), 147\u201356 (2008)","journal-title":"Brief. Funct. Genomic. Proteomic."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd ACM Symposium on Theory of Computing, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"issue":"6","key":"12_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3369782","volume":"52","author":"M Drobyshevskiy","year":"2019","unstructured":"Drobyshevskiy, M., Turdakov, D.: Random graph modeling: a survey of the concepts. ACM Comput. Surv. 52(6), 1\u201336 (2019)","journal-title":"ACM Comput. Surv."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Jain, D., Patgiri, R.: Network motifs: a survey. In: Advances in Computing and Data Sciences, ICACDS 2019. Communications in Computer and Information Science, vol. 1046 (2019)","DOI":"10.1007\/978-981-13-9942-8_8"},{"key":"12_CR12","first-page":"1","volume":"8","author":"A Jazayeri","year":"2020","unstructured":"Jazayeri, A., Yang, C.: Motif discovery algorithms in static and temporal networks: a survey. J. Complex Netw. 8, 1\u201338 (2020)","journal-title":"J. Complex Netw."},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1186\/1471-2105-10-318","volume":"10","author":"ZRM Kashani","year":"2009","unstructured":"Kashani, Z.R.M., Ahrabian, H., Elahi, E., Nowzari-Dalini, A., Ansari, E.S., et al.: Kavosh: a new algorithm for finding network motifs. BMC Bioinform. 10, 3\u20138 (2009)","journal-title":"BMC Bioinform."},{"issue":"7","key":"12_CR14","doi-asserted-by":"publisher","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.: QuateXelero: an accelerated exact network motif detection algorithm. PLoS ONE 8(7), e68073 (2013)","journal-title":"PLoS ONE"},{"key":"12_CR15","unstructured":"Knuth, D.E.: The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press (1993)"},{"key":"12_CR16","unstructured":"Koskas, M., Grasseau, G., Birmel\u00e9, E., Schbath, S., Robin, S.: NeMo: fast count of network motifs. In: MARAMI 2011: 2. Conf\u00e9rence sur les Mod\u00e8les et l\u2019Analyse des R\u00e9seaux: Approches Math\u00e9matiques et Informatique (2011)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M Kuramochi","year":"2004","unstructured":"Kuramochi, M., Karypis, G.: Finding frequent patterns in a large sparse graph. Data Min. Knowl. Disc. 11, 243\u2013271 (2004)","journal-title":"Data Min. Knowl. Disc."},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Ley, M.: The DBLP computer science bibliography: evolution, research issues, perspectives. In: Proceedings of the International Symposium on String Processing and Information Retrieval, vol. 2476, pp. 1\u201310 (2002)","DOI":"10.1007\/3-540-45735-6_1"},{"issue":"12","key":"12_CR19","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0050093","volume":"7","author":"X Li","year":"2012","unstructured":"Li, X., Stones, D.S., Wang, H., Deng, H., Liu, X., et al.: NetMODE: network motif detection without Nauty. PLoS ONE 7(12), e50093 (2012)","journal-title":"PLoS ONE"},{"key":"12_CR20","first-page":"255","volume":"8","author":"E Martorana","year":"2020","unstructured":"Martorana, E., Micale, G., Ferro, A., Pulvirenti, A.: Establish the expected number of injective motifs on unlabeled graphs through analytical models. Complex Netw. Appl. 8, 255\u2013267 (2020)","journal-title":"Complex Netw. Appl."},{"key":"12_CR21","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":"5","key":"12_CR22","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1109\/TCBB.2014.2321150","volume":"11","author":"LAA Meira","year":"2014","unstructured":"Meira, L.A.A., M\u00e1ximo, V.R., Fazenda, A.L., Concei\u00e7\u00e3o, A.F.: Acc-Motif: accelerated network motif detection. Trans. Comput. Biol. Bioinform. 11(5), 853\u2013862 (2014)","journal-title":"Trans. Comput. Biol. Bioinform."},{"issue":"2","key":"12_CR23","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/s10618-017-0544-8","volume":"32","author":"G Micale","year":"2018","unstructured":"Micale, G., Giugno, R., Ferro, A., Mongiov\u00ec, M., Shasha, D., Pulvirenti, A.: Fast analytical methods for finding significant labeled graph motifs. Data Min. Knowl. Disc. 32(2), 504\u2013531 (2018)","journal-title":"Data Min. Knowl. Disc."},{"key":"12_CR24","unstructured":"Milo, R., Kashtan, N., Itzkovitz, S., Newman, M.E.J., Alon, U.: On the uniform generation of random graphs with prescribed degree sequences. Technical report, 0312028, arXiv (2004)"},{"issue":"5594","key":"12_CR25","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., et al.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"key":"12_CR26","series-title":"Data-Centric Systems and Applications","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-319-96193-4_3","volume-title":"Graph Data Management","author":"M Mongiov\u00ed","year":"2018","unstructured":"Mongiov\u00ed, M., Micale, G., Ferro, A., Giugno, R., Pulvirenti, A., Shasha, D.: gLabTrie: a data structure for motif discovery with constraints. In: Fletcher, G., Hidders, J., Larriba-Pey, J. (eds.) Graph Data Management. DSA, pp. 71\u201395. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96193-4_3"},{"key":"12_CR27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.026118","volume":"64","author":"MEJ Newman","year":"2001","unstructured":"Newman, M.E.J., Strogatz, S.H., Watts, D.J.: Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64, 026118 (2001)","journal-title":"Phys. Rev. E"},{"key":"12_CR28","unstructured":"Opsahl, T.: Why anchorage is not (that) important: binary ties and sample selection. Technical report, Tore Opsahl (2011). http:\/\/toreopsahl.com\/2011\/08\/12"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Ribeiro, P., Silva, F., Kaiser, M.: Strategies for network motifs discovery. In: e-Science 2009 \u2013 5th IEEE International Conference on e-Science, pp. 80\u201387 (2009)","DOI":"10.1109\/e-Science.2009.20"},{"key":"12_CR30","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.026112","volume":"68","author":"J Park","year":"2003","unstructured":"Park, J., Newman, M.: The origin of degree correlations in the internet and other networks. Phys. Rev. E 68, 026112 (2003)","journal-title":"Phys. Rev. E"},{"issue":"4","key":"12_CR31","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1049\/iet-syb.2020.0004","volume":"14","author":"S Patra","year":"2020","unstructured":"Patra, S., Mohapatra, A.: Review of tools and algorithms for network motif discovery in biological networks. IET Syst. Biol. 14(4), 171\u2013189 (2020)","journal-title":"IET Syst. Biol."},{"issue":"1","key":"12_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/cmb.2007.0137","volume":"15","author":"F Picard","year":"2008","unstructured":"Picard, F., Daudin, J.J., Koskas, M., et al.: Assessing the exceptionality of network motifs. J. Comput. Biol. 15(1), 1\u201320 (2008)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"12_CR33","doi-asserted-by":"publisher","first-page":"D767","DOI":"10.1093\/nar\/gkn892","volume":"37","author":"TSK Prasad","year":"2009","unstructured":"Prasad, T.S.K., Goel, R., Kandasamy, K., Keerthikumar, S.: Human protein reference database\u20132009 update. Nucleic Acids Res. 37(1), D767\u2013D772 (2009)","journal-title":"Nucleic Acids Res."},{"key":"12_CR34","unstructured":"Ribeiro, P.: Towards a faster network-centric subgraph census. In: International Conference on Advances in Social Networks Analysis and Mining (2013)"},{"issue":"2","key":"12_CR35","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., 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":"12_CR36","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10618-013-0303-4","volume":"28","author":"P Ribeiro","year":"2014","unstructured":"Ribeiro, P., Silva, F.: G-tries: a data structure for storing and finding subgraphs. Data Min. Knowl. Disc. 28, 337\u2013377 (2014)","journal-title":"Data Min. Knowl. Disc."},{"issue":"1","key":"12_CR37","doi-asserted-by":"publisher","DOI":"10.1186\/1687-4153-2009-616234","volume":"2009","author":"S Schbath","year":"2009","unstructured":"Schbath, S., Lacroix, V., Sagot, M.F.: Assessing the exceptionality of coloured motifs in networks. J. Bioinf. Syst. Biol. 2009(1), 616234 (2009)","journal-title":"J. Bioinf. Syst. Biol."},{"issue":"Suppl. 1","key":"12_CR38","doi-asserted-by":"publisher","first-page":"D449","DOI":"10.1093\/nar\/gkh086","volume":"32","author":"L Salwinski","year":"2004","unstructured":"Salwinski, L., et al.: The database of interacting proteins: 2004 update. Nucleic Acids Res. 32(Suppl. 1), D449\u2013D451 (2004)","journal-title":"Nucleic Acids Res."},{"key":"12_CR39","unstructured":"Schreiber, F., Schw\u00f6bbermeyer, H.: Towards motif detection in networks: frequency concepts and flexible search. In: Proceedings of the International Workshop on Network Tools and Applications in Biology, pp. 91\u2013102 (2004)"},{"issue":"3737","key":"12_CR40","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/11599128_7","volume":"III","author":"F Schreiber","year":"2005","unstructured":"Schreiber, F., Schw\u00f6bbermeyer, H.: Frequency concepts and pattern detection for the analysis of motifs in networks. Trans. Comput. Syst. Biol. III(3737), 89\u2013104 (2005)","journal-title":"Trans. Comput. Syst. Biol."},{"issue":"17","key":"12_CR41","doi-asserted-by":"publisher","first-page":"3572","DOI":"10.1093\/bioinformatics\/bti556","volume":"21","author":"F Schreiber","year":"2005","unstructured":"Schreiber, F., Schw\u00f6bbermeyer, H.: MAVisto: a tool for the exploration of network motifs. Bioinform. Appl. Note 21(17), 3572\u20133574 (2005)","journal-title":"Bioinform. Appl. Note"},{"issue":"8","key":"12_CR42","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/13\/8\/083001","volume":"13","author":"T Squartini","year":"2011","unstructured":"Squartini, T., Garlaschelli, D.: Analytical maximum-likelihood method to detect patterns in real networks. New J. Phys. 13(8), 083001 (2011)","journal-title":"New J. Phys."},{"issue":"3","key":"12_CR43","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1093\/bib\/bbu021","volume":"16","author":"N Tran","year":"2015","unstructured":"Tran, N., Mohan, S., Xu, Z., Huang, C.: Current innovations and future challenges of network motif detection. Brief. Bioinform. 16(3), 497\u2013525 (2015)","journal-title":"Brief. Bioinform."},{"issue":"2","key":"12_CR44","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1001066","volume":"7","author":"L Varshney","year":"2011","unstructured":"Varshney, L., Chen, B., Paniagua, E.: Structural properties of the Caenorhabditis elegans neuronal network. PLoS Comput. Biol. 7(2), e1001066 (2011)","journal-title":"PLoS Comput. Biol."},{"key":"12_CR45","doi-asserted-by":"crossref","unstructured":"Wernicke, S.: A faster algorithm for detecting network motifs. In: Proceedings of the 5th International Conference on Algorithms in Bioinformatics (WABI 2005), pp. 165\u2013177 (2005)","DOI":"10.1007\/11557067_14"},{"key":"12_CR46","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. Bioinform. 3, 347\u2013359 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"9","key":"12_CR47","first-page":"1152","volume":"22","author":"S Wernicke","year":"2006","unstructured":"Wernicke, S., Rasche, F.: FANMOD: a tool for fast network motif detection. Bioinform. Appl. Note 22(9), 1152\u20131153 (2006)","journal-title":"Bioinform. Appl. Note"},{"issue":"2","key":"12_CR48","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1093\/bib\/bbr033","volume":"13","author":"E Wong","year":"2012","unstructured":"Wong, E., Baur, B., Quader, S., Huang, C.: Biological network motif detection: principles and practice. Brief. Bioinform. 13(2), 202\u2013215 (2012)","journal-title":"Brief. Bioinform."},{"key":"12_CR49","doi-asserted-by":"publisher","first-page":"106576","DOI":"10.1109\/ACCESS.2019.2926752","volume":"7","author":"F Xia","year":"2019","unstructured":"Xia, F., Wei, H., Yu, S., Zhang, D., Xu, B.: A survey of measures for network motifs. IEEE Access 7, 106576\u2013106587 (2019)","journal-title":"IEEE Access"},{"key":"12_CR50","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2020.100267","volume":"37","author":"S Yu","year":"2020","unstructured":"Yu, S., Feng, Y., Zhang, D., Bedru, H., Xu, B., Xia, F.: Motif discovery in networks: a survey. Comput. Sci. Rev. 37, 100267 (2020)","journal-title":"Comput. Sci. Rev."},{"key":"12_CR51","doi-asserted-by":"publisher","first-page":"183322","DOI":"10.1109\/ACCESS.2019.2960044","volume":"7","author":"S Yu","year":"2019","unstructured":"Yu, S., Xu, J., Zhang, C., Xia, F., Almakhadmeh, Z., Tolba, A.: Motifs in big networks: methods and applications. IEEE Access 7, 183322\u2013183338 (2019)","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","From Computational Logic to Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-55248-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T11:04:28Z","timestamp":1710500668000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55248-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031552472","9783031552489"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55248-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}