Abstract
This paper defines a new pattern matching problem by combining two paradigms: δγ–matching and parameterized matching. The solution is essentially obtained by a combination of bitparallel techniques and a reduction to a graph matching problem. The time complexity of the algorithm is O(nm), assuming text size n, pattern size m and a constant size alphabet.
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
Amir, A., Aumann, Y., Cole, R., Lewenstein, M., Porat, E.: Function matching: algorithms, applications, and a lower bound. In: Proc. 30th International Colloquium on Automata, Languages and Programming, pp. 929–942 (2003)
Amir, A., Aumann, Y., Indyk, P., Levy, A., Porat, E.: Efficient computations of \(\scriptstyle L_1\) and \(\scriptstyle L_{\infty}\) rearrangement distances. In: Proc. 14th String Processing and Information Retrieval, pp. 39–49 (2007)
Amir, A., Farach, M., Muthukrishnan, S.: Alphabet dependence in parameterized matching. Inform. Process. Lett. 49(3), 111–115 (1994)
Amir, A., Lipsky, O., Porat, E.: Approximate matching in the \(\scriptstyle L_1\) metric. In: Proc. 16th Annual Symposium on Combinatorial Pattern Matching, pp. 91–103 (2005)
Amir, A., Nor, I.: Generalized function matching. J. Discrete Algorithms 5(3), 514–523 (2007)
Apostolico, A., Galil, Z.: Pattern matching algorithms. Oxford University Press, Oxford (1997)
Apostolico, A., Erds, P.L., Lewenstein, M.: Parameterized matching with mismatches. J. Discrete Algorithms 5(1), 135–140 (2007)
Apostolico, A., Giancarlo, R.: Periodicity and repetitions in parameterized strings. Discrete Appl. Math. 156(9), 1389–1398 (2008)
Babu, G.P., Mehtre, B.M., Kankanhalli, M.S.: Color indexing for efficient image retrieval. Multimedia Tools and Applications 1(4), 327–348 (1995)
Baker, B.S.: A theory of parameterized pattern matching: algorithms and applications. In: Proc. 25th Annual Symposium on Theory of Computing, pp. 71–80 (1993)
Baker, B.S.: Parameterized pattern matching by Boyer-Moore-type algorithms. In: Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms 1995, pp. 541–550 (1995)
Baker, B.S.: Parameterized pattern matching: algorithms and applications. J. Comput. Syst. Sci. 52(1), 28–42 (1996)
Baker, B.S.: Parameterized duplication in strings: algorithms and an application to software maintenance. SIAM J. Comput. 26(5), 1343–1362 (1997)
Baker, B.S.: Parameterized diff. In: Proc. 10th Symposium on Discrete Algorithms, pp. 854–855 (1999)
Cambouropoulos, E., Crochemore, M., Iliopoulos, C.S., Mouchard, L., Pinzon, Y.J.: Algorithms for computing approximate repetitions in musical sequences. Int. J. Comput. Math. 79(11), 1135–1148 (2002)
Cambouropoulos, E., Tsougras, C.: Influence of musical similarity on melodic segmentation: representations and algorithms. In: Proc. International Conference on Sound and Music Computing (2004)
Cantone, D., Cristofaro, S., Faro, S.: An efficient algorithm for \(\scriptstyle \delta\)-approximate matching with \(\scriptstyle \alpha\)-bounded gaps in musical sequences. In: Proc. 4th International Workshop on Efficient and Experimental Algorithms, pp. 428–439 (2005)
Cantone, D., Cristofaro, S., Faro, S.: On tuning the (\(\scriptstyle \delta\);\(\scriptstyle \alpha\))-sequential-sampling algorithm for \(\scriptstyle \delta\)-approximate matching with \(\scriptstyle \alpha\)-bounded gaps in musical sequences. In: Proc. 6th International Conference on Music Information Retrieval (2005)
Clifford, P., Clifford, R., Iliopoulos, C.S.: Faster algorithms for delta, gamma-matching and related problems. In: Proc. 16th Annual Symposium on Combinatorial Pattern Matching, pp. 68–78 (2005)
Cole, R., Hariharan, R.: Faster suffix tree construction with missing suffix links. In: Proc. 32nd ACM Symposium on Theory of Computing, pp. 407–415 (2000)
Cole, R., Iliopoulos, C.S., Lecroq, T., Plandowski, W., Rytter, W.: On special families of morphisms related to \(\scriptstyle \delta\)-matching and don’t care symbols. In: Inform. Process. Lett., pp. 227–233 (2003)
Crawford, T., Iliopoulos, C.S., Raman, R.: String matching techniques for musical similarity and melodic recognition. Computers and Musicology 11, 72–100 (1998)
Cui, B., Jagadish, H.V., Ooi, B.C., Tan, K.: Compacting music signatures for efficient music retrieval. In: Proc. 11th international Conference on Extending Database Technology: Advances in Database Technology, pp. 229–240 (2008)
Crochemore, M., Iliopoulos, C.S., Lecroq, T., Plandowski, W., Rytter, W.: Three heuristics for \(\scriptstyle \delta\)-matching: \(\scriptstyle \delta\)-BM algorithms. In: Proc. 13th Annual Symposium on Combinatorial Pattern Matching, pp. 178–189 (2002)
Crochemore, M., Iliopoulos, C.S., Lecroq, T., Pinzon, Y.J., Plandowski, W., Rytter, W.: Occurence and substring heuristics for \(\scriptstyle \delta\)-matching. Fundam. Inf. 56(1-2), 1–21 (2003)
Crochemore, M., Iliopoulos, C.S., Navarro, G., Pinzon, Y., Salinger, A.: Bit-parallel (delta,gamma)-matching suffix automata. J. Discrete Algorithms 3(2-4), 198–214 (2004)
Feder, T., Montwani, R.: Clique partitions, graph compression and speeding-up algorithms. J. Comp. Sys. Sci. 51, 261–272 (1995)
Fredriksson, K., Grabowski, S.: Efficient Algorithms for (\(\scriptstyle\delta\), \(\scriptstyle\gamma\), \(\scriptstyle\alpha\)) and (\(\scriptstyle\delta\), \(\scriptstyle k_{\triangle}\), \(\scriptstyle\alpha\))–matching. Int. J. Found. Comp. Sc. 19(1), 163–183 (2008)
Fredriksson, K., Mozgovoy, M.: Efficient parameterized string matching. Inform. Process. Lett. 100(3), 91–96 (2006)
Hazay, C., Lewenstein, M., Sokol, D.: Approximate parameterized matching. ACM Trans. Algorithms 3(3), 29 (2007)
Hazay, C.: Parameterized matching. Master’s thesis, Bar-Ilan University (2004)
Hopcroft, J.E., Karp, R.M.: An \(\scriptstyle n^{5/2}\) algorithm for the maximum matching in bipartite graphs. SIAM J. Comp. 2, 225–231 (1973)
Idury, R.M., Schäffer, A.A.: Multiple matching of parameterized patterns. Theor. Comput. Sci. 154(2), 203–224 (1996)
Iliopoulos, C.S., Kubica, M., Rahman, M.S., Walen, T.: Algorithms for computing the longest parameterized common subsequence. In: Proc. 18th Annual Symposium on Combinatorial Pattern Matching, pp. 265–273 (2007)
Kao, M., Lam, T., Sung, W., Ting, H.: A decomposition theorem for maximum weight bipartite matchings. SIAM J. Comput. 31(1), 18–26 (2002)
Kosaraju, S.R.: Faster algorithms for the construction of parameterized suffix trees. In: Proc. 36th Annual Symposium on Foundations of Computer Science, pp. 631–637 (1995)
Kuhn, H.W.: The Hungarian methos for the assigment problem. Naval Res. Logist. Quart. 2, 83–97 (1955)
Landau, G.M., Vishkin, U.: Introducing efficient parallelism into approximate string matching. In: Proc. 18th ACM Symposium on Theory of Computing, pp. 220–230 (1986)
Lee, I., Clifford, R., Kim, S.K.: Algorithms on extended delta, gamma-matching. In: International Conference on Computational Science and its Applications, pp. 1137–1142 (2006)
Lipsky, O.: Efficient distance computations. Master’s thesis, Bar-Ilan University (2003)
Lipsky, O., Porat, E.: Approximate pattern matching with the \(\scriptstyle L_1\), \(\scriptstyle L_2\) and \(\scriptstyle L_{\infty}\) metrics (manuscript, 2002)
Lipsky, O., Porat, E.: Approximate matching in the \(\scriptstyle L_{\infty}\) metric. Inf. Process. Lett. 105(4), 138–140 (2008)
Lipsky, O., Porat, E.: L1 pattern matching lower bound. Inf. Process. Lett. 105(4), 141–143 (2008)
Maasoumi, E., Racine, J.: Entropy and predictability of stock market returns. J. Econometrics 107(1), 291–312 (2002)
du Mouza, C., Rigauxb, P., Scholla, M.: Parameterized pattern queries. Data Knowl. Eng. 63(2), 433–456 (2007)
Pinzon-Ardila, Y.J., Christodoulakis, M., Iliopoulos, C.S., Mohamed, M.: Efficient (delta,gamma)-matching with don’t cares. In: Proc. 16th Australasian Workshop on Combinatorial Algorithms, pp. 27–38 (2005)
Porat, E., Efremenko, K.: Approximating general metric distances between a pattern and a text. In: Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 419–427 (2008)
Salmela, L., Tarhio, J.: Sublinear Algorithms for Parameterized Matching. In: Proc. 17th Annual Symposium on Combinatorial Pattern Matching, pp. 354–364 (2006)
Swain, M., Ballard, D.: Color indexing. Int. J. Comput. Vis. 7(1), 11–32 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, I., Mendivelso, J., Pinzón, Y.J. (2008). δγ – Parameterized Matching. In: Amir, A., Turpin, A., Moffat, A. (eds) String Processing and Information Retrieval. SPIRE 2008. Lecture Notes in Computer Science, vol 5280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89097-3_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-89097-3_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89096-6
Online ISBN: 978-3-540-89097-3
eBook Packages: Computer ScienceComputer Science (R0)