Batch source-code plagiarism detection using an algorithm for the bounded longest common subsequence problem

CCE 2012 - 2012 9th International Conference on Electrical Engineering, Computing Science and Automatic Control

Volumn , Issue , 2012, Pages

  Campos, R A Castro ^a   Martinez, F J Zaragoza ^a  

^a UNIVERSIDAD AUTÓNOMA METROPOLITANA AZCAPOTZALCO   (Mexico)

Author keywords

branch and bound; longest common subsequence; Plagiarism detection; source code

Indexed keywords

BRANCH AND BOUNDS; BRANCH-AND-BOUND ALGORITHMS; DYNAMIC PROGRAMMING ALGORITHM; FALSE POSITIVE; HIGH DEGREE OF ACCURACY; LONGEST COMMON SUBSEQUENCE PROBLEM; LONGEST COMMON SUBSEQUENCES; PLAGIARISM DETECTION; PROGRAMMING COURSE; QUADRATIC TIME; SOURCE-CODE; STRING SIMILARITY;

AUTOMATION; CONTROL; ELECTRICAL ENGINEERING; INTELLECTUAL PROPERTY; LINEAR PROGRAMMING; PROCESS CONTROL;

ALGORITHMS;

EID: 84874404072     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICEEE.2012.6421180     Document Type: Conference Paper

References (9)

1. C. K. Roy, J. R. Cordy, and R. Koschke, "Comparison and evaluation of code clone detection techniques and tools: A qualitative approach," Sci. Comput. Program., vol. 74, no. 7, pp. 470-495, May 2009.
2. M. Ahmadzadeh and E. Mahmoudabadi, "Pattern of Plagiarism in Novice Students' Generated Programs: An Experimental Approach," Journal of Information Technology Education, vol. 10, p. IIP 195-IIP 205, 2011.
3. R. A. Wagner and M. J. Fischer, "The String-to-String Correction Problem," J. ACM, vol. 21, no. 1, pp. 168-173, Jan. 1974.
4. G. Navarro, "A guided tour to approximate string matching," ACM Comput. Surv., vol. 33, no. 1, pp. 31-88, Mar. 2001.
5. C. Rick, "New Algorithms for the Longest Common Subsequence Problem," University of Bonn, 1994.
6. L. Bergroth, H. Hakonen, and T. Raita, "A Survey of Longest Common Subsequence Algorithms," in Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00), Washington, DC, USA, 2000, pp. 39-48.
7. A. Apostolico and C. Guerra, "The longest common subsequence problem revisited," Algorithmica, vol. 2, no. 1, pp. 315-336, 1987.
8. B. W. Kernighan, The C Programming Language, 2nd ed. Prentice Hall Professional Technical Reference, 1988.
9. R. I. Greenberg, "Fast and Simple Computation of All Longest Common Subsequences," CoRR, vol. cs.DS/0211001, 2002.