Academic Journals Database
Disseminating quality controlled scientific knowledge

Fast Dynamic Algorithm for Sequence Alignment Based On Bioinformatics

ADD TO MY LIST
 
Author(s): Sara A.Shehab | Arabi Keshk | Hany Mahgoub

Journal: International Journal of Computer Applications
ISSN 0975-8887

Volume: 37;
Issue: 7;
Start page: 54;
Date: 2012;
Original page

Keywords: computational biology | FDASA | Sequence | DNA | RNA | dynamic algorithms | Needleman-Wunsch | Smith-Waterman

ABSTRACT
Sequence alignment is widely used in Bioinformatics for Genome Sequence difference identification. It is the main problem of computational biology. Any sequence of Deoxyribonucleic acid (DNA), Ribonucleic acid (RNA), and protein can be alignment by many algorithms called bioinformatics algorithms. This paper presents a new implemented algorithm for sequence alignment based on concepts from bioinformatics algorithms .The implemented algorithm is called fast dynamic algorithm for sequence alignment (FDASA). This implemented algorithm based on making a matrix of M×N (M is the length of the first sequence, N is the length of the second sequence), After that filling the three main diagonal without filling the unused data and at the same time get the optimal solution; so that the execution time is decreased, the performance is high and the memory location decreased. The implementation introduced in this paper made a comparison between the dynamic algorithms Needleman-Wunsch algorithm, Smith-Waterman and our algorithm FDASA to test the execution time. The results show that our algorithm FDASA decreased the execution time when compared with Needleman-Wunsch and Smith-Waterman algorithms.
Why do you need a reservation system?      Save time & money - Smart Internet Solutions