Deposition and Extension Approach to Find Longest Common Subsequence for Multiple Sequences

Kang Ning

The problem of finding the longest common subsequence (LCS) for a set of sequences is a very interesting and challenging problem in computer science. This problem is NP-complete, b…