By Topic

On the exact complexity of string matching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Colussi, L. ; Dipartimento di Matematica Pura & Appl., Padova Univ., Italy ; Galil, Zvi ; Giancarlo, Raffaele

The maximal number of character comparisons made by a linear-time string matching algorithm, given a text string of length n and a pattern string of length m over a general alphabet, is investigated. The number is denoted by c(n,m) or approximated by (1+C)n, where C is a universal constant. The subscript `online' is added when attention is restricted to online algorithms, and the superscript `1' is added when algorithms that find only one occurrence of the pattern in the text are considered. It is well known that nc(n, m)⩽2n-m+1 or 0⩽C⩽1. These bounds are improved, and Conline is determined exactly

Published in:

Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on

Date of Conference:

22-24 Oct 1990