{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T06:38:58Z","timestamp":1648708738441},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,5,2]],"date-time":"2009-05-02T00:00:00Z","timestamp":1241222400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s11424-009-9161-y","type":"journal-article","created":{"date-parts":[[2009,5,6]],"date-time":"2009-05-06T13:46:11Z","timestamp":1241617571000},"page":"252-259","source":"Crossref","is-referenced-by-count":1,"title":["Method for quickly inferring the mechanisms of large-scale complex networks based on the census of subgraph concentrations"],"prefix":"10.1007","volume":"22","author":[{"given":"Bo","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaorong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,5,2]]},"reference":[{"issue":"2","key":"9161_CR1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"M. E. J. Newman, The structure and function of complex networks, SIAM Review, 2003, 45(2): 167\u2013256.","journal-title":"SIAM Review"},{"issue":"1","key":"9161_CR2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"R. Albert and A. L. Barab\u00e1si, Statistical mechanics of complex networks, Rev. Mod. Phys., 2002, 74(1): 47\u201397.","journal-title":"Rev. Mod. Phys."},{"issue":"6684","key":"9161_CR3","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"D. J. Watts and S. H. Strogatz, Collective dynamics of small-world networks, Nature, 1998, 393(6684): 440\u2013442.","journal-title":"Nature"},{"issue":"10","key":"9161_CR4","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"A. L. Barab\u00e1si and R. Albert, Emergence of scaling in random networks, Science, 1999, 286(10): 509\u2013512.","journal-title":"Science"},{"issue":"9","key":"9161_CR5","doi-asserted-by":"crossref","first-page":"3192","DOI":"10.1073\/pnas.0409515102","volume":"102","author":"M Middendorf","year":"2005","unstructured":"M. Middendorf, E. Ziv, and C. H. Wiggins, Inferring network mechanisms: The Drosophila melanogaster protein interaction network, PNAS USA, 2005, 102(9): 3192\u20133197.","journal-title":"PNAS USA"},{"issue":"1","key":"9161_CR6","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Y. Freund and R. E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, J. of Computer and System Sciences, 1997, 55(1): 119\u2013139.","journal-title":"J. of Computer and System Sciences"},{"issue":"52","key":"9161_CR7","doi-asserted-by":"crossref","first-page":"17940","DOI":"10.1073\/pnas.0406024101","volume":"101","author":"A V\u00e1zquez","year":"2004","unstructured":"A. V\u00e1zquez, R. Dobrin, D. Sergi, J. P. Eckmann, Z. N. Oltvai, and A. L. Barab\u00e1si, The topological relationship between the large-scale attributes and local interaction patterns of complex networks, PNAS USA, 2004, 101(52): 17940\u201317945.","journal-title":"PNAS USA"},{"key":"9161_CR8","first-page":"1","volume":"76","author":"WK Xiao","year":"2007","unstructured":"W. K. Xiao, J. Ren, F. Qi, Z. W. Song, M. X. Zhu, H. F. Yang, H. Y. Jin, B. H. Wang, and T. Zhou, Empirical study on clique-degree distribution of networks, Phys. Rev. E, 2007, 76: 1\u20134.","journal-title":"Phys. Rev. E"},{"issue":"2","key":"9161_CR9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1093\/bioinformatics\/btl301","volume":"23","author":"N Pr\u017eulj","year":"2006","unstructured":"N. Pr\u017eulj, Biological network comparison using graphlet degree distribution, Bioinformatics, 2006, 23(2): 177\u2013183.","journal-title":"Bioinformatics"},{"key":"9161_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1103\/PhysRevE.71.025103","volume":"71","author":"A V\u00e1zquez","year":"2005","unstructured":"A. V\u00e1zquez, J. G. Oliveira, and A. L. Barab\u00e1si, Inhomogeneous evolution of subgraphs and cycles in complex networks, Phys. Rev. E, 2005, 71: 1\u20134.","journal-title":"Phys. Rev. E"},{"issue":"11","key":"9161_CR11","doi-asserted-by":"crossref","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N Kashtan","year":"2004","unstructured":"N. Kashtan, S. Itzkovitz, R. Milo, and U. Alon, Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs, Bioinformatics, 2004, 20(11): 1746\u20131758.","journal-title":"Bioinformatics"},{"key":"9161_CR12","first-page":"165","volume":"3692","author":"S Wernicke","year":"2005","unstructured":"S. Wernicke, A faster algorithm for detecting network motifs, Lecture Notes in Bioinformatics, 2005, 3692: 165\u2013177.","journal-title":"Lecture Notes in Bioinformatics"},{"issue":"3","key":"9161_CR13","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N Alon","year":"1997","unstructured":"N. Alon, R. Yuster, and U. Zwick, Finding and counting given length cycles, Algorithmica, 1997, 17(3): 209\u2013223.","journal-title":"Algorithmica"},{"issue":"2","key":"9161_CR14","first-page":"415","volume":"26","author":"J Nesetril","year":"1985","unstructured":"J. Nesetril and S. Poljak, On the complexity of the subgraph problem, Commen. Math. Univ. Carol., 1985, 26(2): 415\u2013419.","journal-title":"Commen. Math. Univ. Carol."},{"issue":"3","key":"9161_CR15","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1137\/S0097539793247634","volume":"24","author":"RA Duke","year":"1995","unstructured":"R. A. Duke, H. Lefmann, and V. Rodl, A fast approximation algorithm for computing the frequencies of subgraphs in a given graph, SIAM J. on Computing, 1995, 24(3): 598\u2013620.","journal-title":"SIAM J. on Computing"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-009-9161-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-009-9161-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-009-9161-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T23:50:24Z","timestamp":1589759424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-009-9161-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,2]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["9161"],"URL":"https:\/\/doi.org\/10.1007\/s11424-009-9161-y","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,2]]}}}