{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:13:15Z","timestamp":1779174795013,"version":"3.51.4"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319161112","type":"print"},{"value":"9783319161129","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-16112-9_2","type":"book-chapter","created":{"date-parts":[[2015,3,14]],"date-time":"2015-03-14T13:06:02Z","timestamp":1426338362000},"page":"13-24","source":"Crossref","is-referenced-by-count":26,"title":["Finding Network Motifs Using MCMC Sampling"],"prefix":"10.1007","author":[{"given":"Tanay Kumar","family":"Saha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Al","family":"Hasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"18","key":"2_CR1","doi-asserted-by":"publisher","first-page":"3346","DOI":"10.1093\/bioinformatics\/bth402","volume":"20","author":"I. Albert","year":"2004","unstructured":"Albert, I., Albert, R.: Conserved network motifs allow protein\u2013protein interaction prediction. Bioinformatics\u00a020(18), 3346\u20133352 (2004)","journal-title":"Bioinformatics"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Gjoka, M., Kurant, M., Butts, C.T., Markopoulou, A.: Walking in Facebook: A Case Study of Unbiased Sampling of OSNs. In: Proc. of IEEE INFOCOM, pp. 1\u20139 (2010)","DOI":"10.1109\/INFCOM.2010.5462078"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1214\/aoms\/1177705148","volume":"32","author":"L.A. Goodman","year":"1961","unstructured":"Goodman, L.A.: Snowball sampling. Ann. Math. Statist.\u00a032, 148\u2013170 (1961)","journal-title":"Ann. Math. Statist."},{"key":"2_CR4","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-71681-5_7","volume-title":"Research in Computational Molecular Biology","author":"J.A. Grochow","year":"2007","unstructured":"Grochow, J.A., Kellis, M.: Network motif discovery using subgraph enumeration and symmetry-breaking. In: Speed, T., Huang, H. (eds.) RECOMB 2007. LNCS (LNBI), vol.\u00a04453, pp. 92\u2013106. Springer, Heidelberg (2007)"},{"key":"2_CR5","unstructured":"Itzkovitz, S., Alon, U.: Subgraphs and network motifs in geometric networks. Physical Review E, Statistical, Nonlinear, and Soft Matter Physics"},{"key":"2_CR6","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)"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1186\/1471-2105-10-318","volume":"10","author":"Z. Kashani","year":"2009","unstructured":"Kashani, Z., Ahrabian, H., Elahi, E., Nowzari-Dalini, A., Ansari, E., Asadi, S., Mohammadi, S., Schreiber, F., Masoudi-Nejad, A.: Kavosh: a new algorithm for finding network motifs. BMC Bioinformatics\u00a010(1), 318 (2009)","journal-title":"BMC Bioinformatics"},{"issue":"11","key":"2_CR8","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. J. Bioinformatics\u00a020(11), 1746\u20131758 (2004)","journal-title":"J. Bioinformatics"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Li, X., Stones, D.S., Wang, H., Deng, H., Liu, X., Wang, G.: Netmode: Network motif detection without nauty. PLoS One\u00a07(12) (December 2012)","DOI":"10.1371\/journal.pone.0050093"},{"key":"2_CR10","unstructured":"Milo, R., Kashtan, N., Itzkovitz, S., Newman, M.E.J., Alon, U.: On the uniform generation of random graphs with prescribed degree sequences (May 2004)"},{"key":"2_CR11","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\u00a0298, 824\u2013827 (2002)","journal-title":"Science"},{"issue":"5","key":"2_CR12","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1266\/ggs.84.385","volume":"84","author":"S. Omidi","year":"2009","unstructured":"Omidi, S., Schreiber, F., Masoudi-Nejad, A.: MODA: an efficient algorithm for network motif discovery in biological networks. Genes and Genetic Systems\u00a084(5), 385\u2013395 (2009)","journal-title":"Genes and Genetic Systems"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Ribeiro, P., Silva, F.: G-tries: an efficient data structure for discovering network motifs. In: Proc. ACM Symp. on Applied Computing, pp. 1559\u20131566 (2010)","DOI":"10.1145\/1774088.1774422"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1038\/ng881","volume":"31","author":"S.S. Shen-Orr","year":"2002","unstructured":"Shen-Orr, S.S., Milo, R., Mangan, S., Alon, U.: Network motifs in the transcriptional regulation network of escherichia coli. Nature Genetics\u00a031, 1061\u20134036 (2002)","journal-title":"Nature Genetics"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Wang, P., Lui, J., Ribeiro, B., Towsley, D., Zhao, J., Guan, X.: Efficiently estimating motif statistics of large networks. ACM Trans. Knowl. Discov. Data\u00a09(2) (2014)","DOI":"10.1145\/2629564"},{"issue":"4","key":"2_CR16","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 Transactions on Computational Biology and Bioinformatics\u00a03(4), 347\u2013359 (2006)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"2_CR17","unstructured":"Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: Proc. of 2nd International Conference on Data Mining, pp. 721\u2013724. IEEE Computer Society (2002)"}],"container-title":["Studies in Computational Intelligence","Complex Networks VI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16112-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T22:07:08Z","timestamp":1676930828000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-16112-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319161112","9783319161129"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16112-9_2","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"value":"1860-949X","type":"print"},{"value":"1860-9503","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}