{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:58:29Z","timestamp":1775638709968,"version":"3.50.1"},"publisher-location":"Republic and Canton of Geneva, Switzerland","reference-count":55,"publisher":"International World Wide Web Conferences Steering Committee","license":[{"start":{"date-parts":[[2017,4,3]],"date-time":"2017-04-03T00:00:00Z","timestamp":1491177600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,4,3]]},"DOI":"10.1145\/3038912.3052561","type":"proceedings-article","created":{"date-parts":[[2017,4,6]],"date-time":"2017-04-06T13:30:38Z","timestamp":1491485438000},"page":"1281-1290","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Neighbor-Aware Search for Approximate Labeled Graph Matching using the Chi-Square Statistics"],"prefix":"10.1145","author":[{"given":"Sourav","family":"Dutta","sequence":"first","affiliation":[{"name":"Nokia Bell Labs, Dublin, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pratik","family":"Nayek","sequence":"additional","affiliation":[{"name":"Microsoft Development Center, Bengaluru, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnab","family":"Bhattacharya","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Kanpur, Kanpur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,4,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588574"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989307"},{"issue":"5","key":"e_1_3_2_1_5_1","first-page":"867","article-title":"Efficient exact p-value computation for small sample, sparse and surprisingly categorical data","volume":"11","author":"Bejerano G.","year":"2004","unstructured":"G. Bejerano, N. Friedman, and N. Tishby. Efficient exact p-value computation for small sample, sparse and surprisingly categorical data. JCB, 11(5):867--886, 2004.","journal-title":"JCB"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1067"},{"key":"e_1_3_2_1_7_1","first-page":"926","volume-title":"VLDB","author":"Chen C.","year":"2007","unstructured":"C. Chen, X. Yan, P. S. Yu, J. Han, D. qing Zhang, and X. Gu. Towards graph containment search and indexing. In VLDB, pages 926--937, 2007."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247574"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"issue":"7","key":"e_1_3_2_1_12_1","first-page":"1","article-title":"A survey of DNA motif finding algorithms","volume":"8","author":"Das M. K.","year":"2007","unstructured":"M. K. Das and H. K. Dai. A survey of DNA motif finding algorithms. BMC Bioinf., 8(7):1--13, 2007.","journal-title":"BMC Bioinf."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16354-3_31"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13657-3_35"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989420"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920878"},{"key":"e_1_3_2_1_17_1","first-page":"45","volume-title":"AAAI","author":"Gallagher B.","year":"2006","unstructured":"B. Gallagher. Matching structure and semantics: A survey on graph-based pattern matching. In AAAI, pages 45--53, 2006."},{"key":"e_1_3_2_1_18_1","first-page":"201","article-title":"GraphGrep: A fast and universal method for querying graphs","volume":"2","author":"Giugno R.","year":"2002","unstructured":"R. Giugno and D. Shasha. GraphGrep: A fast and universal method for querying graphs. ICPR, 2:201--212, 2002.","journal-title":"ICPR"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920901"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/N15-1086"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-010-0376-y"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367902"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkh411"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535569.2448952"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807261"},{"key":"e_1_3_2_1_26_1","unstructured":"G. Klyne and J. J. Carroll. Resource description framework (RDF): Concepts and abstract syntax. http:\/\/www.citeulike.org\/group\/2170\/article\/532408 2006."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.01.019"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.658027"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1032649.1033500"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0003-9"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl287"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1142\/S021972001000477X"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.2307\/1403582"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4578-0"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336677"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/439476"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0806627105"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242667"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl571"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150448"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281271"},{"key":"e_1_3_2_1_45_1","volume-title":"Error-correcting isomorphisms of attributed relational graphs for pattern recognition","author":"Tsai W. H.","year":"1979","unstructured":"W. H. Tsai and K. Fu. Error-correcting isomorphisms of attributed relational graphs for pattern recognition. IEEE Systems, Man, and Cybernetics, 9(12):757--768, 1979."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"issue":"3","key":"e_1_3_2_1_47_1","first-page":"507","article-title":"Algorithms for detecting significantly mutated pathways in cancer","volume":"18","author":"Vandin F.","year":"2011","unstructured":"F. Vandin, E. Upfal, and B. J. Raphael. Algorithms for detecting significantly mutated pathways in cancer. JCB, 18(3):507--522, 2011.","journal-title":"JCB"},{"key":"e_1_3_2_1_48_1","first-page":"41","volume-title":"EDBT","author":"Wang J.","year":"2016","unstructured":"J. Wang, N. Ntarmos, and P. Triantafillou. Indexing query graphs to speedup graph query processing. In EDBT, pages 41--52, 2016."},{"key":"e_1_3_2_1_49_1","first-page":"721","volume-title":"ICDM","author":"Yan X.","year":"2002","unstructured":"X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. ICDM, pages 721--724, 2002."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1114244.1114248"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066244"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516385"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516384"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920988"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353369"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031453.1031462"}],"event":{"name":"WWW '17: 26th International World Wide Web Conference","location":"Perth Australia","acronym":"WWW '17","sponsor":["IW3C2 International World Wide Web Conference Committee","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the 26th International Conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3038912.3052561","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3038912.3052561","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:05Z","timestamp":1750220645000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3038912.3052561"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,3]]},"references-count":55,"alternative-id":["10.1145\/3038912.3052561","10.5555\/3038912"],"URL":"https:\/\/doi.org\/10.1145\/3038912.3052561","relation":{},"subject":[],"published":{"date-parts":[[2017,4,3]]},"assertion":[{"value":"2017-04-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}