Abstract:

---

The inherent parallelism in a bit operations like AND/OR inside a computer word is known as Bit-parallelism. It plays a greater role in string pattern matching and has good application in the analysis of Biological data. However, benchmark pattern matching algorithms such as Shift-Or or Shift-And lacks the capabilities to be applicable in Biological sequences analysis due to the problem of false matches associated with them. To this end, many Bit-parallel matching algorithms were proposed in recent time to improve upon the performances of the benchmark algorithms and make them more applicable in the Biological sequence analysis. Therefore, this paper presented the working of some of the recently developed Bit-paralleled strings matching algorithms and their application on Biological sequences and also the analysis of their performances to aid Bioinformatics researchers choosing the appropriate algorithm to use.

Keyward(s): Bit-parallelism, Automaton, Pattern matching, Ribonucleic acid,Deoxyribonucleic acid.

Download