𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the generalized constrained longest common subsequence problems

✍ Scribed by Yi-Ching Chen; Kun-Mao Chao

Publisher
Springer US
Year
2009
Tongue
English
Weight
443 KB
Volume
21
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the parameterized complexity of the f
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
✍ Krzysztof Pietrzak πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 205 KB

We show that the fixed alphabet shortest common supersequence (SCS) and the fixed alphabet longest common subsequence (LCS) problems parameterized in the number of strings are W ½1-hard. Unless W ½1 ¼ FPT; this rules out the existence of algorithms with time complexity of Oð f ðkÞn a Þ for those pro