Abstract
Molecular biologists rely very heavily on computer science algorithms as research tools. The process of finding the longest common subsequence of two DNA sequences has a wide range of applications in modern bioinformatics. Genetics databases can hold enormous amounts of raw data, for example the human genome consists of approximately three billion DNA base pairs. The processing of this gigantic volume of data necessitates the use of extremely efficient string algorithms. This paper introduces a space and time effective technique for retrieving the longest common subsequence of DNA sequences.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
