Abstract
The goal of this paper is to perform DNA sequence alignment using the Longest Common Sub-sequence 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 computer 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: American Journal of Applied Mathematics and Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
