COMPARATIVE ANALYSIS OF BIT-PARALLEL STRING PATTERN MATCHING ALGORITHMS FOR BIOLOGICAL SEQUENCES

The inherent parallelism in a bit operation 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. The use of recently developed bit parallel string matching algorithms approaches...

Full description

Saved in:
Bibliographic Details
Published inOperational Research in Engineering Sciences: Theory and Applications Vol. 6; no. 1
Main Authors Muhammad Yusuf Muhammad, Mathias Fonkam, Salu George Thandekatu, Sandip Rakshit, Rao Narasimha Vajjhala
Format Journal Article
LanguageEnglish
Published Regional Association for Security and crisis management, Belgrade, Serbia 01.04.2023
Subjects
Automaton
Bit-parallelism
Parameterized matching
Pattern matching
Ribonucleic acid
Online AccessGet full text
ISSN2620-1607
2620-1747

Cover

More Information
Summary:The inherent parallelism in a bit operation 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. The use of recently developed bit parallel string matching algorithms approaches helps in improving the efficiency of the other string pattern matching algorithms. This paper discusses the working of some of these bit parallel string matching algorithms and their application on biological sequences. It also shows how bit-parallelism can be efficiently used to address various matching problems in Bioinformatics to analyze biological sequences such as Deoxyribonucleic acid (DNA), Ribonucleic acid (RNA), and Protein with examples. It can also serve as a greater tool for researchers when looking for the appropriate method to use on Biological sequences.
ISSN:2620-1607
2620-1747