1887

n South African Computer Journal - A Boyer-Moore-Horspool algorithm derivation : festschrift : dedicated to Derrick Kourie

Volume 2008, Issue 41
  • ISSN : 1015-7999
USD

 

Abstract

The keyword pattern matching problem has been frequently studied, and many different algorithms for solving it have been suggested. Watson and Zwaan in the early 1990s derived a set of well-known solutions from a common starting point, leading to a taxonomy of such algorithms. Their taxonomy allowed one to easily compare the different algorithms, and to easily implement them in a taxonomy-based toolkit. The taxonomy and toolkit did not include a variant of the Boyer-Moore algorithm developed by Horspool. In this paper, we present the Boyer-Moore-Horspool algorithm and its multiple keyword generalization in the context of the taxonomy.

Loading full text...

Full text loading...

Loading

Article metrics loading...

/content/comp/2008/41/EJC28065
2008-12-01
2017-07-28

This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error