Efficient pattern matching with scaling

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1990, Pages 344-357

  Amir, Amihood ^a   Landau, Gad M ^b   Vishkin, Uzi ^c  

^a UNIVERSITY OF MARYLAND   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; ELASTIC MODULI; ONE DIMENSIONAL; PATTERN MATCHING;

ALGORITHMIC APPROACH; LINEAR-TIME ALGORITHMS; NATURAL NUMBER; NEW APPROACHES; ONE DIMENSIONAL PROBLEMS; RUNNING TIME; STRING MATCHING; TWO-DIMENSIONAL PROBLEM;

MATRIX ALGEBRA;

EID: 85029739324     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. [AC-75] A. V. Aho and M. J. Corasick, "Efficient string matching", C. ACM, Vol. 18, No. 6, 1975, pp. 333-340.
2. [AILSV-88] A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber, and U. Vishkin, "Parallel Construction of a Suffix Tree with applications", Algorithmica, Vol. 3, 1988, pp. 347-365.
3. [AL-87] A. Amir and G. Landau, "Fast Parallel and Serial Multidimensional Approximate Array Matching", to appear, Proc. of the International Workshop on Sequences, Combinatorics, Compression, Security and Transmission, Salerno, Italy, June 1988.
4. Also, to appear in Theoretical Computer Science.
5. [Ba-78] T. J. Baker, "A Technique for Extending Rapid Exact-Match String Matching to Arrays of more than One Dimension", SIAM J. Comp., Vol. 7, 1978, pp. 533-541.
6. [B-77] R. S. Bird, "Two Dimensional Pattern Matching", Information Processing Letters, Vol. 6, No. 5, 1977, pp. 168-170.
7. [BBGSV-89] O. Berkman, D. Breslauer, Z. Galil, B. Schieber and U. Vishkin, "Highly Parallelizable Problems", Proc. 21st ACM Symposium on Theory of Computing, 1989, pp. 309-319. This is a conference version that contains results from [BSV-88].
8. [BSV-88] O. Berkman, B. Schieber and U. Vishkin, "Some doubly logarithmic optimal parallel algorithms based on finding all nearest smaller values", UMIACS-TR-88-79, University of Maryland, College Park, MD 20742, October 1988.
9. [BV-89] O. Berkman and U. Vishkin, "Recursive ∗-tree parallel data structure", Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, to appear.
10. [BM-77] R. S. Boyer and J. S. Moore, "A Fast String Searching Algorithm", Comm. ACM, Vol. 20, 1977, pp. 762-772.
11. [EV-88] T. Eilam-Tzoreff and U. Vishkin, "Matching Patterns in a String Subject to Multi-linear Transformations", Theoretical Computer Science, Vol. 60, 1988, pp. 231-254.
12. [FP-74] M. J. Fischer and M. S. Paterson, "String Matching and Other Products", Complexity of Computation, R. M. Karp (editor), SIAM-AMS Proceedings, Vol. 7, 1974, pp. 113-125.
13. [GBT-84] H. N. Gabow, J. L. Bentley and R. E. Tarjan, "Scaling and Related Techniques for Geometry Problems", Proc. 16th ACM Symposium on Theory of Computing, 1984, pp. 135-143.
14. [GP-89] Z. Galil and K. Park, "An Improved Algorithm for Approximate String Matching", Proc. 16th International Colloquium on Automata Languages and Programming, July 1989, pp. 394-404.
15. [GS-83] Z. Galil and J. I. Seiferas, "Time-Space-Optimal String Matching", Computer and System Sciences, Vol. 26, 1983, pp. 280-294.
16. [HT-84] D. Harel and R. E. Tarjan, "Fast Algorithms for Finding Nearest Common Ancestors", SIAM J. Comp., Vol. 13, 1984, pp. 338-355.
17. [KS-87] K. Krithivasan and R. Sitalakshmi, "Efficient Two Dimensional Pattern Matching in the Presence of Errors", Information Sciences, Vol. 43, 1987, pp. 169-184.
18. [KMP-77] D. E. Knuth, J. H. Morris and V. R. Pratt, "Fast Pattern Matching in Strings", SIAM J. Comp., Vol. 6, 1977, pp. 323-350.
19. [LV-89] G. M. Landau and U. Vishkin, "Fast parallel and serial approximate string matching", Journal of Algorithms, Vol. 10, No. 2, June 1989, pp. 157-169.
20. [Mc-76] E. M. McCreight, "A space-economical suffix tree construction algorithm", Journal of the ACM, 23, 1976, pp. 262-272.
21. [SV-88] B. Schieber and U. Vishkin, "On Finding Lowest Common Ancestors: Simplification and Parallelization", SIAM J. Comp., Vol. 17, 1988, pp. 1253-1262.
22. [U-85] E. Ukkonen, "Finding Approximate Pattern in Strings", J. of Algorithms, Vol. 6, 1985, pp. 132-137.
23. [V-85] U. Vishkin, "Optimal parallel pattern matching in strings", Information and Control, Vol. 67, 1985, pp. 91-113.
24. [V-89] U. Vishkin, "Deterministic sampling for fast pattern matching", TR-89-71, Inst, for Advanced Computer Studies, U. Maryland, July 1989.
25. [W-73] P. Weiner "Linear Pattern Matching Algorithm", Proc. 14 IEEE Symposium on Switching and Automata Theory, 1973, pp. 1-11.