Inapproximability of Maximal Strip Recovery: II
From MaRDI portal
DOI10.1007/978-3-642-14553-7_8zbMath1288.68301arXiv0912.4935OpenAlexW3123386506MaRDI QIDQ3587336
Publication date: 7 September 2010
Published in: Algorithms and Computation, Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0912.4935
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10) Algorithms on strings (68W32)
Related Items (9)
On the parameterized complexity of some optimization problems related to multiple-interval graphs ⋮ Maximal strip recovery problem with gaps: hardness and approximation algorithms ⋮ Exact and approximation algorithms for the complementary maximal strip recovery problem ⋮ An improved approximation algorithm for the complementary maximal strip recovery problem ⋮ A linear kernel for the complementary maximal strip recovery problem ⋮ An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem ⋮ Tractability and Approximability of Maximal Strip Recovery ⋮ Inapproximability of maximal strip recovery ⋮ A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem
This page was built for publication: Inapproximability of Maximal Strip Recovery: II
