" The Boyer-Moore string searching algorithm is a best choice for many problems in which a pattern of length m is to be matched in a text of length n, for small alphabets or long pattems. A recent ...