Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Combinatorial Pattern Matching

CPM 2003: Combinatorial Pattern Matching pp 17–31Cite as

Two-Dimensional Pattern Matching with Rotations

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2676))

Abstract

The problem of pattern matching with rotation is that of finding all occurrences of a two-dimensional pattern in a text, in all possible rotations. We prove an upper and lower bound on the number of such different possible rotated patterns. Subsequently, given an m × m array (pattern) and an n × n array (text) over some finite alphabet Σ, we present a new method yielding an O(n 2 m 3) time algorithm for this problem.

Part of this research was conducted while the first and fourth authors were visiting the University of Marne-La-Vallée supported by Arc-en-Ciel/Keshet, French-Israeli Scientific and Technical Cooperation Program.

Partially supported by NSF grant CCR-01- 04494, ISF grant 282/01, and an Israel-France exchange scientist grant funded by the Israel Ministry of Science.

partially supported by CNRS, NATO Science Programme grant PST.CLG.977017, and by Arc-en-Ciel/Keshet, French-Israeli Scientific and Technical Cooperation Program.

partially supported by NSF grants CCR-9610238 and CCR-0104307, by NATO Science Programme grant PST.CLG.977017, by the Israel Science Foundation grants 173/98 and 282/01, by the FIRST Foundation of the Israel Academy of Science and Humanities, by IBM Faculty Partnership Award, and by Arc-en-Ciel/Keshet, French-Israeli Scientific and Technical Cooperation Program.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Abrahamson. Generalized string matching. SIAM J. Comp., 16(6):1039–1051, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  2. A. Amir, A. Butman, and M. Lewenstein. Real scaled matching. Information Processing Letters, 70(4):185–190, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. Amir and M. Farach. Two dimensional dictionary matching. Information Processing Letters, 44:233–239, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  4. A. Amir and G. Landau. Fast parallel and serial multidimensional approximate array matching. Theoretical Computer Science, 81:97–115, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  5. A. Apostolico and Z. Galil (editors). Pattern Matching Algorithms. Oxford University Press, 1997.

    Google Scholar 

  6. R. Baeza-Yates and G. Valiente. An image similarity measure based on graph matching. In Proc. of the 7th Symposium on String Processing and Information Retrieval (SPIRE’2000), pages 28–38. I.E.E.E. CS Press, 2000.

    Google Scholar 

  7. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994.

    Google Scholar 

  8. M.J. Fischer and M.S. Paterson. String matching and other products. Complexity of Computation, R.M. Karp (editor), SIAM-AMS Proceedings, 7:113–125, 1974.

    Google Scholar 

  9. K. Fredriksson, G. Navarro, and E. Ukkonen. An index for two dimensional string matching allowing rotations. In Proc. IFIP International Conference on Theoretical Computer Science (IFIP TCS), volume 1872 of LNCS, pages 59–75. Springer, 2000.

    Google Scholar 

  10. K. Fredriksson, G. Navarro, and E. Ukkonen. Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations. In Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching (CPM 2002), volume 2373 of LNCS, pages 235–248. Springer, 2002.

    Chapter  Google Scholar 

  11. K. Fredriksson and E. Ukkonen. A rotation invariant filter for two-dimensional string matching. In Proc. 9th Annual Symposium on Combinatorial Pattern Matching (CPM 98), pages 118–125. Springer, LNCS 1448, 1998.

    Chapter  Google Scholar 

  12. K. Fredriksson and E. Ukkonen. Combinatorial methods for approximate pattern matching under rotations and translations in 3D arrays. In Proc. of the 7th Symposium on String Processing and Information Retrieval (SPIRE’2000), pages 96–104. I.E.E.E. CS Press, 2000.

    Google Scholar 

  13. R. Giancarlo and R. Grossi. On the construction of classes of suffix trees for square matrices: Algorithms and applications. Information and Computation, 130(2):151–182, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  14. Dan Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.

    Google Scholar 

  15. G. H. Hardy and E. M. Wright. An Introduction to the Theory of Numbers. Oxford at the Clarendon Press, fifth edition, 1979.

    Google Scholar 

  16. P. Indyk, R. Motwani, and S. Venkatasubramanian. Geometric matching under noise: Combinatorial bounds and algorithms. In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 354–360, 1999.

    Google Scholar 

  17. G. M. Landau and U. Vishkin. Pattern matching in a digitized image. Algorithmica, 12(3/4):375–408, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  18. L. Schulman and D. Cardoze. Pattern matching for spatial point sets. Proc. 39th IEEE FOCS, pages 156–165, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Amihood Amir & Ayelet Butman

  2. Department of Mathematics, Bar-Ilan University, Ramat-Gan, Israel

    Malka Schaps

  3. Bar-Ilan University, Israel

    Amihood Amir, Ayelet Butman & Malka Schaps

  4. Georgia Tech, USA

    Amihood Amir

  5. University of Marne-La-Vallée, France

    Maxime Crochemore

  6. King’s College London, London

    Maxime Crochemore

  7. University of Haifa, Haifa

    Gad M. Landau

  8. Polytechnic University, USA

    Gad M. Landau

  9. Department of Computer and Information Science, Polytechnic University, Six MetroTech Center, Brooklyn, NY, 11201-3840

    Gad M. Landau

  10. Institut Gaspard-Monge, University of Marne-La-Vallée, and King’s College London, London

    Maxime Crochemore

  11. Department of Computer Science, Haifa University, Haifa, 31905, Israel

    Gad M. Landau

Authors
  1. Amihood Amir
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ayelet Butman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maxime Crochemore
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gad M. Landau
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Malka Schaps
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Depto. de Ciencias de la Computación, Universidad de Chile, Blanco Encalada 2120, Santiago, 6511224, Chile

    Ricardo Baeza-Yates

  2. Escuela de Ciencias Físico-Matemáticas, Universidad Michoacana, Edificio “B”, ciudad universitaria, Morelia Michoacán, Mexico

    Edgar Chávez

  3. Université de Marne-la-Vallée, 77454, Marne-la-Vallée Cedex 2, France

    Maxime Crochemore

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Amir, A., Butman, A., Crochemore, M., Landau, G.M., Schaps, M. (2003). Two-Dimensional Pattern Matching with Rotations. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds) Combinatorial Pattern Matching. CPM 2003. Lecture Notes in Computer Science, vol 2676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44888-8_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-44888-8_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40311-1

  • Online ISBN: 978-3-540-44888-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation