{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T05:35:45Z","timestamp":1673415345892},"reference-count":22,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2009,10,1]],"date-time":"2009-10-01T00:00:00Z","timestamp":1254355200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":1397,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1016\/j.entcs.2009.09.040","type":"journal-article","created":{"date-parts":[[2009,9,30]],"date-time":"2009-09-30T09:28:19Z","timestamp":1254302899000},"page":"47-62","source":"Crossref","is-referenced-by-count":7,"title":["Finding Similarities in Source Code Through Factorization"],"prefix":"10.1016","volume":"238","author":[{"given":"Michel","family":"Chilowicz","sequence":"first","affiliation":[]},{"given":"\u00c9tienne","family":"Duris","sequence":"additional","affiliation":[]},{"given":"Gilles","family":"Roussel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2009.09.040_bib001","doi-asserted-by":"crossref","unstructured":"Brenda S. Baker. On finding duplication and near-duplication in large software systems. In WCRE. IEEE CSP, 1995","DOI":"10.1109\/WCRE.1995.514697"},{"key":"10.1016\/j.entcs.2009.09.040_bib002","doi-asserted-by":"crossref","unstructured":"Ira D. Baxter, Andrew Yahin, Leonardo Moura, Marcelo Sant'Anna, and Lorraine Bier. Clone detection using abstract syntax trees. In ICSM. IEEE-CS, 1998","DOI":"10.1109\/ICSM.1998.738528"},{"key":"10.1016\/j.entcs.2009.09.040_bib003","doi-asserted-by":"crossref","unstructured":"Elizabeth Burd and John Bailey. Evaluating clone detection tools for use during preventative maintenance. In SCAM, Montreal, October 2002. IEEE-CS","DOI":"10.1109\/SCAM.2002.1134103"},{"key":"10.1016\/j.entcs.2009.09.040_bib005","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2004.830793","article-title":"Shared information and program plagiarism detection","author":"Chen","year":"2004","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/j.entcs.2009.09.040_bib007","unstructured":"Paul Clough. Old and new challenges in automatic plagiarism detection. National Plagiarism Advisory Service, 2003"},{"key":"10.1016\/j.entcs.2009.09.040_bib008","series-title":"Introduction to Algorithms","author":"Cormen","year":"2001"},{"key":"10.1016\/j.entcs.2009.09.040_bib009","doi-asserted-by":"crossref","unstructured":"St\u00e9phane Ducasse, Matthias Rieger, and Serge Demeyer. A language independent approach for detecting duplicated code. In ICSM, 1999","DOI":"10.1109\/ICSM.1999.792593"},{"issue":"1","key":"10.1016\/j.entcs.2009.09.040_bib010","article-title":"Interprocedural slicing using dependence graphs","volume":"12","author":"Horwitz","year":"1990","journal-title":"ACM Trans. on Programming Lang. and Sys."},{"key":"10.1016\/j.entcs.2009.09.040_bib011","unstructured":"Robert Irving. Plagiarism and collusion detection using the Smith-Waterman algorithm, 2004"},{"key":"10.1016\/j.entcs.2009.09.040_bib013","series-title":"Proc. ICALP","article-title":"Simple linear work suffix array construction","volume":"volume 2719","author":"K\u00e4rkk\u00e4inen","year":"2003"},{"issue":"2","key":"10.1016\/j.entcs.2009.09.040_bib014","doi-asserted-by":"crossref","DOI":"10.1147\/rd.312.0249","article-title":"Efficient randomized pattern-matching algorithms","volume":"31","author":"Karp","year":"1987","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/j.entcs.2009.09.040_bib015","unstructured":"Jens Krinke. Identifying similar code with program dependence graphs. In WCRE, 2001"},{"issue":"13","key":"10.1016\/j.entcs.2009.09.040_bib016","article-title":"Reducing the space requirement of suffix trees","volume":"29","author":"Kurtz","year":"1999","journal-title":"Soft. Practice and Exp."},{"key":"10.1016\/j.entcs.2009.09.040_bib017","series-title":"Suffix arrays: a new method for on-line string searches","author":"Manber","year":"1990"},{"issue":"3","key":"10.1016\/j.entcs.2009.09.040_bib019","article-title":"A multilanguage source code retrieval system using structural-semantic fingerprints","volume":"1","author":"Ouddan","year":"2007","journal-title":"Int. Journal of Comp. Sys. Sci. and Eng."},{"issue":"2","key":"10.1016\/j.entcs.2009.09.040_bib020","doi-asserted-by":"crossref","DOI":"10.1109\/13.28038","article-title":"Computer algorithms for plagiarism detection","volume":"32","author":"Parker","year":"1989","journal-title":"IEEE Trans. on Educ."},{"issue":"11","key":"10.1016\/j.entcs.2009.09.040_bib021","article-title":"Finding plagiarism among a set of programs JPlag","volume":"8","author":"Prechelt","year":"2002","journal-title":"Journal of Univ. Comp. Sci."},{"issue":"6","key":"10.1016\/j.entcs.2009.09.040_bib022","doi-asserted-by":"crossref","DOI":"10.1016\/S0020-0190(00)00114-9","article-title":"Simple and fast linear space computation of longest common subsequences","volume":"75","author":"Rick","year":"2000","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.entcs.2009.09.040_bib023","doi-asserted-by":"crossref","unstructured":"Saul Schleimer, Daniel S. Wilkerson, and Alex Aiken. Winnowing: local algorithms for document fingerprinting. In ACM Press NY, editor, Proc. Int. Conf. on Management of Data, 2003","DOI":"10.1145\/872769.872770"},{"key":"10.1016\/j.entcs.2009.09.040_bib025","doi-asserted-by":"crossref","unstructured":"Kristina L. Verco and Michael J. Wise. Software for detecting suspected plagiarism: Comparing structure and attribute-counting systems. In John Rosenberg, editor, Proc. the First Australian Conf. on Comp. Sci. Educ.,Sydney, July 3\u20135 1996. SIGCSE, ACM","DOI":"10.1145\/369585.369598"},{"key":"10.1016\/j.entcs.2009.09.040_bib026","unstructured":"Michael J. Wise. Running karp-rabin matching and greedy string tiling. Technical Report 463, Dep. of Comp. Sci., Sidney Univ., March 1994"},{"issue":"3","key":"10.1016\/j.entcs.2009.09.040_bib027","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.1977.1055714","article-title":"A universal algorithm for sequential data compression","volume":"23","author":"Ziv","year":"1977","journal-title":"IEEE Trans. on Information Theory"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066109003946?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066109003946?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T22:59:45Z","timestamp":1558565985000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066109003946"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["S1571066109003946"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2009.09.040","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2009,10]]}}}