Skip to main content
SpringerLink
Log in

Two Dimensional Parameterized Matching

  • Conference paper
Combinatorial Pattern Matching (CPM 2005)

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

Included in the following conference series:

Abstract

Two equal length strings, or two equal sized two dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two dimensional parameterized matching is the task of finding all m × m substrings of an n× n text that p-match to an m× m pattern. This models, for example, searching for color images with changing of color maps. We present an algorithm that solves the two dimensional parameterized matching problem in O(n 2+m 2.5·polylog(m)) time.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Naor, M.: Derandomization, witnesses for boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16, 434–449 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. 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 

  3. Amir, A., Benson, G., Farach, M.: An alphabet independent approach to two dimensional pattern matching. SIAM J. on Computing 23(2), 313–323 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  4. Amir, A., Church, K.W., Dar, E.: Separable attributes: a technique for solving the submatrices character count problem. In: Proc. 13th Symposium on Discrete Algorithms (SODA), pp. 400–401 (2002)

    Google Scholar 

  5. Amir, A., Cole, R.: Personal communications (2004)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  7. Apostolico, A., Erdös, P., Lewenstein, M.: Parameterized matching with mismatches (manuscript)

    Google Scholar 

  8. Babu, G.P., Mehtre, B.M., Kankanhalli, M.S.: Color indexing for efficient image retrieval. Multimedia Tools and Applications 1(4), 327–348 (1995)

    Article  Google Scholar 

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

    Google Scholar 

  10. Baker, B.S.: Parameterized string pattern matching. J. Comput. Systems Sci. 52(1), 28–42 (1996)

    Article  MATH  Google Scholar 

  11. Baker, B.S.: Parameterized duplication in strings: Algorithms and an application to software maintenance. SIAM J. on Computing 26(5), 1343–1362 (1997)

    Article  MATH  Google Scholar 

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

    Google Scholar 

  13. Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proc. 16th ACM Symposium on Theory of Computing (STOC), vol. 67, pp. 135–143 (1984)

    Google Scholar 

  14. Gupta, P., Janardan, R., Smid, M.: Further results on generalized intersection searching problems: Counting, reporting, and dynamization. J. of Algorithms 19(2), 282–317 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  15. 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 

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

    Google Scholar 

  17. Swain, M., Ballard, D.: Color indexing. International Journal of Computer Vision 7(1), 11–32 (1991)

    Article  Google Scholar 

  18. Vishkin, U.: Optimal parallel pattern matching in strings. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol. 194, pp. 91–113. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  19. Vishkin, U.: Deterministic sampling — a new technique for fast pattern matching. SIAM J. on Computing 20, 303–314 (1991)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bar-Ilan University,  

    Carmit Hazay & Moshe Lewenstein

  2. University of California, San Diego

    Dekel Tsur

Authors
  1. Carmit Hazay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Moshe Lewenstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dekel Tsur
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology and Università di Padova,  

    Alberto Apostolico

  2. Université Paris-Est, France

    Maxime Crochemore

  3. School of Computer Science and Engineering, Seoul National University, 151-742, Seoul, Korea

    Kunsoo Park

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hazay, C., Lewenstein, M., Tsur, D. (2005). Two Dimensional Parameterized Matching. In: Apostolico, A., Crochemore, M., Park, K. (eds) Combinatorial Pattern Matching. CPM 2005. Lecture Notes in Computer Science, vol 3537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496656_23

Download citation

  • DOI: https://doi.org/10.1007/11496656_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26201-5

  • Online ISBN: 978-3-540-31562-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation