{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:56:17Z","timestamp":1743105377901,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184710"},{"type":"electronic","value":"9783642184727"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18472-7_30","type":"book-chapter","created":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T22:57:30Z","timestamp":1299020250000},"page":"380-393","source":"Crossref","is-referenced-by-count":3,"title":["A Parallel Algorithm for Counting Subgraphs in Complex Networks"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Ribeiro","sequence":"first","affiliation":[]},{"given":"Fernando","family":"Silva","sequence":"additional","affiliation":[]},{"given":"Lu\u00eds","family":"Lopes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"18","key":"30_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-protein interaction prediction. Bioinformatics\u00a020(18), 3346\u20133352 (2004)","journal-title":"Bioinformatics"},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0959-440X(03)00031-9","volume":"13","author":"E. Alm","year":"2003","unstructured":"Alm, E., Arkin, A.P.: Biological networks. Current Opinion in Structural Biology\u00a013(2), 193\u2013202 (2003)","journal-title":"Current Opinion in Structural Biology"},{"issue":"5439","key":"30_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barabasi","year":"1999","unstructured":"Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science\u00a0286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"doi-asserted-by":"crossref","unstructured":"Bordino, I., Donato, D., Gionis, A., Leonardi, S.: Mining large networks with subgraph counting. In: Procs of the 8th IEEE International Conference on Data Mining (ICDM), 6 pp.+ (December 2008)","key":"30_CR4","DOI":"10.1109\/ICDM.2008.109"},{"issue":"9","key":"30_CR5","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1093\/nar\/gkg340","volume":"31","author":"D. Bu","year":"2003","unstructured":"Bu, D., Zhao, Y., Cai, L., Xue, H., Zhu, X., Lu, H., Zhang, J., Sun, S., Ling, L., Zhang, N., Li, G., Chen, R.: Topological structure analysis of the protein-protein interaction network in budding yeast. Nucl. Acids Res.\u00a031(9), 2443\u20132450 (2003)","journal-title":"Nucl. Acids Res."},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1080\/00018730601170527","volume":"56","author":"L. Costa","year":"2007","unstructured":"Costa, L., Rodrigues, F.A., Travieso, G., Villas Boas, P.R.: Characterization of complex networks: A survey of measurements. Advances In Physics\u00a056, 167 (2007)","journal-title":"Advances In Physics"},{"issue":"5","key":"30_CR7","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/TSE.1986.6312961","volume":"12","author":"D.L. Eager","year":"1986","unstructured":"Eager, D.L., Lazowska, E.D., Zahorjan, J.: Adaptive load sharing in homogeneous distributed systems. IEEE Trans. Softw. Eng.\u00a012(5), 662\u2013675 (1986)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"1","key":"30_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1111\/j.1467-9531.2007.00179.x","volume":"37","author":"K. Faust","year":"2007","unstructured":"Faust, K.: Very local structure in social networks. Sociological Methodology\u00a037(1), 209\u2013256 (2007)","journal-title":"Sociological Methodology"},{"unstructured":"Hall, L.A.: Approximation algorithms for scheduling. In: Approximation Algorithms for NP-Hard Problems, USA, pp. 1\u201345. PWS Publishing Co. (1997)","key":"30_CR9"},{"doi-asserted-by":"crossref","unstructured":"Itzkovitz, S., Levitt, R., Kashtan, N., Milo, R., Itzkovitz, M., Alon, U.: Coarse-graining and self-dissimilarity of complex networks. Phys. Rev. E Stat. Nonlin. Soft. Matter. Phys.\u00a071(1 Pt 2) (January 2005)","key":"30_CR10","DOI":"10.1103\/PhysRevE.71.016127"},{"issue":"6804","key":"30_CR11","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1038\/35036627","volume":"407","author":"H. Jeong","year":"2000","unstructured":"Jeong, H., Tombor, B., Albert, R., Oltvai, Z.N., Barab\u00e1si, A.L.: The large-scale organization of metabolic networks. Nature\u00a0407(6804), 651\u2013654 (2000)","journal-title":"Nature"},{"issue":"11","key":"30_CR12","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"},{"doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: IEEE International Conference on Data Mining, p. 313 (2001)","key":"30_CR13","DOI":"10.1109\/ICDM.2001.989534"},{"key":"30_CR14","first-page":"31","volume":"4","author":"C. Matias","year":"2006","unstructured":"Matias, C., Schbath, S., Birmel, E., Daudin, J.-J., Robin, S.: Network motifs: mean and variance for the count. REVSTAT\u00a04, 31\u201335 (2006)","journal-title":"REVSTAT"},{"key":"30_CR15","first-page":"45","volume":"30","author":"B. McKay","year":"1981","unstructured":"McKay, B.: Practical graph isomorphism. Congressus Numerantium\u00a030, 45\u201387 (1981)","journal-title":"Congressus Numerantium"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"3192","DOI":"10.1073\/pnas.0409515102","volume":"102","author":"M. Middendorf","year":"2004","unstructured":"Middendorf, M., Ziv, E., Wiggins, C.: Inferring network mechanisms: The drosophila melanogaster protein interaction network. PNAS\u00a0102, 3192 (2004)","journal-title":"PNAS"},{"issue":"5594","key":"30_CR17","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(5594), 824\u2013827 (2002)","journal-title":"Science"},{"key":"30_CR18","first-page":"4571","volume-title":"SMC","author":"S. Nijssen","year":"2004","unstructured":"Nijssen, S., Kok, J.N.: Frequent graph mining and its application to molecular databases. In: SMC, vol.\u00a0(5), pp. 4571\u20134577. IEEE, Los Alamitos (2004)"},{"doi-asserted-by":"crossref","unstructured":"Picard, F., Daudin, J.-J.J., Koskas, M., Schbath, S., Robin, S.: Assessing the exceptionality of network motifs. J. Comput. Biol. (February 2008)","key":"30_CR19","DOI":"10.1089\/cmb.2007.0137"},{"unstructured":"Schatz, M., Cooper-Balis, E., Bazinet, A.: Parallel network motif finding (2008)","key":"30_CR20"},{"unstructured":"Schreiber, F., Schwobbermeyer, H.: Towards motif detection in networks: Frequency concepts and flexible search. In: Proc. of the Int. Workshop on Network Tools and Applications in Biology (NETTAB 2004), pp. 91\u2013102 (2004)","key":"30_CR21"},{"doi-asserted-by":"crossref","unstructured":"Sporns, O., Kotter, R.: Motifs in brain networks. PLoS Biology 2 (2004)","key":"30_CR22","DOI":"10.1371\/journal.pbio.0020369"},{"doi-asserted-by":"crossref","unstructured":"Wang, C., Parthasarathy, S.: Parallel algorithms for mining frequent structural motifs in scientific data. In: ACM International Conference on Supercomputing (ICS) 2004 (2004)","key":"30_CR23","DOI":"10.1145\/1006209.1006215"},{"unstructured":"Wang, T., Touchman, J.W., Zhang, W., Suh, E.B., Xue, G.: A parallel algorithm for extracting transcription regulatory network motifs. In: IEEE Int. Symposium on Bioinformatic and Bioengineering, pp. 193\u2013200 (2005)","key":"30_CR24"},{"key":"30_CR25","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis : Methods and Applications (Structural Analysis in the Social Sciences)","author":"S. Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K., Iacobucci, D.: Social Network Analysis: Methods and Applications (Structural Analysis in the Social Sciences). Cambridge University Press, Cambridge (November 1994)"},{"issue":"6684","key":"30_CR26","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2019small-world\u2019 networks. Nature\u00a0393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"4","key":"30_CR27","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. Bioinformatics\u00a03(4), 347\u2013359 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"}],"container-title":["Communications in Computer and Information Science","Biomedical Engineering Systems and Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18472-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T03:03:05Z","timestamp":1740970985000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-18472-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184710","9783642184727"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18472-7_30","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}