Access Restriction

Author Galil, Zvi
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Worst case ♦ String matching ♦ Periodicity ♦ Linear time ♦ Computational complexity
Abstract It is shown how to modify the Boyer-Moore string matching algorithm so that its worst case running time is linear even when multiple occurrences of the pattern are present in the text.
Description Affiliation: Tel-Aviv Univ., Tel-Aviv, Israel (Galil, Zvi)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 22
Issue Number 9
Page Count 4
Starting Page 505
Ending Page 508

Open content in new tab

   Open content in new tab
Source: ACM Digital Library