By Topic

Parameterized shift-and string matching algorithm using super alphabet

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Prasad, R. ; Motilal Nehru Nat. Inst. of Technol., Allahabad ; Agarwal, S.

In the parameterized string matching, a given pattern P is said to match with a sub-string t of the text T, if there exist a bijection from the symbols of P to the symbols of t. This problem has an important application in software maintenance where it is required to find equivalency between two sections of codes. Two sections of codes are said to be equivalent if one can be transformed into the other by renaming identifiers and variables only. In this paper, we extend shift-and string matching algorithm to find all such occurrences of P in T. The new algorithm is named as parameterized shift-and (PSA) string matching algorithm. We further extend PSA by using the concept of super alphabets. Implementation results show that by using a super alphabet of size s, the algorithm (PSA) is speeded-up by a factor of s, where s is size of the super alphabet (i.e. s is the number of characters processed simultaneously). We also show the performance of super alphabet PSA with respect to duplicity present in the code. However these algorithms are applicable only when pattern length (m) is less than or equal to word length (w) of computer used (i.e. m les w).

Published in:

Computer and Communication Engineering, 2008. ICCCE 2008. International Conference on

Date of Conference:

13-15 May 2008