{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T09:06:42Z","timestamp":1726304802084},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811050404"},{"type":"electronic","value":"9789811050411"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-981-10-5041-1_27","type":"book-chapter","created":{"date-parts":[[2017,5,13]],"date-time":"2017-05-13T03:14:39Z","timestamp":1494645279000},"page":"151-158","source":"Crossref","is-referenced-by-count":1,"title":["Solving the Subgraph Isomorphism Problem Using Harmony Search"],"prefix":"10.1007","author":[{"given":"Hoyeong","family":"Yun","sequence":"first","affiliation":[]},{"given":"Yongjoon","family":"Joe","sequence":"additional","affiliation":[]},{"given":"Byung-Ok","family":"Jung","sequence":"additional","affiliation":[]},{"given":"Hyoguen","family":"Bang","sequence":"additional","affiliation":[]},{"given":"Dongmyung","family":"Shin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,14]]},"reference":[{"issue":"7","key":"27_CR1","first-page":"442","volume":"35","author":"JH Ji","year":"2008","unstructured":"Ji, J.H., Woo, G., Cho, H.G.: A plagiarism detection technique for Java program using Bytecode analysis. J. Korean Inst. Inf. Sci. Eng. 35(7), 442\u2013451 (2008)","journal-title":"J. Korean Inst. Inf. Sci. Eng."},{"issue":"1","key":"27_CR2","first-page":"51","volume":"6","author":"YC Kim","year":"2005","unstructured":"Kim, Y.C., Hwang, S.C., Choi, J.Y.: A program similarity evaluation algorithm. J. Korean Soc. Inf. 6(1), 51\u201364 (2005)","journal-title":"J. Korean Soc. Inf."},{"key":"27_CR3","unstructured":"Kim, S.H.: Plagiarism detection using dependence graph analysis specialized for Javascript. Master Thesis, Korea Advanced Institute of Science Technology (2011)"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Koschke, R., Falke, R., Frenzel, P.: Clone detection using abstract syntax suffix trees. In: Proceedings of the 13th Working Conference on Reverse Engineering, pp. 253\u2013262. IEEE (2006)","DOI":"10.1109\/WCRE.2006.18"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Liu, C., Chen, C., Han, J., Yu, P.S.: GPLAG: detection of Software plagiarism by program dependence graph analysis. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge discovery and Data Mining, pp. 872\u2013881 (2006)","DOI":"10.1145\/1150402.1150522"},{"key":"27_CR6","unstructured":"Kim, Y.E., Cheon, J.S., Byun, S.W., Woo, G.: A parallel performance comparison of Haskell using a plagiarism detection method. In: Korea Computer Congress, pp. 1724\u20131726 (2016)"},{"issue":"11","key":"27_CR7","first-page":"1016","volume":"8","author":"L Prechelt","year":"2002","unstructured":"Prechelt, L., Malpohl, G., Philippsen, M.: Finding plagiarism among a set of programs with JPlag. J. Univ. Comput. Sci. 8(11), 1016\u20131038 (2002)","journal-title":"J. Univ. Comput. Sci."},{"issue":"1","key":"27_CR8","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1145\/384266.299783","volume":"31","author":"D Gitchell","year":"1999","unstructured":"Gitchell, D., Tran, N.: Sim: a utility for detecting similarity in computer programs. ACM SIGCSE Bull. 31(1), 266\u2013270 (1999). ACM","journal-title":"ACM SIGCSE Bull."},{"issue":"1","key":"27_CR9","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/236462.236525","volume":"28","author":"MJ Wise","year":"1996","unstructured":"Wise, M.J.: YAP3: improved detection of similarities in computer program and other texts. ACM SIGCSE Bull. 28(1), 130\u2013134 (1996)","journal-title":"ACM SIGCSE Bull."},{"key":"27_CR10","volume-title":"Graph Theory","author":"G Suresh Singh","year":"2010","unstructured":"Suresh Singh, G.: Graph Theory. PHI Learning, New Delhi (2010)"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Choi, J.E., Yoon, Y.R., Moon, B.R.: An efficient genetic algorithm for subgraph isomorphism. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, pp. 361\u2013368 (2012)","DOI":"10.1145\/2330163.2330216"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Farahani, M.M., Chaharsoughi, S.K.: A genetic and iterative local search algorithm for solving subgraph isomorphism problem. In: International Conference on Industrial Engineering and Operations Management (IEOM), pp. 1\u20136. IEEE (2015)","DOI":"10.1109\/IEOM.2015.7093815"},{"key":"27_CR13","unstructured":"Li, Z., Chen, B., Che, D.: Solving the subgraph isomorphism problem using simulated annealing and evolutionary algorithms. In: Proceedings on the International Conference on Artificial Intelligence (ICAI). The Steering Committee of the World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp), pp. 293\u2013299 (2016)"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Choi, J., Yoon, Y., Moon, B.R.: An efficient genetic algorithm for subgraph isomorphism. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (2012)","DOI":"10.1145\/2330163.2330216"}],"container-title":["Lecture Notes in Electrical Engineering","Advanced Multimedia and Ubiquitous Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-5041-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,13]],"date-time":"2017-05-13T03:20:41Z","timestamp":1494645641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-5041-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9789811050404","9789811050411"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-5041-1_27","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2017]]}}}