{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T18:13:53Z","timestamp":1794420833132,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642302190","type":"print"},{"value":"9783642302206","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30220-6_18","type":"book-chapter","created":{"date-parts":[[2012,5,9]],"date-time":"2012-05-09T01:37:35Z","timestamp":1336527455000},"page":"205-217","source":"Crossref","is-referenced-by-count":5,"title":["Detecting Multiple Stochastic Network Motifs in Network Data"],"prefix":"10.1007","author":[{"given":"Kai","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"William K.","family":"Cheung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1038\/ng881","volume":"31","author":"S. Shen-Orr","year":"2002","unstructured":"Shen-Orr, S., Milo, R., Mangan, S., Alon, U.: Network motifs in the transcrip- tional regulation network of Escherichia coli. Nature Genetics\u00a031(1), 64\u201368 (2002)","journal-title":"Nature Genetics"},{"issue":"5594","key":"18_CR2","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., Chklovski, D., Alon, U.: Network motifs: Simple building blocks of complex networks. Science\u00a0298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"issue":"5663","key":"18_CR3","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\u00a0303(5663), 1538\u20131541 (2004)","journal-title":"Science"},{"issue":"21","key":"18_CR4","doi-asserted-by":"publisher","first-page":"11980","DOI":"10.1073\/pnas.2133841100","volume":"100","author":"S. Mangan","year":"2003","unstructured":"Mangan, S., Alon, U.: Structure and function of the feedforward loop network motif. PNAS USA\u00a0100(21), 11980\u201311985 (2003)","journal-title":"PNAS USA"},{"issue":"41","key":"18_CR5","doi-asserted-by":"publisher","first-page":"14689","DOI":"10.1073\/pnas.0305199101","volume":"101","author":"J. Berg","year":"2004","unstructured":"Berg, J., Michael, L.: Local graph alignment and motif search in biological networks. PNAS USA\u00a0101(41), 14689\u201314694 (2004)","journal-title":"PNAS USA"},{"issue":"25","key":"18_CR6","doi-asserted-by":"publisher","first-page":"9404","DOI":"10.1073\/pnas.0507841103","volume":"103","author":"R. Jiang","year":"2006","unstructured":"Jiang, R., Tu, Z., Chen, T., Sun, F.: Network motif identification in stochastic networks. PNAS USA\u00a0103(25), 9404\u20139409 (2006)","journal-title":"PNAS USA"},{"issue":"11","key":"18_CR7","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N. Kashtan","year":"2004","unstructured":"Kashtan, N., Itzkovitz, S., Milo, R., Alon, U.: Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics\u00a020(11), 1746\u20131758 (2004)","journal-title":"Bioinformatics"},{"key":"18_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-85565-1_13","volume-title":"Knowledge-Based Intelligent Information and Engineering Systems","author":"K. Juszczyszyn","year":"2008","unstructured":"Juszczyszyn, K., Kazienko, P., Musia\u0142, K.: Local Topology of Social Network Based on Motif Analysis. In: Lovrek, I., Howlett, R.J., Jain, L.C. (eds.) KES 2008, Part II. LNCS (LNAI), vol.\u00a05178, pp. 97\u2013105. Springer, Heidelberg (2008)"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Musial, K., Juszczyszyn, K.: Motif-based analysis of social position influence on interconnection patterns in complex social network. In: Proceedings of First Asian Conference on Intelligent Information and Database Systems, pp. 34\u201339 (2009)","DOI":"10.1109\/ACIIDS.2009.76"},{"issue":"4","key":"18_CR10","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4310\/CIS.2009.v9.n4.a3","volume":"9","author":"R. Jiang","year":"2009","unstructured":"Jiang, R., Chen, T., Sun, F.: Bayesian models and Gibbs sampling strategies for local graph alignment and motif identification in stochastic biological networks. Communications in Information & Systems\u00a09(4), 347\u2013370 (2009)","journal-title":"Communications in Information & Systems"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Liu, K., Cheung, W.K., Liu, J.: Stochastic network motif detection in social media. In: Proceedings of 2011 ICDM Workshop on Data Mining in Networks (2011)","DOI":"10.1109\/ICDMW.2011.159"},{"key":"18_CR12","unstructured":"McKay, B.: Nauty user\u2019s guide (version 2.4). Australian National University (2007)"},{"key":"18_CR13","unstructured":"Garey, M., Johnson, D.: Computers and intractability: A guide to the theory of np-completeness. Freeman San Francisco (1979)"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraphs in the presence of isomorphism. In: Proceedings of 2003 IEEE ICDM, pp. 549\u2013552 (2003)","DOI":"10.1109\/ICDM.2003.1250974"},{"issue":"1","key":"18_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A. Dempster","year":"1977","unstructured":"Dempster, A., Laird, N., Rubin, D.: Maximum likelihood from incomplete data via the EM algorithm. J. of the Royal Statistical Society. Series B\u00a039(1), 1\u201338 (1977)","journal-title":"J. of the Royal Statistical Society. Series B"},{"issue":"3","key":"18_CR16","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1109\/34.990138","volume":"24","author":"M. Figueiredo","year":"2002","unstructured":"Figueiredo, M., Jain, A.: Unsupervised learning of finite mixture models. IEEE Transactions on PAMI\u00a024(3), 381\u2013396 (2002)","journal-title":"IEEE Transactions on PAMI"},{"issue":"4","key":"18_CR17","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1093\/comjnl\/42.4.270","volume":"42","author":"C. Wallace","year":"1999","unstructured":"Wallace, C., Dowe, D.: Minimum message length and kolmogorov complexity. The Computer Journal\u00a042(4), 270\u2013283 (1999)","journal-title":"The Computer Journal"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: Proceedings of the 28th International Conference on Human Factors in Computing Systems, pp. 1361\u20131370 (2010)","DOI":"10.1145\/1753326.1753532"},{"issue":"1","key":"18_CR19","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J. Leskovec","year":"2007","unstructured":"Leskovec, J., Adamic, L., Huberman, B.: The dynamics of viral marketing. ACM Transactions on the Web\u00a01(1), 5\u201344 (2007)","journal-title":"ACM Transactions on the Web"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Kumar, N., Satoor, S., Buck, I.: Fast parallel expectation maximization for gaussian mixture models on gpus using cuda. In: 11th International Conference on High Performance Computing and Communications, pp. 103\u2013109 (2009)","DOI":"10.1109\/HPCC.2009.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30220-6_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:41:00Z","timestamp":1743079260000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30220-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642302190","9783642302206"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30220-6_18","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-30220-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}