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 approache...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Regional Association for Security and crisis management, Belgrade, Serbia
2023-04-01
|
Series: | Operational Research in Engineering Sciences: Theory and Applications |
Subjects: | |
Online Access: | https://oresta.org/menu-script/index.php/oresta/article/view/554 |
_version_ | 1797674462450024448 |
---|---|
author | Muhammad Yusuf Muhammad Mathias Fonkam Salu George Thandekatu Sandip Rakshit Rao Narasimha Vajjhala |
author_facet | Muhammad Yusuf Muhammad Mathias Fonkam Salu George Thandekatu Sandip Rakshit Rao Narasimha Vajjhala |
author_sort | Muhammad Yusuf Muhammad |
collection | DOAJ |
description |
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.
|
first_indexed | 2024-03-11T21:59:21Z |
format | Article |
id | doaj.art-2115a7cd782147cdaccd83f5b84ea37a |
institution | Directory Open Access Journal |
issn | 2620-1607 2620-1747 |
language | English |
last_indexed | 2024-03-11T21:59:21Z |
publishDate | 2023-04-01 |
publisher | Regional Association for Security and crisis management, Belgrade, Serbia |
record_format | Article |
series | Operational Research in Engineering Sciences: Theory and Applications |
spelling | doaj.art-2115a7cd782147cdaccd83f5b84ea37a2023-09-25T11:39:05ZengRegional Association for Security and crisis management, Belgrade, SerbiaOperational Research in Engineering Sciences: Theory and Applications2620-16072620-17472023-04-0161COMPARATIVE ANALYSIS OF BIT-PARALLEL STRING PATTERN MATCHING ALGORITHMS FOR BIOLOGICAL SEQUENCESMuhammad Yusuf Muhammad0Mathias Fonkam1Salu George Thandekatu2Sandip Rakshit3Rao Narasimha Vajjhala4American University of Nigeria, PMB 2250 Yola, Adamawa State, NigeriaAmerican University of Nigeria, PMB 2250 Yola, Adamawa State, NigeriaAmerican University of Nigeria, PMB 2250 Yola, Adamawa State, NigeriaAmerican University of Nigeria, PMB 2250 Yola, Adamawa State, NigeriaAmerican University of Nigeria, PMB 2250 Yola, Adamawa State, Nigeria 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. https://oresta.org/menu-script/index.php/oresta/article/view/554Bit-parallelismAutomatonPattern matchingRibonucleic acidParameterized matching |
spellingShingle | Muhammad Yusuf Muhammad Mathias Fonkam Salu George Thandekatu Sandip Rakshit Rao Narasimha Vajjhala COMPARATIVE ANALYSIS OF BIT-PARALLEL STRING PATTERN MATCHING ALGORITHMS FOR BIOLOGICAL SEQUENCES Operational Research in Engineering Sciences: Theory and Applications Bit-parallelism Automaton Pattern matching Ribonucleic acid Parameterized matching |
title | COMPARATIVE ANALYSIS OF BIT-PARALLEL STRING PATTERN MATCHING ALGORITHMS FOR BIOLOGICAL SEQUENCES |
title_full | COMPARATIVE ANALYSIS OF BIT-PARALLEL STRING PATTERN MATCHING ALGORITHMS FOR BIOLOGICAL SEQUENCES |
title_fullStr | COMPARATIVE ANALYSIS OF BIT-PARALLEL STRING PATTERN MATCHING ALGORITHMS FOR BIOLOGICAL SEQUENCES |
title_full_unstemmed | COMPARATIVE ANALYSIS OF BIT-PARALLEL STRING PATTERN MATCHING ALGORITHMS FOR BIOLOGICAL SEQUENCES |
title_short | COMPARATIVE ANALYSIS OF BIT-PARALLEL STRING PATTERN MATCHING ALGORITHMS FOR BIOLOGICAL SEQUENCES |
title_sort | comparative analysis of bit parallel string pattern matching algorithms for biological sequences |
topic | Bit-parallelism Automaton Pattern matching Ribonucleic acid Parameterized matching |
url | https://oresta.org/menu-script/index.php/oresta/article/view/554 |
work_keys_str_mv | AT muhammadyusufmuhammad comparativeanalysisofbitparallelstringpatternmatchingalgorithmsforbiologicalsequences AT mathiasfonkam comparativeanalysisofbitparallelstringpatternmatchingalgorithmsforbiologicalsequences AT salugeorgethandekatu comparativeanalysisofbitparallelstringpatternmatchingalgorithmsforbiologicalsequences AT sandiprakshit comparativeanalysisofbitparallelstringpatternmatchingalgorithmsforbiologicalsequences AT raonarasimhavajjhala comparativeanalysisofbitparallelstringpatternmatchingalgorithmsforbiologicalsequences |