{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T03:46:58Z","timestamp":1760586418845,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,3,10]],"date-time":"2006-03-10T00:00:00Z","timestamp":1141948800000},"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,3,10]]},"DOI":"10.1145\/1185448.1185597","type":"proceedings-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T01:15:56Z","timestamp":1168996556000},"page":"679-684","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["Phoenix-based clone detection using suffix trees"],"prefix":"10.1145","author":[{"given":"Robert","family":"Tairas","sequence":"first","affiliation":[{"name":"University of Alabama at Birmingham, Birmingham, AL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeff","family":"Gray","sequence":"additional","affiliation":[{"name":"University of Alabama at Birmingham, Birmingham, AL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,3,10]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"86","volume-title":"B. On Finding Duplication and Near-Duplication in Large Software Systems. In Proceedings of the Second IEEE Working Conference on Reverse Engineering","author":"Baker","year":"1995","unstructured":"Baker , B. On Finding Duplication and Near-Duplication in Large Software Systems. In Proceedings of the Second IEEE Working Conference on Reverse Engineering , Toronto, Canada , July 1995 , pp. 86 -- 95 . Baker, B. On Finding Duplication and Near-Duplication in Large Software Systems. In Proceedings of the Second IEEE Working Conference on Reverse Engineering, Toronto, Canada, July 1995, pp. 86--95."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/850947.853341"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2005.114"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/30.11.2478"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/262228"},{"key":"e_1_3_2_1_7_1","volume-title":"Method-Level Code Clone Detection on Transformed Abstract Syntax Trees using Sequence Matching Algorithms. Student Report","author":"Greenan K.","year":"2005","unstructured":"Greenan , K. Method-Level Code Clone Detection on Transformed Abstract Syntax Trees using Sequence Matching Algorithms. Student Report , University of California - Santa Cruz , Winter 2005 , available at http:\/\/www.cs.ucsc.edu\/~ejw\/courses\/290gw05\/greenan-report.pdf. Greenan, K. Method-Level Code Clone Detection on Transformed Abstract Syntax Trees using Sequence Matching Algorithms. Student Report, University of California - Santa Cruz, Winter 2005, available at http:\/\/www.cs.ucsc.edu\/~ejw\/courses\/290gw05\/greenan-report.pdf."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.suppl_1.S312"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0053381"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-585-27477-5_4"},{"key":"e_1_3_2_1_11_1","unstructured":"Microsoft Phoenix http:\/\/research.microsoft.com\/phoenix  Microsoft Phoenix http:\/\/research.microsoft.com\/phoenix"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/302405.302457"}],"event":{"name":"ACM SE06: ACM Southeast Regional Conference","acronym":"ACM SE06","location":"Melbourne Florida"},"container-title":["Proceedings of the 44th annual Southeast regional conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1185448.1185597","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1185448.1185597","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:21Z","timestamp":1750259181000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1185448.1185597"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3,10]]},"references-count":11,"alternative-id":["10.1145\/1185448.1185597","10.1145\/1185448"],"URL":"https:\/\/doi.org\/10.1145\/1185448.1185597","relation":{},"subject":[],"published":{"date-parts":[[2006,3,10]]},"assertion":[{"value":"2006-03-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}