Pandey,K.L.Mısra, SanjayAgarwal,S.Misra,S.Prasad,R.Computer Engineering2024-07-052024-07-0520121978-364231127-71611-334910.1007/978-3-642-31128-4_112-s2.0-84863930600https://doi.org/10.1007/978-3-642-31128-4_11https://hdl.handle.net/20.500.14411/3677Universidade Federal da Bahia (UFBA); Universidade Federal do Reconcavo da Bahia (UFRB); Universidade Estadual de Feira de Santana (UEFS); University of Perugia; University of Basilicata (UB)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. © 2012 Springer-Verlag.eninfo:eu-repo/semantics/closedAccessbad character shiftparameterized matching and RGFplagiarism detectionString matchingConference Object7336 LNCSPART 4147156