Computing Optimal Leaf Roots of Chordal Cographs in Linear Time
Van Bang Le, Christian Rosenke

TL;DR
This paper presents a linear-time algorithm for constructing optimal leaf roots of chordal cographs, advancing the understanding of minimal k-leaf powers with implications for phylogenetic tree reconstruction.
Contribution
It introduces a linear-time method for computing optimal leaf roots specifically for chordal cographs, addressing the complexity of finding minimal k-leaf powers.
Findings
Linear-time construction of optimal leaf roots for chordal cographs.
Highlights the significance of k's parity in optimal leaf roots.
Provides deeper insights into differences between even and odd k-leaf roots.
Abstract
A graph G is a k-leaf power, for an integer k >= 2, if there is a tree T with leaf set V(G) such that, for all vertices x, y in V(G), the edge xy exists in G if and only if the distance between x and y in T is at most k. Such a tree T is called a k-leaf root of G. The computational problem of constructing a k-leaf root for a given graph G and an integer k, if any, is motivated by the challenge from computational biology to reconstruct phylogenetic trees. For fixed k, Lafond [SODA 2022] recently solved this problem in polynomial time. In this paper, we propose to study optimal leaf roots of graphs G, that is, the k-leaf roots of G with minimum k value. Thus, all k'-leaf roots of G satisfy k <= k'. In terms of computational biology, seeking optimal leaf roots is more justified as they yield more probable phylogenetic trees. Lafond's result does not imply polynomial-time computability of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGenome Rearrangement Algorithms · Genomics and Phylogenetic Studies · Algorithms and Data Compression
