The parameterized complexity of sequence alignment and consensus
Theoretical Computer Science
On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences
SIAM Journal on Computing
On limited nondeterminism and the complexity of the V-C dimension
Journal of Computer and System Sciences
On fixed-parameter tractability and approximability of NP optimization problems
Journal of Computer and System Sciences - special issue on complexity theory
On the efficiency of polynomial time approximation schemes
Information Processing Letters
An integrated complexity analysis of problems from computational biology
An integrated complexity analysis of problems from computational biology
On the complexity of database queries
Journal of Computer and System Sciences
On the closest string and substring problems
Journal of the ACM (JACM)
Vertex cover: further observations and further improvements
Journal of Algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
Introduction to Algorithms
A PTAS for Distinguishing (Sub)string Selection
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Linear FPT reductions and computational lower bounds
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Parameterized complexity and polynomial-time approximation schemes
Parameterized complexity and polynomial-time approximation schemes
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
W-hardness under linear FPT-reductions: structural properties and further applications
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Parameterized Complexity
| Hi-index | 0.00 |
In this paper, different parameterized versions of the longest common subsequence (LCS) problem are extensively investigated and computational lower bound results are derived based on current research progress in parameterized computation. For example, with the number of sequences as the parameter k, the problem is unlikely to be solvable in time f(k)no(k), where n is the length of each sequence and f is any recursive function. The lower bound result is asymptotically tight in consideration of the dynamic programming approach of time O(nk). Computational lower bounds for polynomial-time approximation schemes (PTAS) for the LCS problem are also derived. It is shown that the LCS problem has no PTAS of time f(1/ ε)no(1/ ε) for any recursive function f, unless all SNP problems are solvable in subexponential time. Compared with former results on this problem, this result has its significance. Finally a parameterized approach for the LCS problem is discussed, which is more efficient than the dynamic programming approach, especially when applied to large scale sequences.