Published Online:December 2017
Product Name:The IUP Journal of Information Technology
Product Type:Article
Product Code:
Author Name:J A Oladunjoye, A O Afolabi, S O Olabiyisi and T Moses
Availability:YES
Subject/Domain:Engineering
Download Format:PDF
Pages:17
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 character- based 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. Keywords: Bit-parallelism, Computer word, Exact, Shift-Or, Shift-And, Backward Non- Deterministic Matching (BNDM)
Pattern matching can be defined as finding the occurrences of a particular pattern of characters in a large text or sequence.Its application covers a wide range of digital libraries, web search engines, screen scrapers, word processors, natural language processing, computational molecular biology and so on (Raju and Somayajulu, 2011).Pattern matching can be classified into two categories: exact and inexact pattern matching algorithms (Nimisha and Deepak, 2012).