Abstract
It is known that about 4n/3 comparisons are needed, in the worst case, to find all the occurrences of the string aba in a text of length n if only pattern-text comparisons are allowed. We show that if text-text comparisons can be used then only about 5n/4 comparisons are required. This gives the first example in which text-text comparisons provably help.
Supported in part by the ESPRIT Basic Research Action Programme of the EC under contract No. 7141 (project ALCOM II).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. Apostolico and M. Crochemore, Optimal canonization of all substrings of a string, Information and Computation, 95 (1991), pp. 76–95.
D. Breslauer and Z. Galil, Efficient comparison based string matching, Journal of Complexity, 9 (1993), pp. 339–365.
R. Boyer and S. Moore, A fast string matching algorithm, CACM, 20 (1977), pp. 762–772.
R. Cole, Tight bounds on the complexity of the Boyer-Moore algorithm, SIAM J. on Computing, 23 (1994), pp. 1075–1091.
L. Colussi, Correctness and efficiency of pattern matching algorithms, Information and Computation, 95 (1991), pp. 225–251.
R. Cole and R. Hariharan, Tighter upper bounds on the comparison complexity of string matching, in preparation. A preliminary version appeared in Proceedings of the 33rd Annual IEEE Symposium on the Foundations of Computer Science, (1992), pp. 600–609.
R. Cole, R. Hariharan, M. Paterson, U. Zwick, Tighter lower bounds on the exact complexity of string matching, SIAM J. on Computing, 24 (1995), pp. 30–45.
D. Dor and U. Zwick, Selecting the median, Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, (1995), pp. 28–37.
A. Ehrenfeucht and J. Mycielski, Positional strategies for mean payoff games, International Journal of Game Theory, 8 (1979), pp. 109–1139.
Z. Galil and R. Giancarlo, On the Exact Complexity of String Matching: Lower Bounds, SIAM J. on Computing, 6 (1991), pp. 1008–1020.
Z. Galil and R. Giancarlo, On the Exact Complexity of String Matching: Upper Bounds, SIAM J. on Computing, 3 (1992), pp. 407–437.
V. Gurvich, A. Karzanov, L. Khachiyan, Cyclic games and an algorithm to find minimax cycle means in directed graphs, USSR Computational Mathematics and Mathematical Physics, 28 (1988), pp. 85–91.
D.E. Knuth, J. Morris, V. Pratt, Fast pattern matching in strings, SIAM J. on Computing, 6 (1977), pp. 323–350.
A. Schönhage, M. Paterson, N. Pippenger, Finding the median, J. of Computer and System Sciences, 13 (1976), pp. 184–199.
U. Zwick and M. Paterson, The complexity of mean payoff games, Computing and Combinatorics (COCOON '95), LNCS 959 (Springer-Verlag 1995), pp. 1–10.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paterson, M., Tassa, S., Zwick, U. (1995). Looking for MUM and DAD: Text-text comparisons do help. In: Thiagarajan, P.S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1995. Lecture Notes in Computer Science, vol 1026. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60692-0_36
Download citation
DOI: https://doi.org/10.1007/3-540-60692-0_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60692-5
Online ISBN: 978-3-540-49263-4
eBook Packages: Springer Book Archive