L. P. Prechelt, U. Karlsruhe, and G. , Finding plagiarisms among a set of programs with JPlag, Journal of Universal Computer Science, vol.8, pp.1016-1038, 2000.

M. J. Wise, Neweyes: A system for comparing biological sequences using the running karp-rabin greedy string-tiling algorithm, Proceedings of the 3rd International Conference on Intelligent Systems for Molecular Biology, pp.393-401, 1995.

S. Schleimer, D. S. Wilkerson, and A. Aiken, Winnowing, Proceedings of the 2003 ACM SIGMOD international conference on on Management of data , SIGMOD '03, pp.76-85, 2003.
DOI : 10.1145/872757.872770

R. Tarjan, Depth-first search and linear graph algorithms, Proceedings of the 12th Annual Symposium on Switching and Automata Theory, pp.114-121, 1971.

P. Weiner, Linear pattern matching algorithms, 14th Annual Symposium on Switching and Automata Theory (swat 1973), pp.1-11, 1973.
DOI : 10.1109/SWAT.1973.13

U. Manber and G. Myers, Suffix Arrays: A New Method for On-Line String Searches, SIAM Journal on Computing, vol.22, issue.5, 1990.
DOI : 10.1137/0222058

T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park, Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications, 12th Annual Symposium on Combinatorial Pattern Matching, pp.181-192, 2001.
DOI : 10.1007/3-540-48194-X_17

E. M. Mccreight, A Space-Economical Suffix Tree Construction Algorithm, Journal of the ACM, vol.23, issue.2, pp.262-272, 1976.
DOI : 10.1145/321941.321946

E. Ukkonen, Constructing suffix trees on-line in linear time, 12th, pp.484-492, 1992.

S. Kurtz, Reducing the space requirement of suffix trees, Software -Practice and Experience, pp.1149-1171, 1998.

M. I. Abouelhoda, S. Kurtz, and E. Ohlebusch, Replacing suffix trees with enhanced suffix arrays, Journal of Discrete Algorithms, vol.2, issue.1
DOI : 10.1016/S1570-8667(03)00065-0

O. Berkman and U. Vishkin, Recursive Star-Tree Parallel Data Structure, SIAM Journal on Computing, vol.22, issue.2, pp.221-242, 1993.
DOI : 10.1137/0222017

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2001.

K. J. Ottenstein, An algorithmic approach to the detection and prevention of plagiarism, ACM SIGCSE Bulletin, vol.8, issue.4, pp.30-41, 1976.
DOI : 10.1145/382222.382462

B. S. Baker, A theory of parameterized pattern matching, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.71-80, 1993.
DOI : 10.1145/167088.167115

T. Kamiya, S. Kusumoto, and K. Inoue, CCFinder: a multilinguistic token-based code clone detection system for large scale source code, IEEE Transactions on Software Engineering, vol.28, issue.7, pp.654-670, 2002.
DOI : 10.1109/TSE.2002.1019480

R. Tairas and J. Gray, Phoenix-based clone detection using suffix trees, Proceedings of the 44th annual southeast regional conference on , ACM-SE 44, pp.679-684, 2006.
DOI : 10.1145/1185448.1185597

M. Chilowicz, ´. E. Duris, and G. Roussel, Syntax tree fingerprinting for source code similarity detection, 2009 IEEE 17th International Conference on Program Comprehension, pp.243-247, 2009.
DOI : 10.1109/ICPC.2009.5090050
URL : https://hal.archives-ouvertes.fr/hal-00627811

M. Wise, String similarity via Greedy String Tiling and Running Karp-- Rabin matching, 1993.

M. Chilowicz, Recherche de similarité dans du code source, 2010.

M. Chilowicz, E. Duris, and G. Roussel, Finding Similarities in Source Code Through Factorization, 8th Workshop on Language Descriptions, Tools and Applications, pp.47-62, 2008.
DOI : 10.1016/j.entcs.2009.09.040
URL : https://hal.archives-ouvertes.fr/hal-00620319

K. Zhang and D. Shasha, Simple Fast Algorithms for the Editing Distance between Trees and Related Problems, SIAM Journal on Computing, vol.18, issue.6, pp.1245-1262, 1989.
DOI : 10.1137/0218082

J. Krinke, Identifying similar code with program dependence graphs, Proceedings Eighth Working Conference on Reverse Engineering, 2001.
DOI : 10.1109/WCRE.2001.957835

S. A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

S. Bellon, R. Koschke, G. Antoniol, J. Krinke, and E. Merlo, Comparison and Evaluation of Clone Detection Tools, IEEE Transactions on Software Engineering, vol.33, issue.9, pp.577-591, 2007.
DOI : 10.1109/TSE.2007.70725

C. K. Roy and J. R. Cordy, Scenario-Based Comparison of Clone Detection Techniques, 2008 16th IEEE International Conference on Program Comprehension, pp.153-162, 2008.
DOI : 10.1109/ICPC.2008.42

I. D. Baxter, A. Yahin, L. Moura, M. Sant-'anna, and L. Bier, Clone detection using abstract syntax trees, Proceedings. International Conference on Software Maintenance (Cat. No. 98CB36272), 1998.
DOI : 10.1109/ICSM.1998.738528

M. Godfrey and L. Zou, Using origin analysis to detect merging and splitting of source code entities, IEEE Transactions on Software Engineering, vol.31, issue.2, pp.166-181, 2005.
DOI : 10.1109/TSE.2005.28

M. Chilowicz, ´. E. Duris, and G. Roussel, Syntax tree fingerprinting for source code similarity detection, 2009 IEEE 17th International Conference on Program Comprehension, 2009.
DOI : 10.1109/ICPC.2009.5090050
URL : https://hal.archives-ouvertes.fr/hal-00627811