English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

For a given set $\mathcal{L}$ of species and a set $\mathcal{T}$ of tripletson $\mathcal{L}$, one wants to construct a phylogenetic network which isconsistent with $\mathcal{T}$, i.e which represents all triplets of$\mathcal{T}$. The level of a network is defined as the maximum number ofhybrid vertices in its biconnected components. When $\mathcal{T}$ is dense,there exist polynomial time algorithms to construct level-$0,1,2$ networks (Ahoet al. 81, Jansson et al. 04, Iersel et al. 08). For higher levels, partialanswers were obtained by Iersel et al. 2008 with a polynomial time algorithmfor simple networks. In this paper, we detail the first complete answer for thegeneral case, solving a problem proposed by Jansson et al. 2004: for any $k$fixed, it is possible to construct a minimum level-$k$ network consistent with$\mathcal{T}$, if there is any, in time$O(|\mathcal{T}|^{k+1}n^{\lfloor\frac{4k}{3}\rfloor+1})$. This is an improvedresult of our preliminary version presented at CPM'2009.

Constructing a Minimum-Level Phylogenetic Network from a Dense Triplet Set in Polynomial Time