Study of Bit-Parallel Approximate Parameterized String Matching Algorithms
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 insoftware 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 identifiers and variables. In the approximate parameterized matching, a given pattern P matches the given substring t of the text T with k ≥ 0 errors, if P can be transformed into t with at most k modifications (insertion, deletion, replacement). In this paper, we extend Myers Bit-Parallel algorithm and Approximate String Matching by using Bit-Parallel NFA (both for approximate matching), for parameterized string matching problem. These extended algorithms are known as PAMA and PABPA respectively. Theoretically, PAMA algorithm is faster than PABPA algorithm. The above algorithms are applicable only when pattern length (m) is less than word length (w) of computer used (i.e. m ≤ w).
KeywordsAlgorithm finite automata bit-parallelism approximate matching Non-deterministic finite automata prev-encoding and parameterized matching
Unable to display preview. Download preview PDF.
- 8.Salmela, L., Tarhio, J.: Fast Parameterized Matching with q-grams. In: Proc. of 7th Combinatorial Pattern Matching (CPM), pp. 354–364 (2006)Google Scholar
- 9.Apostolico, A., Erdos, P., Lewenstein, M.: Parameterized matching with mismatches. Journal of discrete algorithms (to appear)Google Scholar
- 10.Baker, B.S.: Parameterized diff. In: Proc. 10th Symposium on Discrete Algorithm (SODA), pp. 854–855 (1999)Google Scholar
- 12.Hyyro, H.: Explaining and extending the bit-parallel approximate string matching algorithm of Myers. Tech. Rep. A-2001-10, Department of Computer Science and Information Sciences, University of Tampere, Tampere, Finaland (2001)Google Scholar
- 15.Prasad, R., Agarwal, S.: Parameterized shift-and string matching algorithm using super alphabet. In: Proc of the International Conference on Computer and Communication Engineering (available on IEEE Xplore), pp. 937–942 (2008)Google Scholar