The submatrices character count problem: An efficient solution using separable values

Information and Computation

Volumn 190, Issue 1, 2004, Pages 100-116

  Amir, Amihood ^a,b   Church, Kenneth W ^c   Dar, Emanuel ^a  

^a BAR ILAN UNIVERSITY   (Israel)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; THEOREM PROVING;

SEPARABLE VALUES ALGORITHM; SUBMATRICES;

MATRIX ALGEBRA;

EID: 1842764964     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2003.12.001     Document Type: Article

References (13)

1. A.V. Aho, M.J. Corasick, Efficient string matching, Commun. ACM 18 (6) (1975) 333-340.
2. A. Amir, Y. Aumann, G. Landau, M. Lewenstein, N. Lewenstein, Pattern matching with swaps, J. Algorithms 37 (2000) 247-266 (Preliminary version appeared at FOCS 97).
3. A. Amir, K.W. Church, E. Dar, Separable attributes: a technique for solving the submatrices character count problem, in: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, pp. 400-401.
4. A. Amir, M. Farach, Efficient 2-dimensional approximate matching of half-rectangular figures, Inform. Comput. 118 (1) (1995) 1-11.
5. A. Amir, M. Farach, S. Muthukrishnan, Alphabet dependence in parameterized matching, Inform. Process. Lett. 49 (1994) 111-115.
6. 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.
7. R.S. Bird, Two dimensional pattern matching, Inform. Process. Lett. 6 (5) (1977) 168-170.
8. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, McGraw-Hill, 1992.
9. J.D. Foley, A. van Dam, S.K. Feiner, J.F. Hughes, Computer Graphics: Principles and Practice, Addison-Wesley, Reading, MA, 1990.
10. J. Hafner, H.S. Sawhney, W. Equitz, M. Flickner, W. Niblack, Efficient color histogram indexing for quadratic form distance functions, IEEE Trans. Pattern Anal. Mach. Intell. 17 (7) (1995) 729-736.
11. R. Janardan, M.A. Lopez, Generalized intersection searching problems, Int. J. Comput. Geom. Appl. 3 (1993) 39-69.
12. D.E. Knuth, J.H. Morris, V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (1977) 323-350.
13. A.C.C. Yao, Near-optimal time-space tradeoff for element distinctness, in: Proceedings of the 29th IEEE Annual Symposium on Foundations of Computer Science, 1988, pp. 91-97.