{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:11:12Z","timestamp":1766067072475},"reference-count":27,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2020,1,1]]},"DOI":"10.1587\/transinf.2019edp7011","type":"journal-article","created":{"date-parts":[[2019,12,31]],"date-time":"2019-12-31T22:06:45Z","timestamp":1577830005000},"page":"130-141","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Supergraph Search Using Graph Coding"],"prefix":"10.1587","volume":"E103.D","author":[{"given":"Shun","family":"IMAI","sequence":"first","affiliation":[{"name":"Department of Science and Engineering, Kwansei Gakuin University"}]},{"given":"Akihiro","family":"INOKUCHI","sequence":"additional","affiliation":[{"name":"Department of Science and Engineering, Kwansei Gakuin University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] M. Cannataro, P.H. Guzzi, and P. Veltri, \u201cProtein-to-protein interactions: Technologies, databases, and algorithms,\u201d ACM Computing Surveys, vol.43, no.1, Article 1, 2010. 10.1145\/1824795.1824796","DOI":"10.1145\/1824795.1824796"},{"key":"2","unstructured":"[2] C. Chen, X. Yan, P.S. Yu, J. Han, D.-Q. Zhang, and X. Gu, \u201cTowards graph containment search and indexing,\u201d Proc. International Conference on Very Large Data Bases (VLDB), pp.926-937, 2007."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] J. Cheng, Y. Ke, W. Ng, and A. Lu, \u201cFg-index: Towards verification-free query processing on graph databases,\u201d Proc. ACM SIGMOD International Conference on Management of Data, pp.857-872, 2007. 10.1145\/1247480.1247574","DOI":"10.1145\/1247480.1247574"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] J. Cheng, Y. Ke, A.W.-C. Fu, and J.X. Yu, \u201cFast graph query processing with a low-cost index,\u201d The VLDB Journal, vol.20, no.4, pp.521-539, 2011. 10.1007\/s00778-010-0212-8","DOI":"10.1007\/s00778-010-0212-8"},{"key":"5","unstructured":"[5] S. Fortin, \u201cThe graph isomorphism problem,\u201d Technical Report TR96-20, Department of Computer Science, University of Alberta, 1996."},{"key":"6","unstructured":"[6] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, 1979."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] W.-S. Han, J. Lee, and J.-H. Lee, \u201cTurbo<sub>iso<\/sub>: Towards ultrafast and robust subgraph isomorphism search in large graph databases,\u201d Proc. ACM SIGMOD International Conference on Management of Data, pp.337-348, 2013. 10.1145\/2463676.2465300","DOI":"10.1145\/2463676.2465300"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] H. He and A.K. Singh, \u201cQuery language and access methods for graph databases,\u201d Managing and Mining Graph Data, Advances in Database Systems, vol.40, pp.125-160, Springer, Boston, MA, 2010. 10.1007\/978-1-4419-6045-0_4","DOI":"10.1007\/978-1-4419-6045-0_4"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] A. Inokuchi, T. Washio, and H. Motoda, \u201cAn apriori-based algorithm for mining frequent substructures from graph data,\u201d Proc. European Conference on Principles of Data Mining and Knowledge Discovery, Lecture Notes in Computer Science, vol.1910, pp.13-23, Springer, Berlin, Heidelberg, 2000. 10.1007\/3-540-45372-5_2","DOI":"10.1007\/3-540-45372-5_2"},{"key":"10","unstructured":"[10] A. Inokuchi, T. Washio, Y. Nishimura, and H. Motoda, \u201cA fast algorithm for mining frequent connected subgraphs,\u201d IBM Research, Tokyo Research Laboratory, 2002."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] H. Jiang, H. Wang, P.S. Yu, and S. Zhou, \u201cGString: A novel approach for efficient search in graph databases,\u201d Proc. International Conference on Data Engineering, pp.566-575, 2007. 10.1109\/icde.2007.367902","DOI":"10.1109\/ICDE.2007.367902"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] S. Kramer, L. De Raedt, and C. Helma, \u201cMolecular feature mining in HIV data,\u201d Proc. International Conference on Knowledge Discovery and Data Mining, pp.136-143, 2001. 10.1145\/502512.502533","DOI":"10.1145\/502512.502533"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] B. Lyu, L. Qin, X. Lin, L. Chang, and J.X. Yu, \u201cScalable supergraph search in large graph databases,\u201d Proc. IEEE International Conference on Data Engineering, pp.157-168, 2016. 10.1109\/icde.2016.7498237","DOI":"10.1109\/ICDE.2016.7498237"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] L. Ma, Z. Huang, and Y. Wang, \u201cAutomatic discovery of common design structures in CAD models,\u201d Computers &amp; Graphics, vol.34, no.5, pp.545-555, 2010. 10.1016\/j.cag.2010.06.002","DOI":"10.1016\/j.cag.2010.06.002"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] S. Nijssen and J.N. Kok, \u201cA quickstart in frequent structure mining can make a difference,\u201d Proc. International Conference on Knowledge Discovery and Data Mining, pp.647-652, 2004. 10.1145\/1014052.1014134","DOI":"10.1145\/1014052.1014134"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] S. Nowozin, K. Tsuda, T. Uno, T. Kudo, and G. Bakir, \u201cWeighted substructure mining for image analysis,\u201d Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2007. 10.1109\/cvpr.2007.383171","DOI":"10.1109\/CVPR.2007.383171"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] H. Shang, Y. Zhang, X. Lin, and J.X. Yu, \u201cTaming verification hardness: An efficient algorithm for testing subgraph isomorphism,\u201d Proc. VLDB Endowment, vol.1, no.1, pp.364-375, 2008. 10.14778\/1453856.1453899","DOI":"10.14778\/1453856.1453899"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] A. Tr\u00e9meau and P. Colantoni, \u201cRegions adjacency graph applied to color image segmentation,\u201d IEEE Trans. Image Process., vol.9, no.4, pp.735-744, 2000. 10.1109\/83.841950","DOI":"10.1109\/83.841950"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] W.T. Wipke and D. Rogers, \u201cArtificial intelligence in organic synthesis. SST: Starting material selection strategies. An application of superstructure search,\u201d Journal of Chemical Information and Computer Sciences, vol.24, no.2, pp.71-81, 1984. 10.1021\/ci00042a005","DOI":"10.1021\/ci00042a005"},{"key":"20","unstructured":"[20] X. Yan and J. Han, \u201cgSpan: Graph-based substructure pattern mining,\u201d Proc. IEEE International Conference on Data Mining, pp.721-724, 2002. 10.1109\/icdm.2002.1184038"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] D. Yuan, P. Mitra, and C.L. Giles, \u201cMining and indexing graphs for supergraph search,\u201d Proc. VLDB Endowment, vol.6, no.10, pp.829-840, 2013. 10.14778\/2536206.2536211","DOI":"10.14778\/2536206.2536211"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] S. Zhang, M. Hu, and J. Yang, \u201cTreePi: A novel graph indexing method,\u201d Proc. International Conference on Data Engineering, pp.966-975, 2007. 10.1109\/icde.2007.368955","DOI":"10.1109\/ICDE.2007.368955"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] S. Zhang, J. Li, H. Gao, and Z. Zou, \u201cA novel approach for efficient supergraph query processing on graph databases,\u201d Proc. International Conference on Extending Database Technology, pp.204-215, 2009. 10.1145\/1516360.1516385","DOI":"10.1145\/1516360.1516385"},{"key":"24","unstructured":"[24] P. Zhao, J.X. Yu, and P.S. Yu, \u201cGraph Indexing: Tree + Delta &gt;= Graph,\u201d Proc. International Conference on Very Large Data Bases (VLDB), pp.938-949, 2007."},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] G. Zhu, X. Lin, W. Zhang, W. Wang, and H. Shang, \u201cPrefIndex: An efficient supergraph containment search technique,\u201d Proc. International Conference Scientific and Statistical Database Management, Lecture Notes in Computer Science, vol.6187, pp.360-378, Springer, Berlin, Heidelberg, 2010. 10.1007\/978-3-642-13818-8_26","DOI":"10.1007\/978-3-642-13818-8_26"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] Q. Zhu, J. Yao, S. Yuan, F. Li, H, Chen, W. Cai, and Q. Liao, \u201cSuperstructure searching algorithm for generic reaction retrieval,\u201d Journal of Chemical Information and Modeling, vol.45, no.5, pp.1214-1222, 2005. 10.1021\/ci0496402","DOI":"10.1021\/ci0496402"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] X. Yan, P.S. Yu, and J. Han, \u201cGraph indexing: A frequent structure-based approach,\u201d SIGMOD Conference, pp.335-3462, 2004. 10.1145\/1007568.1007607","DOI":"10.1145\/1007568.1007607"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/1\/E103.D_2019EDP7011\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T05:20:25Z","timestamp":1578288025000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/1\/E103.D_2019EDP7011\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2019edp7011","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,1]]}}}