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

Genetic and comparative genomic studies indicate that extant genomes are moreproperly considered to be a fusion product of random mutations over generationsand genomic material transfers between individuals of different lineages. Thishas motivated researchers to adopt phylogenetic networks and other generalmodels to study genome evolution. One important problem arising fromreconstruction and verification of phylogenetic networks is the clustercontainment problem, namely determining whether or not a cluster of taxa isdisplayed in a phylogenetic network. In this work, a new upper bound for thisNP-complete problem is established through an efficient reduction to the SATproblem. Two efficient (albeit exponential time) methods are also implemented.It is developed on the basis of generalization of the so-calledreticulation-visible property of phylogenetic networks.

Fast Methods for Solving the Cluster Containment Problem for Phylogenetic Networks