Parameterized Computation of LCS for Two Sequences

- The problem of finding the longest common subsequence is a well-known optimization problem because of its applications, especially in bioinformatics. In this paper, by applying the techniques developed in parameterized computation, an efficient approach for the problem of finding the longest common subsequence of two sequences is presented. The parameterized approach is compared with the well-known dynamic programming approach for the problem. The parameterized approach is much more efficient, as is shown by the experimental results.

• Type: Conference
• Year: 2006
• Where: BIOCOMP
• Authors: Yuan Lin, Jeff Jenness, Xiuzhen Huang
• Keywords: BIOCOMP 2006, BIOCOMP 2007, Longest Common Subsequence, Parameterized Approach, Well-known Optimization Problem