On Alternative Models for Leaf Powers

05/26/2021
by   Benjamin Bergougnoux, et al.
0

A fundamental problem in computational biology is the construction of phylogenetic trees, also called evolutionary trees, for a set of organisms. A graph-theoretic approach takes as input a similarity graph G on the set of organisms, with adjacency denoting evolutionary closeness, and asks for a tree T whose leaves are the set of organisms, with two vertices adjacent in G if and only if the distance between them in the tree is less than some specified distance bound. If this exists G is called a leaf power. Over 20 years ago, [Nishimura et al., J. Algorithms, 2002] posed the question if leaf powers could be recognized in polynomial time. In this paper we explore this still unanswered question from the perspective of two alternative models of leaf powers that have been rather overlooked. These models do not rely on a variable distance bound and are therefore more apt for generalization. Our first result concerns leaf powers with a linear structure and uses a model where the edges of the tree T are weighted by rationals between 0 and 1, and the distance bound is fixed to 1. We show that the graphs having such a model with T a caterpillar are exactly the co-threshold tolerance graphs and can therefore be recognized in O(n^2) time by an algorithm of [Golovach et al., Discret. Appl. Math., 2017]. Our second result concerns leaf powers with a star structure and concerns the geometric NeS model used by [Brandstädt et al., Discret. Math., 2010]. We show that the graphs having a NeS model where the main embedding tree is a star can be recognized in polynomial time. These results pave the way for an attack on the main question, to settle the issue if leaf powers can be recognized in polynomial time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/28/2023

Algorithms for subgraph complementation to some classes of graphs

For a class 𝒢 of graphs, the objective of Subgraph Complementation to 𝒢 ...
research
04/11/2018

Subexponential-time Algorithms for Maximum Independent Set in P_t-free and Broom-free Graphs

In algorithmic graph theory, a classic open question is to determine the...
research
06/29/2022

Finding k-community structures in special graph classes

For a fixed integer k≥ 2, a k-community structure in an undirected graph...
research
08/21/2023

Computing Optimal Leaf Roots of Chordal Cographs in Linear Time

A graph G is a k-leaf power, for an integer k >= 2, if there is a tree T...
research
04/29/2021

Graph Similarity and Homomorphism Densities

We introduce the tree distance, a new distance measure on graphs. The tr...
research
10/28/2021

Recognizing k-leaf powers in polynomial time, for constant k

A graph G is a k-leaf power if there exists a tree T whose leaf set is V...
research
06/09/2023

Differentially Private All-Pairs Shortest Distances for Low Tree-Width Graphs

In this paper, we present a polynomial time algorithm for the problem of...

Please sign up or login with your details

Forgot password? Click here to reset