Erdős Péter L, van Iersel Leo, Jones Mark
Alfréd Rényi Institute of Mathematics, Reáltanoda u 13-15, Budapest, 1053, Hungary.
Delft Institute of Applied Mathematics, Delft University of Technology, Van Mourik Broekmanweg 6, 2628 XE, Delft, The Netherlands.
J Math Biol. 2019 Oct;79(5):1623-1638. doi: 10.1007/s00285-019-01405-9. Epub 2019 Jul 30.
Unrooted phylogenetic networks are graphs used to represent reticulate evolutionary relationships. Accurately reconstructing such networks is of great relevance for evolutionary biology. It has recently been conjectured that all unrooted phylogenetic networks for at least five taxa can be uniquely reconstructed from their subnetworks obtained by deleting a single taxon. Here, we show that this conjecture is false, by presenting a counter-example for each possible number of taxa that is at least 4. Moreover, we show that the conjecture is still false when restricted to binary networks. This means that, even if we are able to reconstruct the unrooted evolutionary history of each proper subset of some taxon set, this still does not give us enough information to reconstruct their full unrooted evolutionary history.
无根系统发育网络是用于表示网状进化关系的图。准确重建此类网络对进化生物学具有重要意义。最近有人推测,所有至少包含五个分类单元的无根系统发育网络都可以从通过删除单个分类单元获得的子网中唯一重建。在这里,我们通过为每个至少为4的可能分类单元数量提供反例,表明这个推测是错误的。此外,我们表明,当限制为二叉网络时,该推测仍然是错误的。这意味着,即使我们能够重建某个分类单元集的每个真子集的无根进化历史,这仍然没有给我们足够的信息来重建它们完整的无根进化历史。