2020/11/30 by Allan Bai, Peter Erdos, Bai, Allan +5
Mathematics · #05C85 #92D15 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C85 #msc:92D15
paper · pdf · doi:10.48550/arxiv.2012.00109
18 pages, 4 figures. arXiv admin note: text overlap with arXiv:1901.04064
arxiv created 2020/11/30 · arxiv updated 2020/12/02
Rooted phylogenetic networks provide a more complete representation of the ancestral relationship between species than phylogenetic trees when reticulate evolutionary processes are at play. One way to reconstruct a phylogenetic network is to consider its `ancestral profile' (the number of paths from each ancestral vertex to each leaf). In general, this information does not uniquely determine the underlying phylogenetic network. A recent paper considered a new class of phylogenetic networks called `orchard networks' where this uniqueness was claimed to hold. Here we show that an additional restriction on the network, that of being `stack-free', is required in order for the original uniqueness claim to hold. On the other hand, if the additional stack-free restriction is lifted, we establish an alternative result; namely, there is uniqueness within the class of orchard networks up to the resolution of vertices of high in-degree.