An Efficient Technique for Finding Longest Common Subsequence of DNA Sequences

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.