{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T04:21:53Z","timestamp":1777695713740,"version":"3.51.4"},"reference-count":29,"publisher":"SAGE Publications","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2018,12,18]]},"DOI":"10.3233\/ida-173681","type":"journal-article","created":{"date-parts":[[2018,12,18]],"date-time":"2018-12-18T12:42:14Z","timestamp":1545136934000},"page":"1279-1296","source":"Crossref","is-referenced-by-count":1,"title":["Discovering frequent induced subgraphs from directed networks"],"prefix":"10.1177","volume":"22","author":[{"given":"Sen","family":"Zhang","sequence":"first","affiliation":[{"name":"Department of Mathematics, Computer Science and Statistics, State University of New York (SUNY) College at Oneonta, New York, NY 13820, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihui","family":"Du","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason T. L.","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haodi","family":"Jiang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/IDA-173681_ref1","unstructured":"R. Agrawal and R. Srikant, Fast algorithms for mining association rules, in: Proceedings of the 20th International Conference on Very Large Data Bases, 1994, pp. 487\u2013499."},{"key":"10.3233\/IDA-173681_ref2","doi-asserted-by":"crossref","unstructured":"R. Bonneau, D.J. Reiss, P. Shannon, M. Facciotti, L. Hood, N.S. Baliga and V. Thorsson, The Inferelator: An algorithm for learning parsimonious regulatory networks from systems biology data sets de novo, Genome Biology 7(5) (2006).","DOI":"10.1186\/gb-2006-7-5-r36"},{"key":"10.3233\/IDA-173681_ref3","doi-asserted-by":"crossref","first-page":"S13","DOI":"10.1186\/1471-2105-14-S7-S13","article-title":"A subgraph isomorphism algorithm and its application to biochemical data","volume":"14","author":"Bonnici","year":"2013","journal-title":"BMC Bioinformatics"},{"key":"10.3233\/IDA-173681_ref8","doi-asserted-by":"crossref","unstructured":"J.J. Faith, B. Hayete, J.T. Thaden, I. Mogno, J. Wierzbowski, G. Cottarel, S. Kasif, J.J. Collins and T.S. Gardner, Large-scale mapping and validation of Escherichia coli transcriptional regulation from a compendium of expression profiles, PLoS Biology 5(1) (2007).","DOI":"10.1371\/journal.pbio.0050008"},{"issue":"1","key":"10.3233\/IDA-173681_ref9","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.14778\/1920841.1920986","article-title":"Graph homomorphism revisited for graph matching","volume":"3","author":"Fan","year":"2010","journal-title":"Proceedings of the VLDB Endowment"},{"key":"10.3233\/IDA-173681_ref10","doi-asserted-by":"crossref","unstructured":"J. Huan, W. Wang and J. Prins, Efficient mining of frequent subgraphs in the presence of isomorphism, in: Proceedings of the 3rd IEEE International Conference on Data Mining, 2003, pp. 549\u2013552.","DOI":"10.1109\/ICDM.2003.1250974"},{"issue":"9","key":"10.3233\/IDA-173681_ref11","doi-asserted-by":"crossref","first-page":"e12776","DOI":"10.1371\/journal.pone.0012776","article-title":"Inferring regulatory networks from expression data using tree-based methods","volume":"5","author":"Huynh-Thu","year":"2010","journal-title":"PLoS One"},{"issue":"10","key":"10.3233\/IDA-173681_ref12","doi-asserted-by":"crossref","first-page":"1614","DOI":"10.1093\/bioinformatics\/btu863","article-title":"Combining tree-based and dynamical systems for the inference of gene regulatory networks","volume":"31","author":"Huynh-Thu","year":"2015","journal-title":"Bioinformatics"},{"issue":"3","key":"10.3233\/IDA-173681_ref13","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1021726221443","article-title":"Complete mining of frequent patterns from graphs: Mining graph data","volume":"50","author":"Inokuchi","year":"2003","journal-title":"Machine Learning"},{"key":"10.3233\/IDA-173681_ref14","first-page":"53","article-title":"A General framework for mining frequent subgraphs from labeled graphs","volume":"66","author":"Inokuchi","year":"2005","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"10.3233\/IDA-173681_ref15","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1017\/S0269888912000331","article-title":"A survey of frequent subgraph mining algorithms","volume":"28","author":"Jiang","year":"2013","journal-title":"The Knowledge Engineering Review"},{"issue":"4","key":"10.3233\/IDA-173681_ref16","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/2629550","article-title":"The complexity of mining maximal frequent subgraphs","volume":"39","author":"Kimelfeld","year":"2014","journal-title":"ACM Transactions on Database Systems"},{"key":"10.3233\/IDA-173681_ref17","doi-asserted-by":"crossref","unstructured":"M. Kuramochi and G. Karypis, Finding frequent patterns in a large sparse graph, in: Proceedings of the SIAM International Conference on Data Mining, 2004.","DOI":"10.1137\/1.9781611972740.32"},{"key":"10.3233\/IDA-173681_ref18","doi-asserted-by":"crossref","unstructured":"Y. Li, Q. Lin, G. Zhong, D. Duan, Y. Jin and W. Bi, A directed labeled graph frequent pattern mining algorithm based on minimum code, in: Proceedings of the International Conference on Multimedia and Ubiquitous Engineering, 2009, pp. 353\u2013359.","DOI":"10.1109\/MUE.2009.67"},{"issue":"14","key":"10.3233\/IDA-173681_ref20","doi-asserted-by":"crossref","first-page":"6286","DOI":"10.1073\/pnas.0913357107","article-title":"Revealing strengths and weaknesses of methods for gene network inference","volume":"107","author":"Marbach","year":"2010","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"10.3233\/IDA-173681_ref21","doi-asserted-by":"crossref","unstructured":"N. Matsumura, D.E. Goldberg and X. Llora, Mining directed social network from message board, in: Proceedings of the 14th International Conference on World Wide Web, 2005, pp. 1092\u20131093.","DOI":"10.1145\/1062745.1062884"},{"issue":"1","key":"10.3233\/IDA-173681_ref23","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.entcs.2004.12.039","article-title":"The Gaston tool for frequent subgraph mining","volume":"127","author":"Nijssen","year":"2005","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"4","key":"10.3233\/IDA-173681_ref25","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1007\/s12038-015-9558-9","article-title":"Semi-supervised prediction of gene regulatory networks using machine learning algorithms","volume":"40","author":"Patel","year":"2015","journal-title":"Journal of Biosciences"},{"key":"10.3233\/IDA-173681_ref26","doi-asserted-by":"crossref","unstructured":"D. Shasha, J.T.L. Wang and R. Giugno, Algorithmics and applications of tree and graph searching, in: Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2002, pp. 39\u201352.","DOI":"10.1145\/543619.543620"},{"issue":"1","key":"10.3233\/IDA-173681_ref27","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","article-title":"An algorithm for subgraph isomorphism","volume":"23","author":"Ullmann","year":"1976","journal-title":"J. ACM"},{"issue":"1\u20132","key":"10.3233\/IDA-173681_ref28","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0020-0255(94)00057-I","article-title":"Algorithms for approximate graph matching","volume":"82","author":"Wang","year":"1995","journal-title":"Information Sciences"},{"issue":"4","key":"10.3233\/IDA-173681_ref29","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1109\/TKDE.2002.1019211","article-title":"Finding patterns in three dimensional graphs: Algorithms and applications to scientific data mining","volume":"14","author":"Wang","year":"2002","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-173681_ref30","unstructured":"X. Yan and J. Han, gSpan: Graph-based substructure pattern mining, in: Proceedings of the 2002 IEEE International Conference on Data Mining, 2002."},{"key":"10.3233\/IDA-173681_ref31","doi-asserted-by":"crossref","unstructured":"W.C. Young, A.E. Raftery and K.Y. Yeung, Fast Bayesian inference for gene regulatory networks using ScanBMA, BMC Systems Biology 8(1) (2014).","DOI":"10.1186\/1752-0509-8-47"},{"key":"10.3233\/IDA-173681_ref32","doi-asserted-by":"crossref","unstructured":"M.J. Zaki, Efficiently mining frequent trees in a forest, in: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2002.","DOI":"10.1145\/775047.775058"},{"issue":"6","key":"10.3233\/IDA-173681_ref33","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1109\/TCYB.2014.2345579","article-title":"New techniques for mining frequent patterns in unordered trees","volume":"45","author":"Zhang","year":"2015","journal-title":"IEEE Transactions on Cybernetics"},{"key":"10.3233\/IDA-173681_ref34","doi-asserted-by":"crossref","unstructured":"S. Zhang and J.T.L. Wang, Mining frequent agreement subtrees in phylogenetic databases, in: Proceedings of the SIAM International Conference on Data Mining, 2006, pp. 222\u2013233.","DOI":"10.1137\/1.9781611972764.20"},{"issue":"1","key":"10.3233\/IDA-173681_ref35","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/TKDE.2007.190676","article-title":"Discovering frequent agreement subtrees from phylogenetic data","volume":"20","author":"Zhang","year":"2008","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-173681_ref36","doi-asserted-by":"crossref","unstructured":"P. Zoppoli, S. Morganella and M. Ceccarelli, TimeDelay-ARACNE: Reverse engineering of gene networks from time-course data by an information theoretic approach, BMC Bioinformatics 11 (2010).","DOI":"10.1186\/1471-2105-11-154"}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-173681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:18:15Z","timestamp":1777454295000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-173681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,18]]},"references-count":29,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.3233\/ida-173681","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,18]]}}}