నైరూప్య

STRING MATCHING RULES USED BY VARIANTS OF BOYER-MOORE ALGORITHM

Jamuna Bhandari, Anil Kumar

String matching problem is widely studied problem in computer science, mainly due to its large applications used in various fields. In this regards many string matching algorithms have been proposed. Boyer-Moore is most popular algorithm. Hence, maximum variants are proposed from Boyer-Moore (BM) algorithm. This paper addresses the variant of Boyer-Moore algorithm for finding the occurrences of a given pattern P within the text T.