Alphabet-Independent and Scaled Dictionary Matching

Journal of Algorithms

Volumn 36, Issue 1, 2000, Pages 34-62

  Amir, Amihood ^a,b   Cǎlinescu, Gruia ^c  

^a BAR ILAN UNIVERSITY   (Israel)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347937349     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1081     Document Type: Article

References (26)

1. A. V. Aho and M. J. Corasick, Efficient string matching, Comm. ACM 18, No. 6 (1975), 333-340.
2. A. Amir and G. Benson, Efficient two dimensional compressed matching, in "Proc. of Data Compression Conference, Snow Bird, Utah," pp. 279-288, March 1992.
3. A. Amir and G. Benson, Two-dimensional periodicity and its application, SIAM J. Comput. 27, No. 1 (1998), 90-106.
4. A. Amir, G. Benson, and M. Farach, "The Truth, the Whole Truth, and Nothing but the Truth: Alphabet Independent Two Dimensional Witness Table Construction," Technical Report GIT-CC-92/52, Georgia Institute of Technology, August 1992.
5. A. Amir, G. Benson, and M. Farach, Optimal parallel two dimensional pattern matching, in "Proc. of the 5th ACM Symp. on Parallel Algorithms and Architectures," pp. 79-85, 1993.
6. A. Amir, G. Benson, and M. Farach, An alphabet independent approach to two dimensional pattern matching, SIAM J. Comput. 23, No. 2 (1994), 313-323.
7. A. Amir, G. Benson, and M. Farach, Optimal two-dimensional compressed matching, J. Algorithms 24 (1997), 354-379.
8. A. Amir and M. Farach, Two dimensional dictionary matching, Inform. Process. Lett. 44 (1992), 233-239.
9. A. Amir, M. Farach, R. M. Idury, J. A. La Poutré, and A. A. Schäffer, Improved dynamic dictionary matching, Inform. Comput. 119 (1995), 258-282.
10. A. Amir, M. Farach, and Y. Matias, Efficient randomized dictionary matching algorithms, in "Proc. 3rd Combinatorial Pattern Matching Conference," pp. 259-272, Tucson, Arizona, 1992.
11. A. Amir, G. M. Landau, and U. Vishkin, Efficient pattern matching with scaling, J. Algorithms 13 (1992), 2-32.
12. A. Apostolico and Z. Galil (Eds.), "Pattern Matching Algorithms," Oxford Univ. Press, London, 1997.
13. R. Cole, M. Crochemore, Z. Galil, L. Ga̧sieniec, R. Harihan, S. Muthukrishnan, K. Park, and W. Rytter, Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions, in "Proc. 34th IEEE FOCS," pp. 248-258, 1993.
14. M. Crochemore and W. Rytter, "Text Algorithms," Oxford Univ. Press, London, 1994.
15. Larry S. Davis, personal communication, 1989.
16. T. Eilam-Tsoreff and U. Vishkin, Matching patterns in strings subject to multilinear transformations, Theoret. Comput. Sci. 60, No. 3 (1988), 231-254.
17. H. N. Gabow, J. L. Bentley, and R. E. Tarjan, Scaling and related techniques for geometry problems, in "Proc. 16th ACM Symposium on Theory of Computing," Vol. 67, pp. 135-143, 1984.
18. Z. Galil and K. Park, Alphabet-independent two-dimensional witness computation, SIAM J. Comput. 25, No. 5 (1996), 907-935.
19. R. Giancarlo and R. Grossi, On the construction of classes of suffix trees for square matrices: Algorithms and applications, Inform. Comput. 130 (1996), 151-182.
20. D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestor, Comput. System Sci. 13 (1984), 338-355.
21. R. M. Idury and A. A. Schäffer, Multiple matching of rectangular patterns, Inform. Comput. 117 (1995), 78-90.
22. D. E. Knuth, J. H. Morris, and V. R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (1977), 323-350.
23. E. M. McCreight, A space-economical suffix tree construction algorithm, J. Assoc. Comput. Mach. 23 (1976), 262-272.
24. A. Pentland, Invited talk, presented at NSF Institutional Infrastructure Workshop, 1992.
25. S. C. Sahinalp and U. Vishkin, Symmetry breaking for suffix tree construction, in "Proc. 26th STOC," pp. 300-309, 1994.
26. P. Weiner, Linear pattern matching algorithm, in "Proc. 14 IEEE Symposium on Switching and Automata Theory," pp. 1-11, 1973.