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

In this paper, we provide a polynomial time algorithm to calculate theprobability of a {\it ranked} gene tree topology for a given species tree,where a ranked tree topology is a tree topology with the internal verticesbeing ordered. The probability of a gene tree topology can thus be calculatedin polynomial time if the number of orderings of the internal vertices is apolynomial number. However, the complexity of calculating the probability of agene tree topology with an exponential number of rankings for a given speciestree remains unknown.

A polynomial time algorithm for calculating the probability of a ranked gene tree given a species tree