By Topic

An Efficient String Matching Algorithm Using Super Alphabets

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. ; LDC Inst. of Tech. Studies, Allahabad ; Agarwal, S.

In the parameterized string matching, a given pattern P is said to match with a substring 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 we wish to find the 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 the identifiers and variables. In this paper, we extend parameterized shift-or (PSO) string matching algorithm (Kimmo Fredriksson & Maxim Mozgovoy, 2006) by using the concept of super alphabets. This new algorithm we call as parameterized super alphabet shift-or (PSSO) algorithm. Implementation results show that by using a super alphabet of size s, the PSO algorithm is speeded-up by a factor of s, where s is the size of the super alphabet (i.e. s is the number of characters processed simultaneously). We also show the performance of PSSO algorithm with respect to duplicity present in the code. However, PSSO algorithm is 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:

Emerging Trends in Engineering and Technology, 2008. ICETET '08. First International Conference on

Date of Conference:

16-18 July 2008