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), p.ICSM, 1998.
DOI : 10.1109/ICSM.1998.738528

E. Burd and J. Bailey, Evaluating clone detection tools for use during preventative maintenance, Proceedings. Second IEEE International Workshop on Source Code Analysis and Manipulation, p.SCAM, 2002.
DOI : 10.1109/SCAM.2002.1134103

X. Chen, B. Francia, M. Li, B. Mckinnon, and A. Seker, Shared Information and Program Plagiarism Detection, IEEE Transactions on Information Theory, vol.50, issue.7, 2004.
DOI : 10.1109/TIT.2004.830793

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

P. Clough, Old and new challenges in automatic plagiarism detection, National Plagiarism Advisory Service, 2003.

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

S. Ducasse, M. Rieger, and S. Demeyer, A language independent approach for detecting duplicated code, Proceedings IEEE International Conference on Software Maintenance, 1999 (ICSM'99). 'Software Maintenance for Business Change' (Cat. No.99CB36360), 1999.
DOI : 10.1109/ICSM.1999.792593

S. Horwitz, T. W. Reps, and D. Binkley, Interprocedural slicing using dependence graphs, ACM Trans. on Programming Lang. and Sys, p.12, 1990.

R. Irving, Plagiarism and collusion detection using the Smith-Waterman algorithm, 2004.

J. Kärkkäinen and P. Sanders, Simple Linear Work Suffix Array Construction, Proc. ICALP, 2003.
DOI : 10.1007/3-540-45061-0_73

R. M. Karp and M. O. Rabin, Efficient randomized pattern-matching algorithms, IBM Journal of Research and Development, vol.31, issue.2, p.31, 1987.
DOI : 10.1147/rd.312.0249

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

S. Kurtz, Reducing the space requirement of suffix trees, Soft. Practice and Exp, p.29, 1999.

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

M. A. Ouddan and H. Essafi, A multilanguage source code retrieval system using structural-semantic fingerprints, Int, Journal of Comp. Sys. Sci. and Eng, vol.1, 2007.

A. Parker and J. Hamblen, Computer algorithms for plagiarism detection, IEEE Transactions on Education, vol.32, issue.2, 1989.
DOI : 10.1109/13.28038

L. Prechelt, G. Malpohl, and M. Philippsen, Finding plagiarism among a set of programs JPlag, Journal of Univ. Comp. Sci, vol.8, 2002.

C. Rick, Simple and fast linear space computation of longest common subsequences, Information Processing Letters, vol.75, issue.6, p.75, 2000.
DOI : 10.1016/S0020-0190(00)00114-9

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

K. L. Verco and M. J. Wise, Software for detecting suspected plagiarism, Proceedings of the first Australasian conference on Computer science education , ACSE '96, 1996.
DOI : 10.1145/369585.369598

M. J. Wise, Running karp-rabin matching and greedy string tiling, Dep. of Comp. Sci., Sidney Univ, 1994.

J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, vol.23, issue.3, 1977.
DOI : 10.1109/TIT.1977.1055714