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

The Tree of Life is the graphical structure that represents the evolutionaryprocess from single-cell organisms at the origin of life to the vastbiodiversity we see today. Reconstructing this tree from genomic sequences ischallenging due to the variety of biological forces that shape the signal inthe data, and many of those processes like incomplete lineage sorting andhybridization can produce confounding information. Here, we present themathematical version of the identifiability proofs of phylogenetic networksunder the pseudolikelihood model in SNaQ. We establish that the ability todetect different hybridization events depends on the number of nodes on thehybridization blob, with small blobs (corresponding to closely related species)being the hardest to be detected. Our work focuses on level-1 networks, butraises attention to the importance of identifiability studies on phylogeneticinference methods for broader classes of networks.

On the Identifiability of Phylogenetic Networks under a Pseudolikelihood model