{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:58:43Z","timestamp":1773482323258,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,7,7]],"date-time":"2012-07-07T00:00:00Z","timestamp":1341619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,7,7]]},"DOI":"10.1145\/2330163.2330216","type":"proceedings-article","created":{"date-parts":[[2012,7,10]],"date-time":"2012-07-10T16:41:12Z","timestamp":1341938472000},"page":"361-368","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["An efficient genetic algorithm for subgraph isomorphism"],"prefix":"10.1145","author":[{"given":"Jaeun","family":"Choi","sequence":"first","affiliation":[{"name":"Seoul National University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yourim","family":"Yoon","sequence":"additional","affiliation":[{"name":"LG Electronics, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byung-Ro","family":"Moon","sequence":"additional","affiliation":[{"name":"Seoul National University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(94)90065-5"},{"issue":"1","key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1021\/ci00017a008","article-title":"Matching two-dimensional chemical graphs using genetic algorithms","volume":"34","author":"Brown R.","year":"1994","unstructured":"R. Brown , G. Jones , P. Willett , and R. Glen . Matching two-dimensional chemical graphs using genetic algorithms . Journal of Chemical Information and Computer Sciences , 34 ( 1 ): 63 -- 70 , 1994 . R. Brown, G. Jones, P. Willett, and R. Glen. Matching two-dimensional chemical graphs using genetic algorithms. Journal of Chemical Information and Computer Sciences, 34(1):63--70, 1994.","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"e_1_3_2_1_3_1","first-page":"85","volume-title":"A comparison of algorithms for maximum common subgraph on randomly connected graphs. Structural, Syntactic, and Statistical Pattern Recognition","author":"Bunke H.","year":"2002","unstructured":"H. Bunke , P. Foggia , C. Guidobaldi , C. Sansone , and M. Vento . A comparison of algorithms for maximum common subgraph on randomly connected graphs. Structural, Syntactic, and Statistical Pattern Recognition , pages 85 -- 106 , 2002 . H. Bunke, P. Foggia, C. Guidobaldi, C. Sansone, and M. Vento. A comparison of algorithms for maximum common subgraph on randomly connected graphs. Structural, Syntactic, and Statistical Pattern Recognition, pages 85--106, 2002."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00139"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/321556.321562"},{"issue":"17","key":"e_1_3_2_1_7_1","first-page":"1","article-title":"An efficient algorithm for similarity analysis of molecules","volume":"2","author":"Durand P.","year":"1999","unstructured":"P. Durand , R. Pasari , J. Baker , and C. Tsai . An efficient algorithm for similarity analysis of molecules . Internet Journal of Chemistry , 2 ( 17 ): 1 -- 16 , 1999 . P. Durand, R. Pasari, J. Baker, and C. Tsai. An efficient algorithm for similarity analysis of molecules. Internet Journal of Chemistry, 2(17):1--16, 1999.","journal-title":"Internet Journal of Chemistry"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/313651.313830"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(01)00085-8"},{"key":"e_1_3_2_1_10_1","volume-title":"Computers and Intractability","author":"Garey M.","year":"1979","unstructured":"M. Garey and D. Johnson . Computers and Intractability , volume 174 . Freeman San Francisco , CA , 1979 . M. Garey and D. Johnson. Computers and Intractability, volume 174. Freeman San Francisco, CA, 1979."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830703"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380120103"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/42512.42542"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2010.29"},{"key":"e_1_3_2_1_15_1","first-page":"593","volume-title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","author":"Schaffer J.","year":"1985","unstructured":"J. Schaffer and J. Grefenstette . Multi-objective learning via genetic algorithms . In Proceedings of the Ninth International Joint Conference on Artificial Intelligence , pages 593 -- 595 . Citeseer , 1985 . J. Schaffer and J. Grefenstette. Multi-objective learning via genetic algorithms. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 593--595. Citeseer, 1985."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/anie.199411891"}],"event":{"name":"GECCO '12: Genetic and Evolutionary Computation Conference","location":"Philadelphia Pennsylvania USA","acronym":"GECCO '12","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the 14th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2330163.2330216","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2330163.2330216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:55Z","timestamp":1750238455000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2330163.2330216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,7]]},"references-count":17,"alternative-id":["10.1145\/2330163.2330216","10.1145\/2330163"],"URL":"https:\/\/doi.org\/10.1145\/2330163.2330216","relation":{},"subject":[],"published":{"date-parts":[[2012,7,7]]},"assertion":[{"value":"2012-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}