Fast plagiarism detection system

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3772 LNCS, Issue , 2005, Pages 267-270

  Mozgovoy, Maxim ^a   Fredriksson, Kimmo ^a   White, Daniel ^b   Joy, Mike ^b   Sutinen, Erkki ^a  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646025938     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11575832_30     Document Type: Conference Paper

References (7)

1. B. S. Baker. Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance. SIAM Journal on Computing, 26(5): 1343-1362, 1997.
2. D. Clark and J. Ian Munro. Efficient suffix trees on secondary storage. Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, 1996.
3. M. S. Joy and M. Luck. Plagiarism in programming assignments. IEEE Transactions on Education, 42(2):129-133, 1999.
4. U. Manber and G. Myers, Suffix arrays: a new method for on-line string searches. In Proceedings of SODA '90, 319-327. SIAM, 1990.
5. L. Prechelt, G. Malpohl, and M. Phlippsen. JPlag: Finding plagiarisms among a set of programs. Technical report, Fakultat for Informatik, Universitat Karlsruhe, 2000. http://page.mi.fu-berlin.de/-prechelt/Biblio/jplagTR.pdf.
6. S. Schleimer, D. S. Wilkerson, and A. Aiken. Winnowing: local algorithms for document fingerprinting. In Proceedings of SIGMOD'03, 76-85. ACM Press, 2003.
7. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14:249-260, 1995.