A New DNA sequencing alignment methodology using the Longest Common Subsequence technique

2020 American Journal of Applied Mathematics and Computing  
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 between
more » ... mputer science and genomics, exploring the interdisciplinary area of computational biology and helping us to consider the very fundamental concepts of life and our relationship with other species.
doi:10.15864/ajamc.131 fatcat:t5jcqluo7fh6dfzldcar6idmze