A Comparative Analysis of Pattern Matching Algorithm Using Bit-Parallelism Technique.

Pattern matching can be done with the help of bit-parallelism and character-based techniques. Bit-parallelism-based algorithms are currently the fastest and more efficient than other characterbased for both exact and inexact pattern matching. This is due to the use of intrinsic parallelism of the bit operation inside a computer word which allows you to cut down the number of operations that algorithm performs by a factor up to w, where w is the number of bits in the computer word. The paper presents a comparative analysis of well-known bit-parallel matching algorithms such as Shift-Or, Shift-And, Backward Non-Deterministic Matching (BNDM) and two variants of BNDM algorithm. The resulting experimental shift mechanism of BNDM, SBNDM and FSBNDM using bit-parallelism technique is also discussed. [ABSTRACT FROM AUTHOR]