Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 1996: Algorithms and Computation pp 85–94Cite as

Two-dimensional dynamic dictionary matching

  • Session 3b: Invited Presentation
  • Conference paper
  • First Online:

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

Abstract

This paper is concerned with the problem of managing a dynamically changing set of two-dimensional patterns (the dictionary) to support efficient searching for all occurrences of the patterns in a given text. The dictionary has to be updated efficiently when a pattern is inserted or deleted. The contribution of this paper is an improvement to the existing suffix-tree based solution [Gi93] as regards both the update and search algorithms. In comparison with the previously best scheme [AFI+93] (which is non-suffix-tree based), our new solution can perform an update more efficiently, without trading the searching time bound. Our work also gives a clue to improve the solution to the static dictionary matching problem [AF92].

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho and M.J. Corasick, Efficient string matching, Comm. ACM 18 (1975) 333–340.

    Article  Google Scholar 

  2. T.J. Baker, A technique for extending rapid exact-match string matching to arrays of more than one dimension, SIAM J. Comput. 7 (1978), 533–541.

    Article  Google Scholar 

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

    Article  Google Scholar 

  4. A. Amir, M. Farach, R. Giancarlo, Z. Galil and K. Park, Dynamic dictionary matching, Journal of Computer and System Sciences 49 (1994), 208–222.

    Article  Google Scholar 

  5. A. Amir, M. Farach, R.M. Idury, H.A. La Poutre and A.A. Schäffer, Improved dynamic dictionary matching, Proc. of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, 1993, 392–401.

    Google Scholar 

  6. R. Giancarlo, The suffix of a square matrix, with applications, Proc. of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, 1993, 402–412.

    Google Scholar 

  7. R. Giancarlo, A generalization of the suffix tree to square matrix, with applications, SIAM Journal of Computing 24 (1995), 520–562.

    Article  Google Scholar 

  8. R. Idury and A.A. Schäffer, Multiple matching of rectangular patterns, Information and Computation, 117 (1995), 78–90.

    Article  Google Scholar 

  9. E.M. McCreight, A space-economical suffix tree construction algorithm, J. ACM 23 (1976), 262–272.

    Article  Google Scholar 

  10. D.D. Sleator and R.E. Tarjan, A data structure for dynamic trees, Journal of Computer and System Sciences 26 (1983), 362–391.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Hong Kong, Hong Kong

    Ying Choi & Tak Wah Lam

Authors
  1. Ying Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tak Wah Lam
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tetsuo Asano Yoshihide Igarashi Hiroshi Nagamochi Satoru Miyano Subhash Suri

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Choi, Y., Lam, T.W. (1996). Two-dimensional dynamic dictionary matching. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009484

Download citation

  • DOI: https://doi.org/10.1007/BFb0009484

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62048-8

  • Online ISBN: 978-3-540-49633-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation