Compatibility of Partitions, Hierarchies, and Split Systems

04/29/2021
βˆ™
by   Marc Hellmuth, et al.
βˆ™
0
βˆ™

The question whether a partition 𝒫 and a hierarchy β„‹ or a tree-like split system 𝔖 are compatible naturally arises in a wide range of classification problems. In the setting of phylogenetic trees, one asks whether the sets of 𝒫 coincide with leaf sets of connected components obtained by deleting some edges from the tree T that represents β„‹ or 𝔖, respectively. More generally, we ask whether a refinement T^* of T exists such that T^* and 𝒫 are compatible. We report several characterizations for (refinements of) hierarchies and split systems that are compatible with (sets of) partitions. In addition, we provide a linear-time algorithm to check whether refinements of trees and a given partition are compatible. The latter problem becomes NP-complete but fixed-parameter tractable if a set of partitions is considered instead of a single partition. We finally explore the close relationship of the concept of compatibility and so-called Fitch maps.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

βˆ™ 07/29/2021

Generalisations of Matrix Partitions : Complexity and Obstructions

A trigraph is a graph where each pair of vertices is labelled either 0 (...
βˆ™ 03/01/2020

An Algorithm for Consensus Trees

We consider the tree consensus problem, an important problem in bioinfor...
βˆ™ 02/28/2019

Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs

A connected component of a vertex-coloured graph is said to be colourful...
βˆ™ 04/08/2020

Training Neural Networks to Produce Compatible Features

This paper makes a first step towards compatible and hence reusable netw...
βˆ™ 12/01/2021

Orientation of Fitch Graphs and Detection of Horizontal Gene Transfer in Gene Trees

Horizontal gene transfer events partition a gene tree T and thus, its le...
βˆ™ 11/16/2018

A (4/3+Ξ΅)-Approximation Algorithm for Arboricity From Pseudoforest Partitions

The arboricity of a graph is the minimum number of forests it can be par...
βˆ™ 09/09/2016

Automatic Selection of Stochastic Watershed Hierarchies

The segmentation, seen as the association of a partition with an image, ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.