We introduce the Longest Compatible Sequence (Slcs) problem. This problem deals with p-sequences, which are strings on a given alphabet where each letter occurs at most once. The Slcs problem takes as input a collection of k p-sequences on a common alphabet L of size n, and seeks a p-sequence on L which respects the precedence constraints induced by each input sequence, and is of maximal length with this property. We investigate the parameterized complexity and the approximability of the problem. As a by-product of our hardness results for Slcs, we derive new hardness results for the Longest Common Subsequence problem and other problems hard for the W-hierarchy. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Guillemot, S. (2008). Parameterized complexity and approximability of the SLCS problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5018 LNCS, pp. 115–128). https://doi.org/10.1007/978-3-540-79723-4_12
Mendeley helps you to discover research relevant for your work.