A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
The goal of this paper is to perform DNA sequence alignment using the Longest Common Subsequence Algorithm to obtain the longest common subsequence from the two strings X and Y for matching DNA in molecular biology etc. This paper would seek to establish the differences between the 2 species DNA and thereby conclude on their genetic similarity. The paper will be implemented in terms of space and time using the optimized longest common subsequence algorithm. This paper acts as a bridge betweendoi:10.15864/ajamc.131 fatcat:t5jcqluo7fh6dfzldcar6idmze