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

It has recently been shown that the NP-hard problem of calculating theminimum number of hybridization events that is needed to explain a set ofrooted binary phylogenetic trees by means of a hybridization network isfixed-parameter tractable if an instance of the problem consists of preciselytwo such trees. In this paper, we show that this problem remainsfixed-parameter tractable for an arbitrarily large set of rooted binaryphylogenetic trees. In particular, we present a quadratic kernel.

A quadratic kernel for computing the hybridization number of multiple trees