On the Comparison Complexity of the String Prefix-Matching Problem

Journal of Algorithms

Volumn 29, Issue 1, 1998, Pages 18-67

  Breslauer, Dany ^a   Colussi, Livio ^b   Toniolo, Laura ^a,c  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF PADOVA   (Italy)

^c AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (38)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, "The Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, MA, 1974.
2. A. Amir, G. Benson, and M. Farach, An alphabet-independent approach to two-dimensional pattern-matching, SIAM J. Comput. 23 (1994), 313-323.
3. A. Apostolico and R. Giancarlo, The Boyer-Moore-Galil string searching strategies revisited, SIAM J. Comput. 15 (1986), 98-105.
4. R. S. Boyer and J. S. Moore, A fast string searching algorithm. Comm. Assoc. Comput. Mach. 20 (1977), 762-772.
5. D. Breslauer, Fast parallel string prefix-matching, Theoret. Comput. Sci. 137 (1995), 269-278.
6. D. Breslauer, Saving comparisons in the Crochemore-Perrin string matching algorithm, Theoret. Comput. Sci. 158 (1996), 177-192.
7. D. Breslauer, L. Colussi, and L. Toniolo, Tight comparison bounds for the string prefix-matching problem. Inform. Process. Lett. 47 (1993), 51-57.
8. D. Breslauer, L. Colussi, and L. Toniolo, On the exact complexity of the string prefix-matching problem, in "Proceedings of the 2nd European Symposium on Algorithms," Lecture Notes in Computer Science, Vol. 855, pp. 483-494, Springer-Verlag, Berlin, 1994.
9. D. Breslauer and Z. Galil, Efficient comparison based string matching, J. Complexity 9 (1993), 339-365.
10. R. Cole, Tight bounds on the complexity of the Boyer-Moore string matching algorithm, SIAM J. Comput. 23 (1994), 1075-1091.
11. R. Cole, M. Crochemore, Z. Galil, L. Ga̧sieniec, R. Hariharan, S. Muthukrishnan, K. Park, and W. Rytter, Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions, in "Proceedings of the 34th IEEE Symposium on Foundations of Computer Science," pp. 248-258, IEEE Press, New York, 1933.
12. R. Cole and R. Hariharan, Tighter bounds on the exact complexity of string matching, in "Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science," pp. 600-609, IEEE Press, New York, 1992.
13. R. Cole, R. Hariharan, M. Paterson, and U. Zwick, Tighter lower bounds on the exact complexity of string matching, SIAM J. Comput. 24 (1995), 30-45.
14. L. Colussi, Correctness and efficiency of string matching algorithms, Inform. Control 95 (1991), 225-251.
15. L. Colussi, Fastest pattern matching in strings, J. Algorithms, 16 (1994), 163-189.
16. M. Crochemore, "Off-Line Serial Exact String Searching," technical report 92.1, Institut Gaspard Monge, Universitë de Marne la Vallée, Marne la Vallée, France, 1992.
17. M. Crochemore, String-matching on ordered alphabets, Theoret. Comput. Sci. 92 (1992), 33-47.
18. M. Crochemore, L. Ga̧sieniec, and W. Rytter, "Turbo-BM," technical report 92.61, Laboratoire Informatique Théorique et Programmation, Université Paris 7, Paris, France, July 1992.
19. M. Crochemore, T. Lecroq, A. Czumaj, L. Ga̧sieniec, S. Jarominek, W. Plandowski, and W. Rytter, Speeding up two string-matching algorithms, in "Proceedings of the 9th Symposium on Theoretical Aspects of Computer Science," Lecture Notes in Computer Science, Vol. 577, pp. 589-600, Springer-Verlag, Berlin, 1992.
20. M. Crochemore and D. Perrin, Two-way string-matching. J. Assoc. Comput. Mach. 38 (1991), 651-675.
21. M. Crochemore and W. Rytter, Periodic prefixes in texts, in "Proceedings of the Sequences '91 Workshop: Sequences II: Methods in Communicaiton, Security and Computer Science," (R. Capocelli, A. De Santis, and U. Vaccaro, Eds.), pp. 153-165, Springer-Verlag, Berlin, 1993.
22. Z. Galil, Optimal parallel algorithms for string matching, Inform. Control 67 (1985), 144-157.
23. Z. Galil and R. Giancarlo, On the exact complexity of string matching: Lower bounds, SIAM J. Comput. 20 (1991), 1008-1020.
24. Z. Galil and R. Giancarlo, The exact complexity of string matching: Upper bounds, SIAM J. Comput. 21 (1992), 407-437.
25. Z. Galil and K. Park, Truly alphabet-independent two-dimensional pattern matching, in "Proceedings of the 33th IEEE Symposium on Foundations of Computer Science," pp. 247-256, IEEE Press, New York, 1992.
26. Z. Galil and J. Seiferas, Time-space-optimal string matching, J. Comput. System Sci. 26 (1983), 280-294.
27. L. Ga̧sieniec and K. Park, Work-time optimal parallel prefix matching, in "Proceedings of the 2nd European Symposium on Algorithms," Lecture Notes in Computer Science, Vol. 855, pp. 471-482, Springer-Verlag, Berlin, 1994.
28. L. Ga̧sieniec, W. Plandowski, and W. Rytter, Constant-space string matching with smaller number of comparisons: Sequential sampling, in "Proceedings of the 6th Symposium on Combinatorial Pattern Matching," Lecture Notes in Computer Science, Vol. 937, pp. 78-89, Springer-Verlag, Berlin, 1995.
29. L. J. Guibas and A. M. Odlyzko, A new proof of the linearity of the Boyer-Moore string matching algorithm, SIAM J. Comput. 9 (1980), 672-682.
30. C. Hancart, On Simon's string searching algorithm, Inform. Process. Lett., 47(2): 95-99 (1993).
31. R. Hariharan and S. Muthukrishnan, Optimal parallel algorithms for prefix matching, in "Proceedings of the 21th International Colloquium on Automata, Languages, and Programming," Lecture Notes in Computer Science, Vol. 820, pp. 203-214, Springer-Verlag, Berlin, 1994.
32. D. E. Knuth, J. H. Morris, and V. R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (1977), 322-350.
33. T. Lecroq, A variation on the Boyer-Moore algorithm, Theoret. Comput. Sci. 92 (1992), 119-144.
34. M. Lothaire, "Combinatorics on Words," Addison-Wesley, Reading, MA, 1983.
35. G. M. Main and R. J. Lorentz, An O(n log n) algorithm for finding all repetitions in a string, J. Algorithms 5 (1984), 422-432.
36. M. Paterson, S. Tassa, and U. Zwick, Looking for mum and dad, in "Proceedings of the 15th Conference on Foundation of Software Technology and Theoretical Computer Science," Bangalore, India, 1995, pp. 1-10.
37. R. V. Rivest, On the worst case behavior of string-searching algorithms, SIAM J. Comput. 6 (1977), 669-674.
38. U. Zwick and M. S. Paterson, Lower bounds for string matching in the sequential comparison model, manuscript.