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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Given a dense triplet set $\mathcal{T}$, there arise two interestingquestions: Does there exists any phylogenetic network consistent with$\mathcal{T}$? And if so, can we find an effective algorithm to construct one?For cases of networks of levels $k=0$ or 1 or 2, these questions were answeredwith effective polynomial algorithms. For higher levels $k$, partial answerswere recently obtained with an $O(|\mathcal{T}|^{k+1})$ time algorithm forsimple networks. In this paper we give a complete answer to the general case.The main idea is to use a special property of SN-sets in a level-k network. Asa consequence, we can also find the level-k network with the minimum number ofreticulations in polynomial time.

Level-k Phylogenetic Network can be Constructed from a Dense Triplet Set in Polynomial Time