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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Phylogenetic networks are increasingly used in evolutionary biology torepresent the history of species that have undergone reticulate events such ashorizontal gene transfer, hybrid speciation and recombination. One of the mostfundamental questions that arise in this context is whether the evolution of agene with one copy in all species can be explained by a given network. Inmathematical terms, this is often translated in the following way: is a givenphylogenetic tree contained in a given phylogenetic network? Recently this treecontainment problem has been widely investigated from a computationalperspective, but most studies have only focused on the topology of the phylo-genies, ignoring a piece of information that, in the case of phylogenetictrees, is routinely inferred by evolutionary analyses: branch lengths. Thesemeasure the amount of change (e.g., nucleotide substitutions) that has occurredalong each branch of the phylogeny. Here, we study a number of versions of thetree containment problem that explicitly account for branch lengths. We showthat, although length information has the potential to locate more precisely atree within a network, the problem is computationally hard in its most generalform. On a positive note, for a number of special cases of biologicalrelevance, we provide algorithms that solve this problem efficiently. Thisincludes the case of networks of limited complexity, for which it is possibleto recover, among the trees contained by the network with the same topology asthe input tree, the closest one in terms of branch lengths.

Do branch lengths help to locate a tree in a phylogenetic network?