By Topic

Optimal on-line search and sublinear time update in 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
$33 $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

2 Author(s)
P. Ferragina ; Dipartimento di Inf., Pisa Univ., Italy ; R. Grossi

We study in a dynamic setting the problem of online searching for the occurrences of an arbitrary pattern string P[1,p] in an indexed text string T[1,n]. That is, we assume that the text T may be updated by inserting or deleting an arbitrary string Y[1,y]. Our main contribution is presenting the first dynamic algorithm that achieves optimal time, i.e. Θ(p+occ), to find the occ occurrences of P, and sublinear time per update, i.e. O(√(n+y)), in the worst case. The required space is optimal Θ(n)

Published in:

Foundations of Computer Science, 1995. Proceedings., 36th Annual Symposium on

Date of Conference:

23-25 Oct 1995