{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:58:42Z","timestamp":1648612722021},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,8,15]],"date-time":"2009-08-15T00:00:00Z","timestamp":1250294400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci. China"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s11704-009-0045-z","type":"journal-article","created":{"date-parts":[[2009,8,14]],"date-time":"2009-08-14T02:58:53Z","timestamp":1250218733000},"page":"412-416","source":"Crossref","is-referenced-by-count":2,"title":["Evaluation of subgraph searching algorithms detecting network motif in biological networks"],"prefix":"10.1007","volume":"3","author":[{"given":"Jialu","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guimin","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,8,15]]},"reference":[{"issue":"5","key":"45_CR1","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1038\/ng1340","volume":"36","author":"S. A. Teichmann","year":"2004","unstructured":"Teichmann S A, Babu M M. Gene regulatory network growth by duplication. Nature Genetics, 2004, 36(5): 492\u2013496","journal-title":"Nature Genetics"},{"issue":"5594","key":"45_CR2","doi-asserted-by":"crossref","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, et al. Network motifs: simple building blocks of complex networks. Science, 2002, 298(5594): 824\u2013827","journal-title":"Science"},{"issue":"16","key":"45_CR3","doi-asserted-by":"crossref","first-page":"5934","DOI":"10.1073\/pnas.0306752101","volume":"101","author":"E. Yeger-Lotem","year":"2004","unstructured":"Yeger-Lotem E, Sattath S, Kashtan N, et al. Network motifs in integrated cellular networks of transcription-regulation and protein-protein interaction. In: Proceedings of the National Academy of Sciences, 2004, 101(16): 5934\u20135939","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"1","key":"45_CR4","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1038\/ng881","volume":"31","author":"S. Shen-Orr","year":"2002","unstructured":"Shen-Orr S, Milo R, Mangan S, et al. Network motifs in the transcriptional regulation network of Escherichia coli. Nature Genetics, 2002, 31(1): 64\u201368","journal-title":"Nature Genetics"},{"key":"45_CR5","unstructured":"Schreiber F, Schwbbermeyer H. Towards motif detection in networks: frequency concepts and flexible search. In: Proceedings of Intl. Wsh. Network Tools and Applications in Biology, 2004, 91\u2013102"},{"issue":"5594","key":"45_CR6","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1126\/science.1075090","volume":"298","author":"T. I. Lee","year":"2002","unstructured":"Lee T I, Nical J R, Francois R, et al. Transcriptional regulatory networks in saccharomyces cerevisiae. Science, 2002, 298(5594): 799\u2013804","journal-title":"Science"},{"issue":"21","key":"45_CR7","doi-asserted-by":"crossref","first-page":"11980","DOI":"10.1073\/pnas.2133841100","volume":"100","author":"S. Mangan","year":"2003","unstructured":"Mangan S, Alon U. Structure and function of the feed-forward loop network motif. In: Proceedings of the National Academy of Sciences, 2003, 100(21): 11980\u201311985","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T, Motoda H. An apriori-based algorithm for mining frequent substructures from graph data. In: Proceedings of European Conference on Principles of Data Mining and Knowledge Discovery, 2000, 13\u201323","DOI":"10.1007\/3-540-45372-5_2"},{"key":"45_CR9","unstructured":"Yan X, Han J. gSpan: graph-based substructure pattern mining. In: Proceedings of IEEE International Conference on Data Mining, 2002, 721\u2013723"},{"issue":"11","key":"45_CR10","doi-asserted-by":"crossref","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N. Kashtan","year":"2004","unstructured":"Kashtan N, Itzkovitz S, Milo R, et al. Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics, 2004, 20(11): 1746\u20131758","journal-title":"Bioinformatics"},{"issue":"4","key":"45_CR11","doi-asserted-by":"crossref","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 Bioinformatics, 2006, 3(4): 347\u2013359","journal-title":"IEEE\/ACM Transactions on Computational Biology Bioinformatics"},{"key":"45_CR12","doi-asserted-by":"crossref","first-page":"06127","DOI":"10.1103\/PhysRevE.68.026127","volume":"68","author":"S. Itzkovitz","year":"2003","unstructured":"Itzkovitz S, Milo R, Kastan N, et al. Subgraphs in random networks. Physical Review E, 2003, 68, 06127","journal-title":"Physical Review E"},{"key":"45_CR13","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"D. B. Johnson","year":"1975","unstructured":"Johnson D B. Finding all the elementary circuits of a directed graph. SIAM Journal on Computing, 1975, 4: 77\u201384","journal-title":"SIAM Journal on Computing"},{"key":"45_CR14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N. Alon","year":"1997","unstructured":"Alon N, Yuster R, Zwick U. Finding and counting given length cycles. Algorithmica, 1997, 17: 209\u2013223","journal-title":"Algorithmica"},{"key":"45_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0202001","volume":"2","author":"E. Akkoyunlu","year":"1973","unstructured":"Akkoyunlu E. The enumeration of maximal cliques of large graphs. SIAM Journal on Computing, 1973, 2: 1\u20136","journal-title":"SIAM Journal on Computing"},{"key":"45_CR16","first-page":"415","volume":"26","author":"J. Nesetril","year":"1985","unstructured":"Nesetril J, Poljak S. On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae, 1985, 26: 415\u2013419","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"45_CR17","unstructured":"Dyer M, Frieze A, Jerrum M. Approximately counting Hamilton cycles in dense graphs. In: Proceedings of the 5th Annual ACM\/SIAM Symposium on Discrete Algorithms, 1994, 336\u2013343"},{"issue":"2","key":"45_CR18","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s004930050052","volume":"19","author":"A. Frieze","year":"1999","unstructured":"Frieze A, Kannan R. Quick approximation to matrices and applications. Combinatorica, 1999, 19(2): 175\u2013220","journal-title":"Combinatorica"},{"key":"45_CR19","doi-asserted-by":"crossref","unstructured":"Jerrum M. Counting, Sampling and Integrating: Algorithms and Complexity. Birkhauser Verlag, 2003","DOI":"10.1007\/978-3-0348-8005-3"},{"key":"45_CR20","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1016\/j.physa.2007.02.102","volume":"381","author":"R. Itzhack","year":"2007","unstructured":"Itzhack R, Mogilevski Y, Louzoun Y. An optimal algorithm for counting network motifs. Physica A, 2007, 381: 482\u2013490","journal-title":"Physica A"},{"issue":"9","key":"45_CR21","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1093\/bioinformatics\/btl038","volume":"22","author":"S. Wernicke","year":"2006","unstructured":"Wernicke S, Rasche F. FANMOD: a tool for fast network motif detection. Bioinformatics, 2006, 22(9): 1152\u20131153","journal-title":"Bioinformatics"}],"container-title":["Frontiers of Computer Science in China"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-009-0045-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-009-0045-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-009-0045-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T21:01:13Z","timestamp":1559422873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-009-0045-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,15]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["45"],"URL":"https:\/\/doi.org\/10.1007\/s11704-009-0045-z","relation":{},"ISSN":["1673-7350","1673-7466"],"issn-type":[{"value":"1673-7350","type":"print"},{"value":"1673-7466","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,15]]}}}