Bad Character Shift based String Matching Algorithm: Critical Review
Authors Name:
Anushka Dixit
, Rinki Singh
Author Reg. ID:
IJNRD_170187
Published Paper Id:
IJNRD1712009
Published In:
Volume 2 Issue 12, December-2017
Abstract:
Collection of genome sequences from different organisms and performing matching for finding similarity between them sets the requirement of pattern matching algorithms where one or more than one occurrences of pattern are found within a large body of text. Pattern matching algorithms can be exact, parameterized and approximate. In this paper, we will discuss about most efficient exact pattern matching algorithms. We are taking several algorithms present in the literature right from Horspool to TVSBS for performing comparison on them depending on the pattern size and text size. Algorithms are being analyzed by taking different patterns of different length. An algorithm with less number of character comparisons and less number of passes in proportion provides better result.
Keywords:
Character comparison, exact pattern matching, Horspool algorithm, TVSBS, Bad character shift
Cite Article:
"Bad Character Shift based String Matching Algorithm: Critical Review", International Journal of Novel Research and Development (www.ijnrd.org), ISSN:2456-4184, Vol.2, Issue 12, page no.41-45, December-2017, Available :http://www.ijnrd.org/papers/IJNRD1712009.pdf
Facebook Twitter Google+ Pinterest LinkedIn