Abstract:Phylogenetic networks allow modeling reticulate evolution, capturing events such as hybridization and horizontal gene transfer. A fundamental computational problem in this context is the Tree Containment problem, which asks whether a given phylogenetic network is compatible with a given phylogenetic tree. However, the classical statement of the problem is not robust to poorly supported branches in biological data, possibly leading to false negatives. In an effort to address this, a relaxed version that accounts for uncertainty, called Soft Tree Containment, has been introduced by Bentert, Malík, and Weller [SWAT'18]. We present an algorithm that solves Soft Tree Containment in $2^{O(\Delta_T \cdot k \cdot \log(k))} \cdot n^{O(1)}$ time, where $k = \operatorname{sw}(\Gamma) + \Delta_N$, with $\Delta_T$ and $\Delta_N$ denoting the maximum out-degrees in the tree and the network, respectively, and $\operatorname{sw}(\Gamma)$ denoting the "scanwidth" [Berry, Scornavacca, and Weller, SOFSEM'20] of a given tree extension of the network, while $n$ is the input size. Our approach leverages the fact that phylogenetic networks encountered in practice often exhibit low scanwidth, making the problem more tractable.
From: Sebastian Bruchhold [view email]
[v1]
Tue, 25 Nov 2025 19:07:20 UTC (26 KB)
[v2]
Thu, 12 Mar 2026 15:25:22 UTC (31 KB)
[v3]
Sun, 28 Jun 2026 18:22:24 UTC (37 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。