{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:15:27Z","timestamp":1726060527034},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030366827"},{"type":"electronic","value":"9783030366834"}],"license":[{"start":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T00:00:00Z","timestamp":1574640000000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-36683-4_21","type":"book-chapter","created":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T17:08:15Z","timestamp":1574788095000},"page":"255-267","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Establish the Expected Number of Injective Motifs on Unlabeled Graphs Through Analytical Models"],"prefix":"10.1007","author":[{"given":"Emanuele","family":"Martorana","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Micale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Ferro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Pulvirenti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,25]]},"reference":[{"issue":"18","key":"21_CR1","doi-asserted-by":"publisher","first-page":"2283","DOI":"10.1093\/bioinformatics\/btl370","volume":"22","author":"J Chen","year":"2006","unstructured":"Chen, J., Yuan, B.: Detecting functional modules in the yeast protein-protein interaction network. Bioinformatics 22(18), 2283\u20132290 (2006)","journal-title":"Bioinformatics"},{"issue":"25","key":"21_CR2","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":"21_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s11222-007-9046-7","volume":"18","author":"JJ Daudin","year":"2008","unstructured":"Daudin, J.J., Picard, F., Robin, S.: A mixture model for random graphs. Stat. Comput. 18(2), 173\u2013183 (2008)","journal-title":"Stat. Comput."},{"key":"21_CR4","first-page":"290","volume":"6","author":"P Erdos","year":"1959","unstructured":"Erdos, P., Renyi, A.: On random graphs. Publ. Math. 6, 290\u2013297 (1959)","journal-title":"Publ. Math."},{"key":"21_CR5","unstructured":"Johnson, N.L., Kotz, S., Kemp, A.W.: Univariate Discrete Distributions. Wiley (1992)"},{"key":"21_CR6","first-page":"109","volume":"31","author":"W Kocay","year":"1981","unstructured":"Kocay, W.: An extension of Kelly\u2019s lemma to spanning subgraphs. Congr. Numer. 31, 109\u2013120 (1981)","journal-title":"Congr. Numer."},{"issue":"2","key":"21_CR7","doi-asserted-by":"publisher","first-page":"1","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. Discov. 32(2), 1\u201328 (2018)","journal-title":"Data Min. Knowl. Discov."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Micale, G., Pulvirenti, A., Ferro, A., Giugno, R., Shasha, D.: Fast methods for finding significant motifs on labelled multi-relational networks. J. Complex Netw. cnz008 (2019)","DOI":"10.1093\/comnet\/cnz008"},{"key":"21_CR9","first-page":"1","volume":"0312028","author":"R Milo","year":"2004","unstructured":"Milo, R., Kashtan, N., Itzkovitz, S., et al.: On the uniform generation of random graphs with prescibed degree sequences. Cond. Mat. 0312028, 1\u20134 (2004)","journal-title":"Cond. Mat."},{"issue":"5594","key":"21_CR10","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":"21_CR11","doi-asserted-by":"publisher","first-page":"026118","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":"21_CR12","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1198\/016214501753208735","volume":"96","author":"K Nowicki","year":"2001","unstructured":"Nowicki, K., Snijders, T.: Estimation and prediction for stochastic block structures. J. Am. Stat. Assoc. 96, 1077\u20131087 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"026112","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":"1","key":"21_CR14","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":"11","key":"21_CR15","doi-asserted-by":"publisher","first-page":"e343","DOI":"10.1371\/journal.pbio.0030343","volume":"3","author":"R Prill","year":"2005","unstructured":"Prill, R., Iglesias, P.A., Levchenko, A.: Dynamic properties of network motifs contribute to biological network organization. PLoS Biol. 3(11), e343 (2005)","journal-title":"PLoS Biol."},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1038\/ng881","volume":"31","author":"SS Shen-Orr","year":"2002","unstructured":"Shen-Orr, S.S., Milo, R., Mangan, S., et al.: Network motifs in the transcriptional regulation network of Escherichia coli. Nat. Genet. 31, 64\u201368 (2002)","journal-title":"Nat. Genet."},{"issue":"8","key":"21_CR17","doi-asserted-by":"publisher","first-page":"083001","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":"4","key":"21_CR18","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":["Studies in Computational Intelligence","Complex Networks and Their Applications VIII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36683-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T17:10:10Z","timestamp":1574788210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36683-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,25]]},"ISBN":["9783030366827","9783030366834"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36683-4_21","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2019,11,25]]},"assertion":[{"value":"25 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}