eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2021-06-30
14:1
14:15
10.4230/LIPIcs.CPM.2021.14
article
The Longest Run Subsequence Problem: Further Complexity Results
Dondi, Riccardo
1
https://orcid.org/0000-0002-6124-2965
Sikora, Florian
2
https://orcid.org/0000-0003-2670-6258
Università degli Studi di Bergamo, Bergamo, Italy
Université Paris-Dauphine, PSL University, CNRS, LAMSADE, 75016 Paris, France
Longest Run Subsequence is a problem introduced recently in the context of the scaffolding phase of genome assembly (Schrinner et al., WABI 2020). The problem asks for a maximum length subsequence of a given string that contains at most one run for each symbol (a run is a maximum substring of consecutive identical symbols). The problem has been shown to be NP-hard and to be fixed-parameter tractable when the parameter is the size of the alphabet on which the input string is defined. In this paper we further investigate the complexity of the problem and we show that it is fixed-parameter tractable when it is parameterized by the number of runs in a solution, a smaller parameter. Moreover, we investigate the kernelization complexity of Longest Run Subsequence and we prove that it does not admit a polynomial kernel when parameterized by the size of the alphabet or by the number of runs. Finally, we consider the restriction of Longest Run Subsequence when each symbol has at most two occurrences in the input string and we show that it is APX-hard.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol191-cpm2021/LIPIcs.CPM.2021.14/LIPIcs.CPM.2021.14.pdf
Parameterized complexity
Kernelization
Approximation Hardness
Longest Subsequence