Alphabet independent two dimensional matching

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 59-68

  Amir, Amihood ^a   Benson, Gary ^b   Farach, Martin ^c  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALPHABET SIZE; INPUT SIZE; LINEAR TIME; LOGARITHMIC DEPENDENCE; MODEL OF COMPUTATION; MODELS OF COMPUTATION; ORDERED ALPHABETS; STRING MATCHING;

COMPUTATION THEORY; ALGORITHMS;

CHARACTER SETS; DATA STRUCTURES; PATTERN RECOGNITION;

ALPHABET SIZE INDEPENDENCE; PREPROCESSING; STRING MATCHING PROBLEM; TWO DIMENSIONAL MATCHING;

EID: 0026992709     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129719     Document Type: Conference Paper

References (22)

1. A. Amir and G. Benson. Two-dimensional periodicity and its application. Proc. of 3rd Symoposium on Deserete Algorithms, Orlando, FL, Jan 1992.
2. A.V. Aho and M.J. Corasick. Efficient string matching. C. ACM, 18(6):333-340, 1975.
3. A. Amir and M. Farach. Two dimensional dictionary matching. Manuscript, 1991.
4. A. Amir and G. Landau. Fast parallel and serial multidimensional approximate array matching. Theoretical Computer Science, 81:97-115, 1991.
5. A. Amir, G.M. Landau, and U. Vishkin. Efficient pattern matching with scaling. Proceedings of First Symposium on Discrete Algorithms, San Fransisco, CA, 1990.
6. T.J. Baker. A technique for extending rapid exact-match string matching to arrays of more than one dimension. SIAM J. Comp, 7:533-541,1978.
7. R.S. Bird. Two dimensional pattern matching. Information Processing Letters, 6(5):168-170, 1977.
8. R.S. Boyer and J.S. Moore. A fast string searching algorithm. Comm. ACM, 20:762-772, 1977.
9. M. T. Chen and J. Seiferas. Efficient and elegant subword tree construction. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, chapter 12, pages 97-107. NATO ASI Series F: Computer and System Sciences, 1985.
10. M.J. Fischer and M.S. Paterson. String matching and other products. Complexity of Computation, R.M. Karp (editor), SIAM-AMS Proceedings, 7:113-125, 1974.
11. Z. Galil. Open problems in stringology. In Z. Galil A. Apostolico, editor, Combinatorial Algorithms on Words, volume 12, pages 1-8. NATO ASI Series F, 1985.
12. Z. Galil and J.I. Seiferas. Time-space-optimal string matching. J. Computer and System Science, 26:280-294, 1983.
13. D. Harel and R.E. Tarjan. Fast algorithms for finding nearest common ancestor. Computer and System Science, 13:338-355, 1984.
14. D.E. Knuth, J.H. Morris, and V.R. Pratt. Fast pattern matching in strings. SIAM J. Comp., 6:323-350, 1977.
15. R. Karp, R. Miller, and A. Rosenberg. Rapid identification of repeated patterns in strings, arrays and trees. Symposium on the Theory of Computing, 4:125-136,1972.
16. R.M. Karp and M.O. Rabin. Efficient randomized pattern-matching algorithms. IBM Journal of Res. and Dev., pages 249260, 1987.
17. G.M. Landau and U. Vishkin. Efficient string matching in the presence of errors. Proc. 26th IEEE FOCS, pages 126-126, 1985.
18. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23:262-272, 1976.
19. M.G. Main and R.J. Lorentz. An o(n log n) algorithm for finding all repetitions in a string. J. of Algorithms, pages 422-432, 1984.
20. A. Rosenfeld and A.C. Kak. Digital Picture Processing. Academic Press, New York, 1982.
21. U. Vishkin. Deterministic sampling - a new technique for fast pattern matching. SIAM J. Comp., 20:303-314, 1991.
22. P. Weiner. Linear pattern matching algorithm. Proc. 14 IEEE Symposium on Switching and Automata Theory, pages 111, 1973.