Maintaining Software Through Bit-Parallelism and Hashing the Parameterized <i>q</I>-grams
| dc.authorid | Prasad, Rajesh/0000-0002-3456-6980 | |
| dc.authorid | Misra, Sanjay/0000-0002-3556-9331 | |
| dc.authorscopusid | 57191422092 | |
| dc.authorscopusid | 23097406900 | |
| dc.authorscopusid | 56962766700 | |
| dc.authorscopusid | 57752874800 | |
| dc.authorscopusid | 57742191800 | |
| dc.authorwosid | Prasad, Rajesh/GRX-3202-2022 | |
| dc.authorwosid | Misra, Sanjay/K-2203-2014 | |
| dc.contributor.author | Prasad, Rajesh | |
| dc.contributor.author | Agarwal, Suneeta | |
| dc.contributor.author | Misra, Sanjay | |
| dc.contributor.author | Sharma, Anuj Kumar | |
| dc.contributor.author | Singh, Alok | |
| dc.contributor.other | Computer Engineering | |
| dc.contributor.other | Computer Engineering | |
| dc.date.accessioned | 2024-10-06T10:57:00Z | |
| dc.date.available | 2024-10-06T10:57:00Z | |
| dc.date.issued | 2012 | |
| dc.department | Atılım University | en_US |
| dc.department-temp | [Prasad, Rajesh; Agarwal, Suneeta; Sharma, Anuj Kumar; Singh, Alok] Motilal Nehru Natl Inst Technol, Dept Comp Sci & Engn, Alahabad, India; [Misra, Sanjay] Atilim Univ, Dept Comp Engn, Fac Engn, Ankara, Turkey | en_US |
| dc.description | Prasad, Rajesh/0000-0002-3456-6980; Misra, Sanjay/0000-0002-3556-9331 | en_US |
| dc.description.abstract | In 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 is said to match with a substring of the text, if there exists a one-to-one correspondence between symbols of and symbols of. In this paper, we propose an efficient algorithm for this problem by using both the overlapping and non-overlapping q-gram. We show the effect of running time of the algorithm on increasing the duplicity present in the code. | en_US |
| dc.description.woscitationindex | Science Citation Index Expanded | |
| dc.identifier.citationcount | 0 | |
| dc.identifier.endpage | 247 | en_US |
| dc.identifier.issn | 1330-3651 | |
| dc.identifier.issn | 1848-6339 | |
| dc.identifier.issue | 2 | en_US |
| dc.identifier.scopus | 2-s2.0-84863691567 | |
| dc.identifier.scopusquality | Q3 | |
| dc.identifier.startpage | 243 | en_US |
| dc.identifier.uri | https://hdl.handle.net/20.500.14411/8651 | |
| dc.identifier.volume | 19 | en_US |
| dc.identifier.wos | WOS:000306067900005 | |
| dc.identifier.wosquality | Q4 | |
| dc.institutionauthor | Mısra, Sanjay | |
| dc.institutionauthor | Mısra, Sanjay | |
| dc.language.iso | en | en_US |
| dc.publisher | Univ Osijek, Tech Fac | en_US |
| dc.relation.ispartof | Tehnicki Vjesnik | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.scopus.citedbyCount | 1 | |
| dc.subject | bit-parallelism | en_US |
| dc.subject | design of algorithm | en_US |
| dc.subject | hashing | en_US |
| dc.subject | plagiarism detection | en_US |
| dc.subject | q-gram | en_US |
| dc.subject | software maintenance | en_US |
| dc.subject | string matching | en_US |
| dc.title | Maintaining Software Through Bit-Parallelism and Hashing the Parameterized <i>q</I>-grams | en_US |
| dc.title.alternative | Održavanje softvera binarnim paralelizmom i pristupanje podacima parametariziranim q-gramima | en_US |
| dc.type | Article | en_US |
| dc.wos.citedbyCount | 0 | |
| dspace.entity.type | Publication | |
| relation.isAuthorOfPublication | 53e88841-fdb7-484f-9e08-efa4e6d1a090 | |
| relation.isAuthorOfPublication.latestForDiscovery | 53e88841-fdb7-484f-9e08-efa4e6d1a090 | |
| relation.isOrgUnitOfPublication | e0809e2c-77a7-4f04-9cb0-4bccec9395fa | |
| relation.isOrgUnitOfPublication.latestForDiscovery | e0809e2c-77a7-4f04-9cb0-4bccec9395fa |