Saving comparisons in the Crochemore-Perrin string-matching algorithm

Theoretical Computer Science

Volumn 158, Issue 1-2, 1996, Pages 177-192

  Breslauer, Dany ^a,b,c,d  

^a AALBORG UNIVERSITY   (Denmark)

^b CWI   (Netherlands)

^c INRIA   (France)

^d UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA PROCESSING;

PATTERN PREPROCESSING STEP; STRING MATCHING ALGORITHMS; SYMBOL COMPARISONS;

ALGORITHMS;

EID: 0030148338     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00068-2     Document Type: Article

References (30)

1. A.V. Aho, Algorithms for finding patterns in strings, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. A (Elsevier, Amsterdam, 1990) 257-300.
2. A. Apostolico and R. Giancarlo, The Boyer-Moore-Galil string searching strategies revisited, SIAM J. Comput. 15(1) (1986) 98-105.
3. A.B. Borodin, M.J. Fischer, D.G. Kirkpatrick, N.A. Lynch and M. Tompa, A time-space tradeoff for sorting on non-oblivious machines. in: Proc. 20th IEEE Symp. on Foundations of Computer Science (1979) 294-301.
4. R.S. Boyer and J.S. Moore, A fast string searching algorithm, Comm. ACM 20 (1977) 762-772.
5. D. Breslauer and Z. Galil, Efficient comparison based string matching, J. Complexity 9(3) (1993) 339-365.
6. Y. Césari and M. Vincent, Une caractérisation des mots périodiques, C. R. Acad. Sci. Paris 286(A) (1978) 1175-1177.
7. R. Cole, Tight bounds on the complexity of the Boyer-Moore string matching a algorithm, SIAM J. Comput. 23(5) (1994) 1075-1091.
8. R. Cole and R. Hariharan, Tighter bounds on the exact complexity of string matching, in: Proc. 33rd IEEE Symp. on Foundations of Computer Science (1992) 600-609.
9. R. Cole, R. Hariharan, M.S. Paterson and U. Zwick, Which patterns are hard to find. in: Proc. 2nd Israeli Symp. on Theory of Computing and Systems (1993) 59-68.
10. L. Colussi, Correctness and efficiency of string matching algorithms, Inform. and Control 95 (1992) 225-251.
11. L. Colussi, Fastest pattern matching in strings. J. Algorithms 16(2) (1994) 163-189.
12. M. Crochemore, String-matching on ordered alphabets, Theoret. Comput. Sci. 92 (1992) 33-47.
13. M. Crochemore, T. Lecroq, A. Czumaj, L. Gasieniec, S. Jarominek, W. Plandowski, and W. Rytter, Speeding up two string-matching algorithms, in: Proc. 9th Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 577 (Springer, Berlin, 1992) 589-600.
14. M. Crochemore and D. Perrin, Two-way string-matching, J. Assoc. Comput. Mach. 38(3) (1991) 651-675.
15. M. Crochemore and W. Rytter, Periodic prefixes in texts, in: R. Capocelli, A. De Santis and U. Vaccaro, ed., Proc. Sequences'91 Workshop: "Sequences II: Methods in Communication, Security and Computer Science" (Springer, Berlin, 1993) 153-165.
16. N.J. Fine and H.S. Wilf, Uniqueness theorems for periodic functions, Proc. Amer. Math. Soc. 16 (1965) 109-114.
17. Z. Galil and R. Giancarlo, On the exact complexity of string matching: lower bounds, SIAM J. Comput. 20(6) (1991) 1008-1020.
18. Z. Galil and R. Giancarlo, The exact complexity of string matching: upper bounds, SIAM J. Comput. 21(3) (1992) 407-437.
19. Z. Galil and J. Seiferas, Saving space in fast string-matching, SIAM J. Comput. 2 (1980) 417-438.
20. Z. Galil and J. Seiferas, Linear-time string-matching using only a fixed number of local storage locations, Theoret. Comput. Sci. (1981) 13 (1981) 331-336.
21. Z. Galil and J. Seiferas, Time-space-optimal string matching, J. Comput. System Sci. 26 (1983) 280-294.
22. M. Geréb-Graus and M. Li, Three one-way heads cannot do string-matching, Manuscript, 1990.
23. L.J. Guibas and A.M. Odlyzko, Periods in strings, J. Combin. Theory, Ser. A 30 (1981) 19-42.
24. T. Jiang and M. Li, k one-way heads cannot do string matching, in: Proc. 25th ACM Symp. on Theory of Computing (1993) 62-70.
25. D.E. Knuth, J.H. Morris and V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (1977) 322-350.
26. M. Li, Lower bounds on string-matching, Technical Report TR 84-63, Cornell University, Dept. of Computer Science, 1984.
27. M. Li and Y. Yesha, String-matching cannot be done by a two-head one-way deterministic finite automaton, Inform. Process. Lett. 22 (1986) 231-235.
28. M. Lothaire, Combinatorics on Words (Addison-Wesley, Reading, MA., 1983).
29. p in a free group, Michigan Math. J. 9 (1962) 289-298.
30. U. Zwick and M.S. Paterson, Lower bounds for string matching in the sequential comparison model, Manuscript, 1991.