Abstract
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).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Communication of ACM 35(10), 74–82 (1992)
Boyer, R.S., Moore, J.S.: A fast string-searching algorithm. Communication of ACM 20(10), 762–772 (1977)
Baeza-Yates, R., Navarro, G.: Faster approximate string matching. Algorithmica 23(2), 127–158 (1999)
Hyyro, H., Navarro, G.: Faster bit-parallel approximate string matching. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, pp. 203–224. Springer, Heidelberg (2002)
Navarro, G.: A guided tour to approximate string matching. ACM Computing Survey 33(1), 31–88 (2001)
Baker, B.S.: Parameterized duplication in string algorithm and application in software maintenance. SIAM J. Computing 26(5), 1343–1362 (1997)
Fredriksson, K., Mozgovoy, M.: Efficient parametrized string matching. Information Processing Letters (IPL) 100(3), 91–96 (2006)
Salmela, L., Tarhio, J.: Fast Parameterized Matching with q-grams. In: Proc. of 7th Combinatorial Pattern Matching (CPM), pp. 354–364 (2006)
Apostolico, A., Erdos, P., Lewenstein, M.: Parameterized matching with mismatches. Journal of discrete algorithms (to appear)
Baker, B.S.: Parameterized diff. In: Proc. 10th Symposium on Discrete Algorithm (SODA), pp. 854–855 (1999)
Myers, G.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. Journal of the ACM 46(3), 395–415 (1999)
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)
Wu, S., Manber, U.: Fast text searching allowing errors. Communication of the ACM 35(10), 83–91 (1992)
Sellers, P.: The theory and computation of evolutionary distances: pattern recognition. Journal of Algorithms 1, 359–373 (1980)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prasad, R., Agarwal, S. (2009). Study of Bit-Parallel Approximate Parameterized String Matching Algorithms. In: Ranka, S., et al. Contemporary Computing. IC3 2009. Communications in Computer and Information Science, vol 40. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03547-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-03547-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03546-3
Online ISBN: 978-3-642-03547-0
eBook Packages: Computer ScienceComputer Science (R0)