Year: 2012
Type: article
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.
DOI: 10.5120/4624-6636
Authors: Sara A.Shehab, Arabi Keshk, Hany Mahgoub
Institution: Menoufia University
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2157289521