Skip to main content
SpringerLink
Log in

Alphabet independent and dictionary scaled matching

  • Conference paper
  • First Online:
Combinatorial Pattern Matching (CPM 1996)

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

Included in the following conference series:

Abstract

The rapidly growing need for analysis of digitized images in multimedia systems has lead to a variety of interesting problems in multidimensional pattern matching. One of the problems is that of scaled matching, finding all appearances of a pattern in a text in all sizes. Another important problem is dictionary matching, quick search through a dictionary of preprocessed patterns in order to find all dictionary patterns that appear in the input text.

In this paper we provide a very simple algorithm for two dimensional scaled matching. Our algorithm is the first linear-time alphabet-independent scaled matching algorithm. Its running time is O(¦T¦), where ¦T¦ is the text size, and is independent of ¦Σ¦, the size of the alphabet. The main idea behind our algorithm is identifying and exploiting a scaling invariant property of patterns.

Our technique generalizes to produce the first known algorithm for scaled dictionary matching. We can find all appearances of all dictionary patterns that appear in the input text in any discrete scale. The time bounds of our algorithm are equal to the best known exact (no scaling) two dimensional dictionary matching algorithms.

Partially supported by NSF grant CCR-92-23699 and the Israel Ministry of Science grant number 6297.

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.

References

  1. A. Amir and G. Benson. Efficient two dimensional compressed matching. Proc. of Data Compression Conference, Snow Bird, Utah, pages 279–288, Mar 1992.

    Google Scholar 

  2. A. Amir and G. Benson. Two-dimensional periodicity and its application. Proc. of 3rd Symposium on Discrete Algorithms, Orlando, FL, pages 440–452, Jan 1992.

    Google Scholar 

  3. A. Amir, G. Benson, and M. Farach. The truth, the whole truth, and nothing but the truth: Alphabet independent two dimensional witness table construction. Technical Report GIT-CC-92/52, Georgia Institute of Technology, August 1992.

    Google Scholar 

  4. A. Amir, G. Benson, and M. Farach. Optimal parallel two dimensional pattern matching. Proc. of the 5th ACM Symp. on Parallel Algorithms and Architectures, pages 79–85, 1993.

    Google Scholar 

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

    Google Scholar 

  6. A. Amir, G. Benson, and M. Farach. Optimal two-dimensional compressed matching. Proc. ICALP 94, pages 215–226, 1994.

    Google Scholar 

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

    Google Scholar 

  8. A. Amir, M. Farach, R.M. Idury, J.A. La Poutré, and A.A Schäffer. Improved dynamic dictionary matching. Proc. 4th ACM-SIAM SODA, pages 392–401, 1993.

    Google Scholar 

  9. A. Amir, M. Farach, and Y. Matias. Efficient randomized dictionary matching algorithms. Proc. 3rd. Combinatorial Pattern Matching Conference, pages 259–272, 1992. Tucson, Arizona.

    Google Scholar 

  10. A. Amir, G.M. Landau, and U. Vishkin. Efficient pattern matching with scaling. Journal of Algorithms, 13(1):2–32, 1992.

    Google Scholar 

  11. R. Cole, M. Crochemore, Z. Galil, L. Gasieniec, R. Harihan, S. Muthukrishnan, K. Park, and W. Rytter. Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions. Proc. 34th IEEE FOCS, pages 248–258, 1993.

    Google Scholar 

  12. Larry S. Davis. Personal Communication, 1989.

    Google Scholar 

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

    Google Scholar 

  14. R. Giancarlo. The suffix of a square matrix, with applications. Proc. 4th SODA, pages 402–410, 1993.

    Google Scholar 

  15. D. Harel and R.E. Tarjan. Fast algorithms for finding nearest common ancestor. Computer and System Science, 13:338–355, 1984.

    Google Scholar 

  16. R.M. Idury and A.A Schäffer. Multiple matching of rectangular patterns. Proc. 25th ACM STOC, pages 81–89, 1993.

    Google Scholar 

  17. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23:262–272, 1976.

    Article  Google Scholar 

  18. K. Park and Z. Galil. Truly alphabet-independent two-dimensional pattern matching. Proc. 33rd IEEE FOCS, pages 247–256, 1992.

    Google Scholar 

  19. A. Pentland. Invited talk. NSF Institutional Infrastructure Workshop, 1992.

    Google Scholar 

  20. P. Weiner. Linear pattern matching algorithm. Proc. 14 IEEE Symposium on Switching and Automata Theory, pages 1–11, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Amihood Amir

  2. College of Computing, Georgia Institute of Technology, 30332-0280, Atlanta, GA

    Amihood Amir & Gruia Calinescu

Authors
  1. Amihood Amir
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gruia Calinescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dan Hirschberg Gene Myers

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Amir, A., Calinescu, G. (1996). Alphabet independent and dictionary scaled matching. In: Hirschberg, D., Myers, G. (eds) Combinatorial Pattern Matching. CPM 1996. Lecture Notes in Computer Science, vol 1075. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61258-0_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-61258-0_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61258-2

  • Online ISBN: 978-3-540-68390-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation