{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T16:48:46Z","timestamp":1725814126440},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319143125"},{"type":"electronic","value":"9783319143132"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-14313-2_17","type":"book-chapter","created":{"date-parts":[[2014,12,11]],"date-time":"2014-12-11T01:56:46Z","timestamp":1418263006000},"page":"194-205","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Scalable Parallel Approach for Subgraph Census Computation"],"prefix":"10.1007","author":[{"given":"David","family":"Aparicio","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Paredes","sequence":"additional","affiliation":[]},{"given":"Pedro","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/ICDE.2013.6544814","volume-title":"IEEE 29th International Conference on Data Engineering (ICDE)","author":"F.N. Afrati","year":"2013","unstructured":"Afrati, F.N., Fotakis, D., Ullman, J.D.: Enumerating subgraph instances using map-reduce. In: IEEE 29th International Conference on Data Engineering (ICDE), pp. 62\u201373. IEEE CS, Los Alamitos (2013)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Aparicio, D., Ribeiro, P., Silva, F.: Parallel subgraph counting for multicore architectures. In: IEEE International Symposium on Parallel and Distributed Processing with Applications. IEEE CS (August 2014)","DOI":"10.1109\/ISPA.2014.14"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Grochow, J., Kellis, M.: Network motif discovery using subgraph enumeration and symmetry-breaking. Research in Computational Molecular Biology, 92\u2013106 (2007)","DOI":"10.1007\/978-3-540-71681-5_7"},{"issue":"1","key":"17_CR4","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"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Khakabimamaghani, S., Sharafuddin, I., Dichter, N., Koch, I., Masoudi-Nejad, A.: Quatexelero: An accelerated exact network motif detection algorithm. PLoS One\u00a08(7), e68073 (2013)","DOI":"10.1371\/journal.pone.0068073"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network Motifs: Simple Building Blocks of Complex Networks. Science 298(5594) (2002)","DOI":"10.1126\/science.298.5594.824"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/2492517.2492535","volume-title":"Proceedings of the 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining","author":"P. Paredes","year":"2013","unstructured":"Paredes, P., Ribeiro, P.: Towards a faster network-centric subgraph census. In: Proceedings of the 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 264\u2013271. ACM, NY (2013)"},{"issue":"6","key":"17_CR8","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1093\/bioinformatics\/btq091","volume":"26","author":"N. Pr\u017eulj","year":"2010","unstructured":"Pr\u017eulj, N.: Biological network comparison using graphlet degree distribution. Bioinformatics\u00a026(6), 853\u2013854 (2010)","journal-title":"Bioinformatics"},{"key":"17_CR9","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 Mining and Knowledge Discovery\u00a028, 337\u2013377 (2014)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Ribeiro, P., Silva, F., Kaiser, M.: Strategies for network motifs discovery. In: IEEE International Conference on e-Science, pp. 80\u201387. e-Science (2009)","DOI":"10.1109\/e-Science.2009.20"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Ribeiro, P., Silva, F., Lopes, L.: Efficient parallel subgraph counting using g-tries. In: IEEE International Conference on Cluster Computing (Cluster), pp. 1559\u20131566. IEEE CS (September 2010)","DOI":"10.1109\/CLUSTER.2010.27"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.jpdc.2011.08.007","volume":"72","author":"P. Ribeiro","year":"2012","unstructured":"Ribeiro, P., Silva, F., Lopes, L.: Parallel discovery of network motifs. Journal of Parallel and Distributed Computing\u00a072, 144\u2013154 (2012)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-46632-0_5","volume-title":"Algorithms and Computations","author":"P. Sanders","year":"1999","unstructured":"Sanders, P.: Asynchronous random polling dynamic load balancing. In: Aggarwal, A.K., Pandu Rangan, C. (eds.) ISAAC 1999. LNCS, vol.\u00a01741, pp. 37\u201348. Springer, Heidelberg (1999)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Slota, G.M., Madduri, K.: Fast approximate subgraph counting and enumeration. In: 42nd International Conference on Parallel Processing, pp. 210\u2013219 (2013)","DOI":"10.1109\/ICPP.2013.30"},{"key":"17_CR15","unstructured":"Wang, T., Touchman, J.W., Zhang, W., Suh, E.B., Xue, G.: A parallel algorithm for extracting transcription regulatory network motifs. In: IEEE International Symposium on Bioinformatics and Bioengineering, pp. 193\u2013200 (2005)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Wernicke, S.: Efficient detection of network motifs. IEEE\/ACM Transactions on Computational Biology and Bioinformatics, 347\u2013359 (2006)","DOI":"10.1109\/TCBB.2006.51"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Zhao, Z., Wang, G., Butt, A.R., Khan, M., Kumar, V.A., Marathe, M.V.: Sahad: Subgraph analysis in massive networks using hadoop. In: International Parallel and Distributed Processing Symposium, pp. 390\u2013401 (2012)","DOI":"10.1109\/IPDPS.2012.44"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2014: Parallel Processing Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14313-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:24:16Z","timestamp":1587342256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14313-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319143125","9783319143132"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14313-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}