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

Background: Tree reconciliation problems have long been studied inphylogenetics. A particular variant of the reconciliation problem for a genetree T and a species tree S assumes that for each interior vertex x of T it isknown whether x represents a speciation or a duplication. This problem appearsin the context of analyzing orthology data.  Results: We show that S is a species tree for T if and only if S displays allrooted triples of T that have three distinct species as their leaves and arerooted in a speciation vertex. A valid reconciliation map can then be found inpolynomial time. Simulated data shows that the event-labeled gene trees conveya large amount of information on underlying species trees, even for a largepercentage of losses.  Conclusions: The knowledge of event labels in a gene tree strongly constrainsthe possible species tree and, for a given species tree, also the possiblereconciliation maps. Nevertheless, many degrees of freedom remain in the spaceof feasible solutions. In order to disambiguate the alternative solutionsadditional external constraints as well as optimization criteria could beemployed.

From event labeled gene trees to species trees