On the parameterized complexity of the Perfect Phylogeny problem

05/04/2023
by   Jorke M. de Vlas, et al.
0

This paper categorizes the parameterized complexity of the algorithmic problems Perfect Phylogeny and Triangulating Colored Graphs. We show that they are complete for the parameterized complexity class XALP using a reduction from Tree-chained Multicolor Independent Set and a proof of membership. We introduce the problem Triangulating Multicolored Graphs as a stepping stone and prove XALP-completeness for this problem as well. We also show that, assuming the Exponential Time Hypothesis, there exists no algorithm that solves any of these problems in time f(k) n^o(k), where n is the input size, k the parameter, and f any computable function.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2019

Metric Dimension Parameterized by Treewidth

A resolving set S of a graph G is a subset of its vertices such that no ...
research
01/31/2022

XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure

In this paper, we show several parameterized problems to be complete for...
research
11/05/2018

Probabilistic Parameterized Polynomial Time

We examine a parameterized complexity class for randomized computation w...
research
07/29/2019

Parameterized Valiant's Classes

We define a theory of parameterized algebraic complexity classes in anal...
research
06/14/2022

Parameterized Complexity Results for Bayesian Inference

We present completeness results for inference in Bayesian networks with ...
research
07/18/2019

Imperfect Gaps in Gap-ETH and PCPs

We study the role of perfect completeness in probabilistically checkable...
research
03/01/2019

Parameterized Distributed Complexity Theory: A logical approach

Parameterized complexity theory offers a framework for a refined analysi...

Please sign up or login with your details

Forgot password? Click here to reset