Skip to main content
Springer Nature Link
Log in

Sublinear Algorithms for Parameterized Matching

  • Conference paper
Combinatorial Pattern Matching (CPM 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4009))

Included in the following conference series:

  • 946 Accesses

Abstract

Two strings parameterize match if there is a bijection that transforms the first string character by character into the second string. This problem has been studied in both one and two dimensions but the research has been centered on developing algorithms with good worst-case performance. We present algorithms that solve this problem in sublinear time on average for moderately repetitive patterns.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Amir, A., Aumann, Y., Cole, R., Lewenstein, M., Porat, E.: Function matching: algorithms, applications and a lower bound. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 929–942. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Amir, A., Farach, M., Muthukrishnan, S.: Alphabet dependence in parameterized matching. Information Processing Letters 49(3), 111–115 (1994)

    Article  MATH  Google Scholar 

  3. Baeza-Yates, R.: Improved string searching. Software – Practice and Experience 19(3), 257–271 (1989)

    Article  MathSciNet  Google Scholar 

  4. Baeza-Yates, R., Gonnet, G.: A new approach to text searching. Communications of ACM 35(10), 74–82 (1992)

    Article  Google Scholar 

  5. Baker, B.S.: A theory of parameterized pattern matching: algorithms and applications. In: Proceedings of the 25th ACM Symposium on the Theory of Computation, pp. 71–80 (1993)

    Google Scholar 

  6. Baker, B.S.: Parameterized pattern matching by Boyer-Moore-type algorithms. In: Proceedings of the 6th Annual ACM Symposium on Theory of Computing, pp. 541–550 (1995)

    Google Scholar 

  7. Baker, B.S.: Parameterized diff. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 854–855 (1999)

    Google Scholar 

  8. Boyer, R., Moore, J.: A fast string searching algorithm. Communications of the ACM 20(10), 762–772 (1977)

    Article  Google Scholar 

  9. Cole, R., Hariharan, R.: Faster suffix tree construction with missing suffix links. In: Proceedings of the 32nd ACM Symposium on the Theory of Computation (STOC), pp. 407–415 (2000)

    Google Scholar 

  10. Crochemore, M., Lecroq, T., Czumaj, A., Gąsieniec, L., Jarominek, S., Plandowski, W.: Speeding up two string-matching algorithms. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol. 577, pp. 589–600. Springer, Heidelberg (1992)

    Google Scholar 

  11. Fredriksson, K., Mozgovoy, M.: Sublinear parameterized single and multiple string matching. Technical Report A-2006-2, Department of Computer Science, University of Joensuu (2006)

    Google Scholar 

  12. Gimp-Savvy.com: Copyright-free photo archive: Public domain photos and images (2000), http://gimp-savvy.com/PHOTO-ARCHIVE/

  13. Hazay, C., Lewenstein, M., Sokol, D.: Approximate parameterized matching. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 414–425. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Hazay, C., Lewenstein, M., Tsur, D.: Two dimensional parameterized matching. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 266–279. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. Horspool, N.: Practical fast searching in strings. Software – Practise and Experience 10, 501–506 (1980)

    Article  Google Scholar 

  16. Idury, R.M., Schäffer, A.A.: Multiple matching of parameterized patterns. Theorethical Computer Science 154(2), 203–224 (1996)

    Article  MATH  Google Scholar 

  17. Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM Journal of Computing 6, 323–350 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  18. Kosaraju, S.R.: Faster algorithms for the construction of parameterized suffix trees. In: Proceedings of the 36th Symposium on Foundation of Computer Science (FOCS), pp. 631–637 (1995)

    Google Scholar 

  19. Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms: Generation, Enumeration and Search. CRC Press, Boca Raton (1999)

    MATH  Google Scholar 

  20. Tarhio, J.: A sublinear algorithm for two dimensional string matching. Pattern Recognition Letters 17, 833–838 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Helsinki University of Technology,  

    Leena Salmela & Jorma Tarhio

Authors
  1. Leena Salmela
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jorma Tarhio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Bar-Ilan University, 52900, Ramat-Gan, Israel

    Moshe Lewenstein

  2. Department of Software, Technical University of Catalonia, 08034, Barcelona, Spain

    Gabriel Valiente

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Salmela, L., Tarhio, J. (2006). Sublinear Algorithms for Parameterized Matching. In: Lewenstein, M., Valiente, G. (eds) Combinatorial Pattern Matching. CPM 2006. Lecture Notes in Computer Science, vol 4009. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780441_32

Download citation

  • DOI: https://doi.org/10.1007/11780441_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35455-0

  • Online ISBN: 978-3-540-35461-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics