No Detail Found!

Performance evaluation of DNA pattern matching algorithms

Author(s)
I. Aziz Department of Computer Science University of Engineering and Technology Lahore, Pakistan
S. Shoaib Department of Computer Science University of Engineering and Technology Lahore,,Pakistan
K. S. Khurshid Department of Computer Science University of Engineering and Technology Lahore,,Pakistan
T. Ahmad Department of Computer Science University of Engineering and Technology Lahore,,Pakistan
M. Awais Department of Computer Science University of Engineering and Technology Lahore,,Pakistan
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.
Publication Details
Page(s) 169-175
DOI DOI not available
Published Journal: Pakistan Journal of Science, Volume: 74, Issue: 3, Year: 2022

Request the full text from PASTIC

Keywords
Time Complexity, DNA string matching, and space complexity, DNA pattern matching, DNA pattern matching algorithm
0

Citations

0

Downloads

24

Views