{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:07:06Z","timestamp":1725815226741},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662460771"},{"type":"electronic","value":"9783662460788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46078-8_38","type":"book-chapter","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T14:54:29Z","timestamp":1421247269000},"page":"463-474","source":"Crossref","is-referenced-by-count":3,"title":["Discovering Motifs in Real-World Social Networks"],"prefix":"10.1007","author":[{"given":"Lotte","family":"Romijn","sequence":"first","affiliation":[]},{"given":"Breannd\u00e1n \u00d3.","family":"Nuall\u00e1in","sequence":"additional","affiliation":[]},{"given":"Leen","family":"Torenvliet","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"13","key":"38_CR1","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1093\/bioinformatics\/btn163","volume":"24","author":"N. Alon","year":"2008","unstructured":"Alon, N., Dao, P., Hajirasouliha, I., Hormozdiari, F., Sahinalp, S.C.: Biomolecular network motif counting and discovery by color coding. Bioinformatics\u00a024(13), 241\u2013249 (2008)","journal-title":"Bioinformatics"},{"issue":"4","key":"38_CR2","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. Journal of the ACM\u00a042(4), 844\u2013856 (1995)","journal-title":"Journal of the ACM"},{"key":"38_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-36136-7_40","volume-title":"Algorithms and Computation","author":"V. Arvind","year":"2002","unstructured":"Arvind, V., Raman, V.: Approximation algorithms for some parameterized counting problems. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 453\u2013464. Springer, Heidelberg (2002)"},{"issue":"5935","key":"38_CR4","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1126\/science.1173299","volume":"325","author":"A.L. Barab\u00e1si","year":"2009","unstructured":"Barab\u00e1si, A.L.: Scale-free networks: A decade and beyond. Science\u00a0325(5935), 412\u2013413 (2009)","journal-title":"Science"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Boldi, P., Castillio, C., Gionis, A.: Efficcient semi-streaming algorithms for local triangle counting in massive graphs. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 16\u201324 (2008)","DOI":"10.1145\/1401890.1401898"},{"issue":"3","key":"38_CR6","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"H. Bodlaender","year":"2008","unstructured":"Bodlaender, H., Koster, A.: Combinatorial optimization on graphs of bounded treewidth. The Computer Journal\u00a051(3), 255\u2013269 (2008)","journal-title":"The Computer Journal"},{"key":"38_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-95995-3_2","volume-title":"Algorithms and Models for the Web-Graph","author":"M. Gonen","year":"2009","unstructured":"Gonen, M., Shavitt, Y.: Approximating the number of network motifs. In: Avrachenkov, K., Donato, D., Litvak, N. (eds.) WAW 2009. LNCS, vol.\u00a05427, pp. 13\u201324. Springer, Heidelberg (2009)"},{"key":"38_CR9","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. Grochow","year":"2007","unstructured":"Grochow, J., 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":"38_CR10","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/s00453-007-9008-7","volume":"52","author":"F. H\u00fcffner","year":"2007","unstructured":"H\u00fcffner, F., Wernicke, S., Zickner, T.: Algorithm engineering for color-coding with applications to signaling pathway detection. Algorithmica\u00a052, 114\u2013132 (2007)","journal-title":"Algorithmica"},{"issue":"5594","key":"38_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., Cashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science\u00a0298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"key":"38_CR12","first-page":"216","volume":"150","author":"N. Przulj","year":"2005","unstructured":"Przulj, N., Corneil, D., Jurisica, I.: Modelling interactome: Scale-free or geometric. Bioinformatics\u00a0150, 216\u2013231 (2005)","journal-title":"Bioinformatics"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.: The complexity of approximate counting. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pp. 118\u2013126 (1983)","DOI":"10.1145\/800061.808740"},{"issue":"1","key":"38_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"22","author":"J. Ullmann","year":"1976","unstructured":"Ullmann, J.: An algorithm for subgraph isomorphism. Journal of the Association for Computing Machinery\u00a022(1), 31\u201342 (1976)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"38_CR15","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D. Watts","year":"1998","unstructured":"Watts, D., Strogatz, S.: Collective dynamics of \u201csmall-world\u201d networks. Nature\u00a0393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"Zhao, Z., Khan, M., Kumar, V., Marathe, M.: Subgraph enumeration in large social contact networks using parallel color coding and streaming. In: Proceedings of the 39th Conference on Parallel Processing, pp. 594\u2013603 (2010)","DOI":"10.1109\/ICPP.2010.67"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2015: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46078-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T18:31:13Z","timestamp":1566239473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46078-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460771","9783662460788"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46078-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}