Fast Longest Common Subsequences for Bioinformatics Dynamic Programming

  title={Fast Longest Common Subsequences for Bioinformatics Dynamic Programming},
  author={Arabi E. Keshk and M. E. Ossman},
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… CONTINUE READING


Publications citing this paper.
Showing 1-3 of 3 extracted citations

Parallel Longest Common Sequence Algorithm on Multicore Systems Using OpenACC, OpenMP and OpenMPI

2017 IEEE 11th International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC) • 2017
View 4 Excerpts
Highly Influenced

Longest Common Subsequence using Chemical Reaction Optimization

2015 2nd International Conference on Electrical Information and Communication Technologies (EICT) • 2015


Publications referenced by this paper.
Showing 1-10 of 13 references

Implementation of a dynamic programming algorithm for DNA sequences alignment on the cell Matrix Architecture (online), Utah State University, Logan, Utah

Bin Wang • 2002
View 4 Excerpts
Highly Influenced

Papamichail2,"Improved algorithms for approximate string matching (extended abstract)"BMC

Dimitris Papamichail, Georgios
Bioinformatics • 2009
View 1 Excerpt

BLAST Sequences Aid in Genomics and Proteomics

R. M. Casey
Business Intelligence Network . • 2005
View 1 Excerpt

Parallel NeedlemanWunsch Algorithm for Grid ” , Proceedings of the PAKUS International Symposium on High Capacity Optical Networks and Enabling Technologies

Tahir Naveed, Imitaz Siddiqui, Shaftab Ahmed

Similar Papers

Loading similar papers…