PhyloNetwork

swMATH28216MaRDI QIDQ39930FDOQ39930

Author name not available (Why is that?)

Cited In (25)

• Trinets encode tree-child and level-2 phylogenetic networks
• Deciding the existence of a cherry-picking sequence is hard on two trees
• Path lengths in tree-child time consistent hybridization networks
• Tree-based networks: characterisations, metrics, and support trees
• On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks
• Encoding and constructing 1-nested phylogenetic networks with trinets
• The mean value of the squared path-difference distance for rooted phylogenetic trees
• On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters
• Properties of normal phylogenetic networks
• On a matching distance between rooted phylogenetic trees
• Faster computation of the Robinson-Foulds distance between phylogenetic networks
• On encodings of phylogenetic networks of bounded level
• Defining phylogenetic networks using ancestral profiles
• Solving the tree containment problem in linear time for nearly stable phylogenetic networks
• Nodal distances for rooted phylogenetic trees
• Locating a tree in a phylogenetic network
• Folding and unfolding phylogenetic trees and networks
• A class of phylogenetic networks reconstructable from ancestral profiles
• The hybrid number of a ploidy profile
• Do branch lengths help to locate a tree in a phylogenetic network?
• Phylogenetic networks that display a tree twice
• The space of ultrametric phylogenetic trees
• Comparing and simplifying distinct-cluster phylogenetic networks
• A partial order and cluster-similarity metric on rooted phylogenetic trees
• Phylogenetic diversity and biodiversity indices on phylogenetic networks

This page was built for software: PhyloNetwork