← All problems

Distance split tree as the tree of blobs of an equivalent network

5 years old · traced to

Let NN be a metric semidirected network on taxon set XX, let dNd_N denote its average distances on XX, and let TT be the distance split tree reconstructed from dNd_N. Distance-split-tree conjecture. There exists a semidirected network N′N' of level at most that of NN such that

dN′=dNd_{N'}=d_N

and TT is the tree of blobs of N′N'. This would show that the distance split tree always represents the tree-of-blobs structure of a network with the same average distances and no greater level. The conjecture is motivated by examples and results for non-binary level-1 networks, but the source provides no resolution of the general claim.

References
  1. Jingcheng Xu and Cécile Ané, “Identifiability of local and global features of phylogenetic networks from average distances”, arXiv:2110.11814 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.