Fast Longest Common Subsequences for Bioinformatics Dynamic Programming

Arabi E.Keshk, Mohammed Ossman, Lamiaa Fathi Hussein
2012 International Journal of Computer Applications  
Bioinformatics applications represent an increasingly important workload to improve the programs of sequence analysis. It can be used to assign function to genes and proteins by the study of the similarities between the compared sequences. This paper introduces a modified implementation of bioinformatics algorithm for sequence alignment .The implemented algorithm is called Fast Longest Common Subsequence (FLCS). It is filling the three main diagonals without filling the entire matrix by the
more » ... ed data. It gets the optimal solution but the execution time is decreased and the performance is high. To illustrate the effectiveness of optimizing the performance of the proposed FLCS algorithm and demonstrate its superiority, it is compared with Needleman-Wunsch, Smith-Waterman and Longest Common Subsequence algorithms. General Terms Bioinformatics.
doi:10.5120/9419-3569 fatcat:fmoathbdkbcljmv74rdojer6r4