Polynomial-time approximation algorithms for weighted LCS problem


We consider a variant of the well-known Longest Common Subsequence (LCS) problem for weighted sequences. A weighted sequence determines the probability for each symbol to occur at a given position of the sequence (such sequences are also called Position Weighted Matrices, PWM). Two possible such versions of the problem were proposed by (Amir et al., 2009 and 2010), they are called LCWS and LCWS2 (Longest Common Weighted Subsequence 1 and 2). We solve an open problem, stated in the paper by Amir et al., of the tractability of a log-probability version of LCWS2 problem for bounded alphabets, showing that it is NP-hard already for an alphabet of size 2. We also improve the $(1/|\Sigma|)$-approximation algorithm given by Amir et al. (where $\Sigma$ is the alphabet): we show a polynomial-time approximation scheme (PTAS) for the LCWS2 problem using $O(n^5)$ space. We also give a simpler (1/2)-approximation algorithm for the same problem using only $O(n^2)$ space.

Discrete Applied Mathematics 204:38-48 (2016)
Journal (see conference version)