Plagiarism Detection in Software Using Efficient String Matching
No Thumbnail Available
Date
2012
Journal Title
Journal ISSN
Volume Title
Publisher
Springer-verlag Berlin
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
Abstract
String matching refers to the problem of finding occurrence(s) of a pattern string within another string or body of a text. It plays a vital role in plagiarism detection in software codes, where it is required to identify similar program in a large populations. String matching has been used as a tool in a software metrics, which is used to measure the quality of software development process. In the recent years, many algorithms exist for solving the string matching problem. Among them, Berry-Ravindran algorithm was found to be fairly efficient. Further refinement of this algorithm is made in TVSBS and SSABS algorithms. However, these algorithms do not give the best possible shift in the search phase. In this paper, we propose an algorithm which gives the best possible shift in the search phase and is faster than the previously known algorithms. This algorithm behaves like Berry-Ravindran in the worst case. Further extension of this algorithm has been made for parameterized string matching which is able to detect plagiarism in a software code.
Description
Misra, Sanjay/0000-0002-3556-9331; Prasad, Rajesh/0000-0002-3456-6980
Keywords
String matching, plagiarism detection, bad character shift, parameterized matching and RGF
Turkish CoHE Thesis Center URL
Fields of Science
Citation
WoS Q
Scopus Q
Q3
Source
12th International Conference on Computational Science and Its Applications (ICCSA) -- JUN 18-21, 2012 -- Salvador de Bahia, BRAZIL
Volume
7336
Issue
Start Page
147
End Page
156