{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:22:03Z","timestamp":1771024923174,"version":"3.50.1"},"reference-count":32,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1016\/j.scico.2012.11.008","type":"journal-article","created":{"date-parts":[[2012,12,22]],"date-time":"2012-12-22T11:17:06Z","timestamp":1356175026000},"page":"1871-1891","source":"Crossref","is-referenced-by-count":7,"title":["Viewing functions as token sequences to highlight similarities in source code"],"prefix":"10.1016","volume":"78","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.scico.2012.11.008_br000005","unstructured":"Moss, http:\/\/theory.stanford.edu\/~aiken\/moss."},{"key":"10.1016\/j.scico.2012.11.008_br000010","first-page":"1016","article-title":"Finding plagiarisms among a set of programs with JPlag","volume":"8","author":"Prechelt","year":"2000","journal-title":"Journal of Universal Computer Science"},{"key":"10.1016\/j.scico.2012.11.008_br000015","series-title":"Proceedings of the 3rd International Conference on Intelligent Systems for Molecular Biology","first-page":"393","article-title":"Neweyes: a system for comparing biological sequences using the Running Karp-Rabin Greedy String-Tiling algorithm","author":"Wise","year":"1995"},{"key":"10.1016\/j.scico.2012.11.008_br000020","series-title":"Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data 2003","first-page":"76","article-title":"Winnowing: local algorithms for document fingerprinting","author":"Schleimer","year":"2003"},{"key":"10.1016\/j.scico.2012.11.008_br000025","series-title":"Proceedings of the 12th Annual Symposium on Switching and Automata Theory","first-page":"114","article-title":"Depth-first search and linear graph algorithms","author":"Tarjan","year":"1971"},{"key":"10.1016\/j.scico.2012.11.008_br000030","doi-asserted-by":"crossref","unstructured":"P. Weiner, Linear pattern matching algorithm, in: 14th Annual IEEE Symposium on Switching and Automata Theory, Washington, DC, 1973, pp. 1\u201311.","DOI":"10.1109\/SWAT.1973.13"},{"key":"10.1016\/j.scico.2012.11.008_br000035","unstructured":"U. Manber, G. Myers, Suffix arrays: a new method for on-line string searches, Society for Industrial and Applied Mathematics Philadelphia, PA, USA, 1990."},{"key":"10.1016\/j.scico.2012.11.008_br000040","series-title":"Jewels of Stringology","author":"Crochemore","year":"2002"},{"key":"10.1016\/j.scico.2012.11.008_br000045","series-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"Gusfield","year":"1997"},{"key":"10.1016\/j.scico.2012.11.008_br000050","series-title":"12th Annual Symposium on Combinatorial Pattern Matching","first-page":"181","article-title":"Linear-time longest common-prefix computation in suffix arrays and its applications","author":"Kasai","year":"2001"},{"issue":"2","key":"10.1016\/j.scico.2012.11.008_br000055","first-page":"262","volume":"23","author":"McCreight","year":"1976","journal-title":"A space-economical suffix tree construction algorithm"},{"key":"10.1016\/j.scico.2012.11.008_br000060","unstructured":"E. Ukkonen, Constructing suffix trees on-line in linear time, in: J.\u00a0van Leeuwen (Ed.), 12th, Madrid, Spain, 1992, pp. 484\u2013492. URL: http:\/\/cs.helsinki.fi\/u\/ukkonen\/SuffixT1.ps."},{"key":"10.1016\/j.scico.2012.11.008_br000065","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O","article-title":"Reducing the space requirement of suffix trees","volume":"29","author":"Kurtz","year":"1998","journal-title":"Software - Practice and Experience"},{"key":"10.1016\/j.scico.2012.11.008_br000070","doi-asserted-by":"crossref","unstructured":"M.I. Abouelhoda, S. Kurtz, E. Ohlebusch, Replacing suffix trees with enhanced suffix arrays, Journal of Discrete Algorithms. URL: http:\/\/www.fli-leibniz.de\/www_bioc\/journal_club\/AboKurOhl2004.pdf.","DOI":"10.1016\/S1570-8667(03)00065-0"},{"issue":"2","key":"10.1016\/j.scico.2012.11.008_br000075","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0222017","article-title":"Recursive star-tree parallel data structure","volume":"22","author":"Berkman","year":"1993","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.scico.2012.11.008_br000080","series-title":"Introduction to Algorithms","author":"Cormen","year":"2001"},{"issue":"4","key":"10.1016\/j.scico.2012.11.008_br000085","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/382222.382462","article-title":"An algorithmic approach to the detection and prevention of plagiarism","volume":"8","author":"Ottenstein","year":"1976","journal-title":"SIGCSE Bulletin"},{"key":"10.1016\/j.scico.2012.11.008_br000090","series-title":"Proceedings of the 25th annual ACM symposium on Theory of computing","first-page":"71","article-title":"A theory of parameterized pattern matching: algorithms and applications","author":"Baker","year":"1993"},{"issue":"7","key":"10.1016\/j.scico.2012.11.008_br000095","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1109\/TSE.2002.1019480","article-title":"CCfinder: a multilinguistic token-based code clone detection system for large scale source code","volume":"28","author":"Kamiya","year":"2002","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/j.scico.2012.11.008_br000100","series-title":"Proceedings of the 44th annual Southeast regional conference","first-page":"679","article-title":"Phoenix-based clone detection using suffix trees","author":"Tairas","year":"2006"},{"key":"10.1016\/j.scico.2012.11.008_br000105","series-title":"17th IEEE International Conference on Program Comprehension","first-page":"243","article-title":"Syntax tree fingerprinting for source code similarity detection","author":"Chilowicz","year":"2009"},{"key":"10.1016\/j.scico.2012.11.008_br000110","unstructured":"M. Wise, String similarity via Greedy String Tiling and Running Karp\u2013Rabin matching, Tech. rep., Dept. of CS, University of Sydney, 1993. URL: http:\/\/www.pam1.bcs.uwa.edu.au\/~michaelw\/ftp\/doc\/RKR_GST.ps."},{"key":"10.1016\/j.scico.2012.11.008_br000115","unstructured":"M. Chilowicz, Recherche de similarit\u00e9 dans du code source, Ph.D. Thesis, 2010. URL: http:\/\/igm.univ-mlv.fr\/~chilowi\/research\/phd\/."},{"key":"10.1016\/j.scico.2012.11.008_br000120","series-title":"8th Workshop on Language Descriptions, Tools and Applications","first-page":"47","article-title":"Finding similarities in source code through factorization","volume":"vol. 238","author":"Chilowicz","year":"2008"},{"issue":"6","key":"10.1016\/j.scico.2012.11.008_br000125","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","article-title":"Simple fast algorithms for the editing distance between trees and related problems","volume":"18","author":"Zhang","year":"1989","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/j.scico.2012.11.008_br000130","unstructured":"J. Krinke, Identifying similar code with program dependence graphs, in: Proceedings of the 8th Working Conference on Reverse Engineering, 2001. URL: http:\/\/www.bauhaus-stuttgart.de\/clones\/ast01.pdf."},{"key":"10.1016\/j.scico.2012.11.008_br000135","series-title":"Proceedings of the third annual ACM symposium on Theory of computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"issue":"9","key":"10.1016\/j.scico.2012.11.008_br000140","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1109\/TSE.2007.70725","article-title":"Comparison and evaluation of clone detection tools","volume":"33","author":"Bellon","year":"2007","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/j.scico.2012.11.008_br000145","series-title":"Proceedings of the 16th International Conference on Program Comprehension","first-page":"153","article-title":"Scenario-based comparison of clone detection techniques","author":"Roy","year":"2008"},{"key":"10.1016\/j.scico.2012.11.008_br000150","series-title":"Proceedings of the International Conference on Software Maintenance","first-page":"368","article-title":"Clone detection using abstract syntax trees","author":"Baxter","year":"1998"},{"key":"10.1016\/j.scico.2012.11.008_br000155","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1109\/TSE.2005.28","article-title":"Using origin analysis to detect merging and splitting of source code entities","author":"Godfrey","year":"2005","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/j.scico.2012.11.008_br000160","doi-asserted-by":"crossref","unstructured":"M. Chilowicz, \u00c9. Duris, G. Roussel, Syntax tree fingerprinting: a foundation for source code similarity detection, Tech. rep., LIGM, Universit\u00e9 Paris-Est, 2009. URL: http:\/\/igm.univ-mlv.fr\/LIGM\/internal_report\/pdf\/2009_03.pdf.","DOI":"10.1109\/ICPC.2009.5090050"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642312002195?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642312002195?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T14:23:19Z","timestamp":1562509399000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642312002195"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":32,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["S0167642312002195"],"URL":"https:\/\/doi.org\/10.1016\/j.scico.2012.11.008","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[2013,10]]}}}