IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites

Cart (Loading....) | Create Account | 

Close category search window
Author Searchbeta |  Advanced Search  |  Preferences |  Search Tips  |  More Search Options  
 
Browse Conference Publications > Foundations of Computer Scien ... Help

On the exact complexity of string matching

Full Text Sign-In or Purchase

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 n⩽c(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

Page(s):
135 - 144 vol.1
Meeting Date :
22 Oct 1990-24 Oct 1990
Print ISBN:
0-8186-2082-X
INSPEC Accession Number:
3908497
Conference Location :
St. Louis, MO
Digital Object Identifier :
10.1109/FSCS.1990.89532
Product Type:
Conference Publications

IEEE Account

Purchase Details

Profile Information

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.