An Enhanced Version of Pattern Matching Algorithm using Bitwise XOR Operation
K. P. Ambika, UGGINA RAMESH, K. Saravanan, J. Hencil Peter · International Journal of Computer Applications · 2013
In this study, a new algorithm for the traditional pattern matching problem has been proposed.This algorithm is a modified version of KMP algorithm and using bitwise XOR operation to process two characters (or bytes) in parallel, to speed up the pattern matching process.An additional loop to avoid the undesirable comparison(s) also been introduced and let the algorithm to initiate, and continue only the essential comparisons from the required location.As the new algorithm uses the principle of Finite automata which is used by KMP algorithm and Bitwise XOR operation to speed up the character match, it shows some reasonable performance improvement.Also this new algorithm is easy to implement as it doesn't require any additional/complex data structure(s) and suitable for DNA sequence search.