{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:15:37Z","timestamp":1740132937957,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T00:00:00Z","timestamp":1459468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000163","name":"ARC","doi-asserted-by":"publisher","award":["DP150103071","DP150102728"],"award-info":[{"award-number":["DP150103071","DP150102728"]}],"id":[{"id":"10.13039\/100000163","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61232006"],"award-info":[{"award-number":["61232006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000163","name":"ARC","doi-asserted-by":"publisher","award":["DP150102728","DP140103578"],"award-info":[{"award-number":["DP150102728","DP140103578"]}],"id":[{"id":"10.13039\/100000163","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000163","name":"ARC","doi-asserted-by":"publisher","award":["DE140100679","DP130103245"],"award-info":[{"award-number":["DE140100679","DP130103245"]}],"id":[{"id":"10.13039\/100000163","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2016,4,1]]},"DOI":"10.1109\/tkde.2015.2499201","type":"journal-article","created":{"date-parts":[[2015,11,10]],"date-time":"2015-11-10T15:05:56Z","timestamp":1447167956000},"page":"965-978","source":"Crossref","is-referenced-by-count":9,"title":["Efficient Probabilistic Supergraph Search"],"prefix":"10.1109","volume":"28","author":[{"given":"Wenjie","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Ke","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Gaoping","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213896"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1471-2105-7-1","article-title":"Comparison of protein interaction networks reveals species conservation and divergence","volume":"7","author":"teng","year":"2006","journal-title":"BMC Bioinformat"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516385"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368955"},{"key":"ref31","first-page":"876","article-title":"Efficient subgraph search over large uncertain graphs","volume":"4","author":"yuan","year":"2011","journal-title":"Proc of PVLDB"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0373-y"},{"key":"ref37","first-page":"938","article-title":"Graph indexing: Tree + delta $>$ = graph","author":"zhao","year":"0","journal-title":"Proc"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920887"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.14778\/1920841.1920988","article-title":"Sapper: Subgraph indexing and approximate matching in large graphs","volume":"3","author":"zhang","year":"0","journal-title":"Proc VLDB Endowment"},{"key":"ref34","first-page":"192","article-title":"Gaddi: Distance index based subgraph matching in biological networks","author":"zhang","year":"0","journal-title":"Proceedings of the 11th International Conference on Extending Database Technology Advances in Database Technology"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1986.4767800"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353369"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"johnson","key":"ref11"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1109\/TKDE.2011.243","article-title":"Clustering large probabilistic graphs","volume":"25","author":"kollios","year":"2012","journal-title":"IEEE Trans Knowledge Discovery and Data Eng"},{"journal-title":"Algorithmic Graph Theory","year":"1985","author":"gibbons","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/2002938.2002941"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225069"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1142\/S0129183107011753"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1080\/00107510500052444"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066244"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2010.53"},{"key":"ref27","first-page":"721","article-title":"gspan: Graph-based substructure pattern mining","author":"yan","year":"0","journal-title":"Proc IEEE Int Conf Data Mining"},{"journal-title":"Surveys in Combinatorics","year":"1997","author":"bailey","key":"ref3"},{"key":"ref6","first-page":"926","article-title":"Towards graph containment search and indexing","author":"chen","year":"0","journal-title":"Proc Int Conf On Very Large Data Bases"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"journal-title":"Foundations of Statistical Natural Language Processing","year":"1999","author":"manning","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247574"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-010-0212-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nbt924"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.2203804"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/24.106780"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014134"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920967"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1951365.1951408"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807264"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/TKDE.2010.80","article-title":"Mining frequent subgraph patterns from uncertain graph data","volume":"22","author":"zou","year":"2010","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661872"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543620"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7426466\/07323860.pdf?arnumber=7323860","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:48:14Z","timestamp":1641988094000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7323860\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,1]]},"references-count":41,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2015.2499201","relation":{},"ISSN":["1041-4347"],"issn-type":[{"type":"print","value":"1041-4347"}],"subject":[],"published":{"date-parts":[[2016,4,1]]}}}