PERFORMANCE EVALUATION OF DNA PATTERN MATCHING ALGORITHMS
DOI:
https://doi.org/10.57041/pjs.v74i3.785Keywords:
DNA, DNA pattern matching, DNA string matching, DNA pattern matching algorithm, time complexity, and space complexity.Abstract
Bioinformatics is a new area of research in which DNA, RNA and proteins
sequences are dealt. To store, retrieve, analyze, match, align, search, and process these sequences
different techniques are existed. Currently a lot of advancements in sequence analysis cause the drastic
increase in the DNA database sizes that require more efficient approaches encompass accuracy. Search
and analysis of DNA patterns can be performed by using various pattern matching algorithms in the
computational biology. The aim of present study is to present taxonomy and performance evaluation of
these pattern matching algorithms. The objective of this SLR is to set a research trend and to find a
mathematical model to estimate execution search time before scanning whole DNA sequence by
following a search strategy.
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 Pakistan Journal of Science
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
http://creativecommons.org/licenses/by-sa/4.0