Publications related to 'stable-child network' : A phylogenetic network is stable-child if each vertex (except the leaves) has at least one stable child v, that is there exists a leaf such that all paths from the root to this leaf go through vertex v.
Order by:   Type | Year
           related to:
Associated keywords
Andreas Gunawan and Louxin Zhang. Bounding the Size of a Network Defined By Visibility Property. 2015.
Keywords: bound, explicit network, galled network, nearly-stable network, phylogenetic network, phylogeny, reticulation-visible network, stable-child network.