On improving the worst case running time of the Boyer-Moore string matching algorithm

This publication has 6 references indexed in Scilit:

• A fast string searching algorithm
  Communications of the ACM, 1977
• A new proof of the linearity of the Boyer-Moore string searching algorithm
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1977
• Fast Pattern Matching in Strings
  SIAM Journal on Computing, 1977
• A Space-Economical Suffix Tree Construction Algorithm
  Journal of the ACM, 1976
• Linear pattern matching algorithms
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1973
• The equation $a^M=b^Nc^P$ in a free group.
  The Michigan Mathematical Journal, 1962