{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T10:09:44Z","timestamp":1692785384744},"reference-count":16,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Info. Know. Mgmt."],"published-print":{"date-parts":[[2014,9]]},"abstract":" Source code plagiarism is easy to commit but difficult to catch. Many approaches have been proposed in the literature to automate its detection; however there is little consensus on what works best. In this paper, we propose two new measures for determining the accuracy of a given technique and describe an approach to convert code files into strings which can then be compared for similarity in order to detect plagiarism. We then compare several string comparison techniques, heavily utilised in the area of biological sequence alignment, and compare their performance on a large collection of student source code containing various types of plagiarism. Experimental results show that the compared techniques succeed in matching a plagiarised file to its original files upwards of 90% of the time. Finally, we propose a modification for these algorithms that drastically improves their runtimes with little or no effect on accuracy. Even though the ideas presented herein are applicable to most programming languages, we focus on a case study pertaining to an introductory-level Visual Basic programming course offered at our institution. <\/jats:p>","DOI":"10.1142\/s0219649214500282","type":"journal-article","created":{"date-parts":[[2014,9,19]],"date-time":"2014-09-19T07:46:30Z","timestamp":1411112790000},"page":"1450028","source":"Crossref","is-referenced-by-count":5,"title":["Source Code Plagiarism Detection Using Biological String Similarity Algorithms"],"prefix":"10.1142","volume":"13","author":[{"given":"Imad","family":"Rahal","sequence":"first","affiliation":[{"name":"Department of Computer Science, College of Saint Benedict and Saint John's University, Collegeville, MN 56321, USA"}]},{"given":"Colin","family":"Wielga","sequence":"additional","affiliation":[{"name":"Natural Sciences Division, New College of Florida, Sarasota, FL 34234, USA"}]}],"member":"219","published-online":{"date-parts":[[2014,10,10]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.830793"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1109\/TE.2011.2112768"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1109\/TE.2007.906776"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0360-1315(87)90042-X"},{"key":"rf8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1990"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1145\/384266.299783"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1145\/953049.800954"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1145\/359460.359467"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1109\/13.762946"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1147\/rd.312.0249"},{"key":"rf18","first-page":"22","volume":"3","author":"Marinescu D.","year":"2013","journal-title":"Journal of Computer Science Research and Application"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"rf20","first-page":"1016","volume":"8","author":"Prechelt L.","year":"2002","journal-title":"Journal of Universal Computer Science"},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(81)90087-5"},{"key":"rf23","volume-title":"Introduction to Data Mining","author":"Tan P. N.","year":"2005"},{"key":"rf26","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/33.2.140"}],"container-title":["Journal of Information & Knowledge Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219649214500282","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T04:44:04Z","timestamp":1565153044000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219649214500282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":16,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2014,10,10]]},"published-print":{"date-parts":[[2014,9]]}},"alternative-id":["10.1142\/S0219649214500282"],"URL":"https:\/\/doi.org\/10.1142\/s0219649214500282","relation":{},"ISSN":["0219-6492","1793-6926"],"issn-type":[{"value":"0219-6492","type":"print"},{"value":"1793-6926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9]]}}}