An analysis on computation of longest common subsequence algorithm

There are many algorithms for computing the longest common subsequence, which are especially used in comparing files, text, comparison of DNA and protein sequences. In this paper we had done comparison among various algorithms which works on two or more strings. In our second approach we had done comparison of algorithms which is able to work on thousands of strings. As per the latest condition there are very few algorithm which works on multiple strings. The spotlight is on development of algorithm which is space efficient and reduced time complexity. In conclusion of the work we put the new proposals for the development of new algorithms for more strings.