Prasad,R.Mısra, SanjayAgarwal,S.Misra,S.Sharma,A.K.Singh,A.Computer Engineering2024-10-062024-10-06201211330-3651[SCOPUS-DOI-BELIRLENECEK-266]2-s2.0-84863691567https://hdl.handle.net/20.500.14411/9336In the software maintenance, it is often required to find duplicity present in the codes. Two code fragments are equivalent, if one can be transformed into the other via consistent renaming of identifiers, literals and variables. This equivalency can be detected by parameterized string matching. In this matching, a given pattern P is said to match with a substring of the text T, if there exists a one-to-one correspondence between symbols of and symbols of P. In this paper, we propose an efficient algorithm for this problem by using both the overlapping and non-overlapping -gram.We show the effect of running time of the algorithm on increasing the duplicity present in the code.eninfo:eu-repo/semantics/closedAccessBit-parallelismDesign of algorithmHashingPlagiarism detectionq-gramSoftware maintenanceString matchingArticleQ4Q3192243247