Efficient Backward Non Deterministic Matching (EBNDM) Algorithm

Abstract-Bit parallel string matching algorithms are the latest and the efficient class of algorithm for string matching. It uses the intrinsic parallelism inside a computer word is known as bit parallelism. BNDM is the most popular bit parallel string matching algorithm. This algorithm can directly use for various real world problem like as Detection of Intrusion in the network, Data extraction and mine, avoiding Plagiarism, use of Bioinformatics in various medical field. BNDM algorithm having their standard implementation where lots of bit wise operations are checking as not in bit parallel mode like as MSB of bit vector is one or not or the value of the bit vector is zero or non-zero. All these operations are the comparison based operation which are quite time consuming. If these operations are optimized or simplified in bit parallelism based operations than they have their best bit parallelism based implementation. In this paper we are found out such operations and simplified in pure bit parallel based implementation. Here we simplified the popular algorithm BNDM and named as Efficient Backward Non Deterministic Matching (EBNDM) Algorithm. The working of Efficient Backward Non Deterministic Matching (EBNDM) Algorithm is same as classical one but due to use of bit wise operation in place of comparison operator our algorithm gives better result. Experimental results show that our EBNDM algorithm is better than the standard implementation