New shift table algorithm for multiple variable length string pattern matching

Multiple string pattern matching is an approach to find all occurrences of a set of patterns in given text. Efficiency of searching technique lies in development of an accurate & precise shift table. In case of a mismatch between text and pattern, shift table determines maximum length of part of text which can be skipped without missing any pattern match. This paper extends Boyer Moore concept to cultivate a shift table algorithm which works on multiple variable length patterns and can cohesively be used with various searching techniques enhancing their speed. Run-time complexity of the presented algorithm is O(N) where N denotes sum of lengths of all variable length patterns.