A Simple Fast Hybrid Pattern-Matching Algorithm

Abstract. The Knuth-Morris-Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the other hand, the Boyer-Moore (BM) algorithm provides near-optimal average-case and best-case behaviour, as well as executing very fast in practice. We describe a simple algorithm that employs the main ideas of KMP and BM (with a little help from Sunday) in an effort to combine these desirable features. Experiments indicate that in practice the new algorithm is among the fastest exact pattern-matching algorithms discovered to date, apparently dominant for alphabet size above 15–20. Key words. string, word, pattern-matching, algorithm AMS subject classifications. 68U15, 68R15

• Type: Conference
• Year: 2005
• Where: CPM
• Authors: Frantisek Franek, Christopher G. Jennings, William F. Smyth
• Keywords: Alphabet Size, CPM 2005, Pattern-matching Algorithm Guarantees, Pattern-matching Algorithms