A Survey on Longest Common Subsequence
Deena Nath · International Journal for Research in Applied Science and Engineering Technology · 2018
The main aim of this paper is to present a general observation of popular longest common subsequence algorithms and study their functions in multiple applications. There are algorithms which calculate only the length but not the actual LCS and others are which do determine the actual LCS, we need a clear distinction among them in order to determine the complexity since space and time complexity rely on it.Sequence matching is an approach to find a common subsequence among two or more sequences.The subsequence with the largest length is the LCS.This paper is a survey which briefly describes the successful attempts made to get the longest common subsequence of two strings.The comparisons of different algorithms are made and their performances are also analysed.