The Design of Efficient Algorithms for Two-Dimensional Pattern Matching.

@article{DBLP:journals/tkde/FanS95,
  author    = {Jang-Jong Fan and
               Keh-Yih Su},
  title     = {The Design of Efficient Algorithms for Two-Dimensional Pattern
               Matching},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {7},
  number    = {2},
  year      = {1995},
  pages     = {318-327},
  ee        = {db/journals/tkde/FanS95.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1995 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-3 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

References

[1]

Theodore P. Baker: A Technique for Extending Rapid Exact-Match String Matching to Arrays of More Than One Dimension. SIAM J. Comput. 7(4): 533-541(1978) BibTeX

[2]

Donald E. Knuth, James H. Morris Jr., Vaughan R. Pratt: Fast Pattern Matching in Strings. SIAM J. Comput. 6(2): 323-350(1977) BibTeX

[3]

Richard S. Bird: Two Dimensional Pattern Matching. Inf. Process. Lett. 6(5): 168-170(1977) BibTeX

[4]

Alfred V. Aho, Margaret J. Corasick: Efficient String Matching: An Aid to Bibliographic Search. Commun. ACM 18(6): 333-340(1975) BibTeX

[5]

Rui Feng Zhu, Tadao Takaoka: A Technique for Two-Dimensional Pattern Matching. Commun. ACM 32(9): 1110-1120(1989) BibTeX

[6]

Robert Sedgewick: Algorithms. Addison-Wesley 1983, ISBN 0-201-06672-6
BibTeX

[7]

Robert S. Boyer, J. Strother Moore: A Fast String Searching Algorithm. Commun. ACM 20(10): 762-772(1977) BibTeX

[8]

Jang-Jong Fan, Keh-Yih Su: An Efficient Algorithm for Matching Multiple Patterns. IEEE Trans. Knowl. Data Eng. 5(2): 339-351(1993) BibTeX

[9]

Zvi Galil: On Improving the Worse Case Running Time of the Boyer-Moore String Matching Algorithm. Commun. ACM 22(9): 505-508(1979) BibTeX