Alphabet Independent and Dictionary Scaled Matching

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.

[1]  Zvi Galil,et al.  Truly alphabet-independent two-dimensional pattern matching , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[2]  Raffaele Giancarlo,et al.  The Suffix of a square matrix, with applications , 1993, SODA '93.

[3]  Gary Benson,et al.  Efficient two-dimensional compressed matching , 1992, Data Compression Conference, 1992..

[4]  Gad M. Landau,et al.  Efficient pattern matching with scaling , 1990, SODA '90.

[5]  Gary Benson,et al.  Two-dimensional periodicity and its applications , 1992, SODA '92.

[6]  Yossi Matias,et al.  Efficient Randomized Dictionary Matching Algorithms (Extended Abstract) , 1992, CPM.

[7]  G. Benson,et al.  An Alphabet Independent Approach to Two Dimensional Matching , 1994 .

[8]  Alejandro A. Schäffer,et al.  Improved dynamic dictionary matching , 1995, SODA '93.

[9]  Z. Galil,et al.  Pattern matching algorithms , 1997 .

[10]  Gary Benson,et al.  Optimal parallel two dimensional pattern matching , 1993, SPAA '93.

[11]  Wojciech Rytter,et al.  Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[12]  Gary Benson,et al.  Optimal Two-Dimensional Compressed Matching , 1994, J. Algorithms.

[13]  Wojciech Rytter,et al.  Text Algorithms , 1994 .

[14]  Uzi Vishkin,et al.  Symmetry breaking for suffix tree construction , 1994, STOC '94.

[15]  Edward M. McCreight,et al.  A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[16]  Zvi Galil,et al.  Alphabet-Independent Two-Dimensional Witness Computation , 1996, SIAM J. Comput..

[17]  Gary Benson,et al.  The Truth, the Whole Truth, and Nothing but the Truth: Alphabet Independent Two Dimensional Witness Table Construction , 1993 .

[18]  Gary Benson,et al.  Alphabet independent two dimensional matching , 1992, STOC '92.

[19]  Uzi Vishkin,et al.  Matching Patterns in Strings Subject to Multi-Linear Transformations , 1988, Theor. Comput. Sci..

[20]  Robert E. Tarjan,et al.  Scaling and related techniques for geometry problems , 1984, STOC '84.

[21]  Alejandro A. Schäffer,et al.  Multiple matching of rectangular patterns , 1993, STOC '93.

[22]  Amihood Amir,et al.  Two-Dimensional Dictionary Matching , 1992, Inf. Process. Lett..

[23]  Peter Weiner,et al.  Linear Pattern Matching Algorithms , 1973, SWAT.

[24]  Roberto Grossi,et al.  On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications , 1995, Inf. Comput..

[25]  Robert E. Tarjan,et al.  Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..