Average case analysis of the Boyer-Moore algorithm

Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a random text. Previously, only special variants of this algorithm have been analyzed. We also propose means of computing the limiting constants for the mean and the variance.

• Type: Journal
• Year: 2006
• Where: RSA
• Authors: Tsung-Hsi Tsai
• Keywords: Boyer-Moore Algorithm, Random Text, RSA 2006, Special Variants