Tighter upper bounds on the exact complexity of string matching

SIAM Journal on Computing

Volumn 26, Issue 3, 1997, Pages 803-856

  Cole, Richard ^a   Hariharan, Ramesh ^a,b  

^a NEW YORK UNIVERSITY   (United States)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Comparisons; Exact complexity; Periodicity; String matching

Indexed keywords

EID: 4043113631     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979324694X     Document Type: Article

References (23)

1. A. APOSTOLICO AND M. CROCHEMORE, Optimal canonization of all substrings of a string, Technical Report TR 89-75, Laboratoire Informatique, Théorique, et Programmation, Université Paris 7, Paris, 1989.
2. A. APOSTOLICO AND R. GIANCARLO, The Boyer-Moore-Galil string searching strategies revisited, SIAM J. Comput., 15 (1986), pp. 98-105.
3. R. BOYER AND S. MOORE, A fast string matching algorithm, Comm. Assoc. Comput. Mach., 20 (1977), pp. 762-772.
4. D. BRESLAUER, Saving comparisons in the Crochemore-Perrin string matching algorithm, Theoret. Comput. Sci., 158 (1996), pp. 177-192.
5. D. BRESLAUER, L. COLUSSI, AND L. TONIOLO, Tight comparison bounds for the string prefix-matching problem, Inform. Process. Lett., 47 (1993), pp. 51-57.
6. D. BRESLAUER AND Z. GALIL, Efficient comparison based string matching, J. Complexity, 9 (1993), pp. 339-365.
7. R. COLE, Tight Bounds on the complexity of the Boyer-Moore algorithm, SIAM J. Comput., 23 (1994), pp. 1075-1091.
8. R. COLE, R. HARIHARAN, M. PATERSON, AND U. ZWICK, Tighter lower bounds on the exact complexity of string matching, SIAM J. Comput., 24 (1995), pp. 30-45.
9. M. CROCHEMORE, A. CZUMAJ, L. GASINIEC, S. JAROMINEK, T. LECROQ, W. PLANDOWSKI, AND W. RYTTER, Speeding up two string-matching algorithms, Algorithmica, 5 (1994), pp. 247-267.
10. L. COLUSSI, Correctness and efficiency of pattern matching algorithms, Inform. and Comput., 5 (1991), pp. 225-251.
11. L. COLUSSI, Z. GALIL, AND R. GIANCARLO, On the exact complexity of string matching, in Proc. 31st Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 135-143.
12. M. CROCHEMORE AND D. PERRIN, Two-way pattern matching, Technical Report, Laboratoire Informatique, Théorique, et Programmation, Université Paris 7, Paris, 1989.
13. N. FINE AND H. WILF, Uniqueness theorem for periodic functions, Proc. Amer. Math. Soc., 16 (1965), pp. 109-114.
14. Z. GALIL AND R. GIANCARLO, On the exact complexity of string matching: Lower bounds, SIAM J. Comput., 6 (1991), pp. 1008-1020.
15. Z. GALIL AND R. GIANCARLO, On the exact complexity of string matching: Upper bounds, SIAM J. Comput., 3 (1993), pp. 407-437.
16. Z. GALIL AND J. SEIFERAS, Saving space in fast string-matching, SIAM J. Comput., 2 (1980), pp. 417-438.
17. L. J. GUIBAS AND A. M. ODLYZKO, A new proof of the linearity of the Boyer-Moore string searching algorithm, SIAM J. Comput., 9 (1980), pp. 672-682.
18. C. HANCART On Simon's string searching algorithm, Inform. Process. Lett., 47 (1993), pp. 95-99.
19. D. E. KNUTH, J. MORRIS, AND V. PRATT, Fast pattern matching in strings, SIAM J. Comput., 6 (1973), pp. 323-350.
20. M. LOTHAIRE, Combinatorics on Words, Encyclopaedia of Mathematics and Its Applications 17, Addison-Wesley, Reading, MA, 1982.
21. p is a free group, Michigan J. Math., 9 (1962), pp. 289-298.
22. U. VISHKIN, Optimal parallel pattern matching in strings, Inform. and Control, 67 (1985), pp. 91-113.
23. U. ZWICK AND M. PATERSON, Lower bounds for string matching in the sequential comparison model, manuscript, 1992.