{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:18:47Z","timestamp":1761707927843,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,7,8]],"date-time":"2006-07-08T00:00:00Z","timestamp":1152316800000},"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":[[2006,7,8]]},"DOI":"10.1145\/1143997.1144312","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"1885-1892","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["A novel approach to optimize clone refactoring activity"],"prefix":"10.1145","author":[{"given":"Salah","family":"Bouktif","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique de Montr\u00e9al, Montr\u00e9al (Qu\u00c9bec) Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuliano","family":"Antoniol","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique de Montr\u00e9al, Montr\u00e9al (Qu\u00c9bec) Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ettore","family":"Merlo","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique de Montr\u00e9al, Montr\u00e9al (Qu\u00c9bec) Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Neteler","sequence":"additional","affiliation":[{"name":"ITC-irst Istituto Trentino Cultura, Povo (Trento), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2004.1265735"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-5849(02)00123-4"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/832303.836911"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/850947.853341"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.333.0477"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008668508685"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009642405419"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1049\/ip-sen:20030559"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-4338-4_3"},{"key":"e_1_3_2_1_10_1","first-page":"136","volume-title":"International Conference on GAs","author":"Davis L.","year":"1985","unstructured":"L. Davis . Job-shop scheduling with genetic algorithms . In International Conference on GAs , pages 136 -- 140 . Lawrence Erlbaum , 1985 . L. Davis. Job-shop scheduling with genetic algorithms. In International Conference on GAs, pages 136--140. Lawrence Erlbaum, 1985."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/521673"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/521673"},{"key":"e_1_3_2_1_13_1","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"Garey M.","year":"1979","unstructured":"M. Garey and D. Johnson . Computers and Intractability: a Guide to the Theory of NP-Completeness . W.H. Freeman , 1979 . M. Garey and D. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness. W.H. Freeman, 1979."},{"key":"e_1_3_2_1_14_1","volume-title":"Optimization, and Machine Learning","author":"Goldberg D.","year":"1989","unstructured":"D. Goldberg . Genetic Algorithms in Search , Optimization, and Machine Learning . Addison-Wesley , 1989 . D. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2003.07.002"},{"key":"e_1_3_2_1_16_1","volume-title":"Genetic Programming and Evolvable Machines","author":"Hart E.","year":"2004","unstructured":"E. Hart , D. Corne , and P. Ross . The state of the art in evolutionary scheduling . Genetic Programming and Evolvable Machines , 2004 (to appear). E. Hart, D. Corne, and P. Ross. The state of the art in evolutionary scheduling. Genetic Programming and Evolvable Machines, 2004 (to appear)."},{"key":"e_1_3_2_1_17_1","first-page":"171","volume-title":"CASCON","author":"Johnson J. H.","year":"1993","unstructured":"J. H. Johnson . Identifying redundancy in source code using fingerprints . In CASCON , pages 171 -- 183 , October 1993 . J. H. Johnson. Identifying redundancy in source code using fingerprints. In CASCON, pages 171--183, October 1993."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-5849(97)00053-0"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of Genetic and Evolutionary Computation Conference. Springer-Verlag","author":"Kirsopp C.","year":"2002","unstructured":"C. Kirsopp , M. Sheppard , and J. Hart . Search heuristics, case-based reasoning and software project effort prediction . In Proceedings of Genetic and Evolutionary Computation Conference. Springer-Verlag , 2002 . C. Kirsopp, M. Sheppard, and J. Hart. Search heuristics, case-based reasoning and software project effort prediction. In Proceedings of Genetic and Evolutionary Computation Conference. Springer-Verlag, 2002."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00126960"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/645544.655888"},{"key":"e_1_3_2_1_22_1","first-page":"8","article-title":"Reverse engineering reusability redundancy: the connection","volume":"3","author":"McCabe T. J.","year":"1990","unstructured":"T. J. McCabe . Reverse engineering reusability redundancy: the connection . American Programmer , 3 : 8 -- 13 , October 1990 . T. J. McCabe. Reverse engineering reusability redundancy: the connection. American Programmer, 3:8--13, October 1990.","journal-title":"American Programmer"},{"key":"e_1_3_2_1_23_1","first-page":"412","volume-title":"Proceedings of IEEE International Conference on Software Maintenance","author":"Merlo E.","year":"2004","unstructured":"E. Merlo , G. Antoniol , M. DiPenta , and F. Rollo . Linear complexity object-oriented similarity for clone detection and software evolution analysis . In Proceedings of IEEE International Conference on Software Maintenance , pages 412 -- 416 . IEEE Computer Society Press , 2004 . E. Merlo, G. Antoniol, M. DiPenta, and F. Rollo. Linear complexity object-oriented similarity for clone detection and software evolution analysis. In Proceedings of IEEE International Conference on Software Maintenance, pages 412--416. IEEE Computer Society Press, 2004."},{"key":"e_1_3_2_1_24_1","unstructured":"M. Neteler editor. GRASS 6.1 Programmer's Manual. Geographic Resources Analysis Support System. ITC-irst Italy http:\/\/grass.itc.it\/devel\/ 2005.  M. Neteler editor. GRASS 6.1 Programmer's Manual. Geographic Resources Analysis Support System. ITC-irst Italy http:\/\/grass.itc.it\/devel\/ 2005."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1998.699502"},{"key":"e_1_3_2_1_26_1","first-page":"193","volume-title":"Proceedings of International Conference on Genetic Algorithms and Their Applications","author":"Schaffer J. D.","year":"1985","unstructured":"J. D. Schaffer . Multiple objective optimization with vector evaluated genetic algorithms . In Proceedings of International Conference on Genetic Algorithms and Their Applications , pages 193 -- 100 , Pittsburgh, PAL , 1985 . J. D. Schaffer. Multiple objective optimization with vector evaluated genetic algorithms. In Proceedings of International Conference on Genetic Algorithms and Their Applications, pages 193--100, Pittsburgh, PAL, 1985."},{"key":"e_1_3_2_1_27_1","volume-title":"Universit\u00e9 des Sciences et Technologies de Lille","author":"Talbi E.","year":"2001","unstructured":"E. Talbi . M\u00e9taheuristiques pour l'optimisation combinatoire muli-objectif : \u00c9tat de l'art. TR 98-757.33, Laboratoire d'Informatique Fondamentale de Lille , Universit\u00e9 des Sciences et Technologies de Lille , 2001 . E. Talbi. M\u00e9taheuristiques pour l'optimisation combinatoire muli-objectif : \u00c9tat de l'art. TR 98-757.33, Laboratoire d'Informatique Fondamentale de Lille, Universit\u00e9 des Sciences et Technologies de Lille, 2001."}],"event":{"name":"GECCO06: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Seattle Washington USA","acronym":"GECCO06"},"container-title":["Proceedings of the 8th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144312","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1143997.1144312","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:30Z","timestamp":1750262910000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144312"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,8]]},"references-count":27,"alternative-id":["10.1145\/1143997.1144312","10.1145\/1143997"],"URL":"https:\/\/doi.org\/10.1145\/1143997.1144312","relation":{},"subject":[],"published":{"date-parts":[[2006,7,8]]},"assertion":[{"value":"2006-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}