ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let NN be a rooted phylogenetic network on leaf set XX. The quantities ℓ(N)\ell(N) and e(N)e(N) measure, respectively, the tree-based proximity of NN and the minimum number of directed edges that must be added to make NN tree-based. Edge-addition conjecture. There exists a set of directed edges that can be added to NN to turn it into a tree-based rooted phylogenetic network on leaf set XX. Furthermore,

ℓ(N)≤e(N)≤2ℓ(N).\ell(N)\le e(N)\le 2\ell(N).

The conjecture asserts both that every rooted phylogenetic network can be made tree-based by adding directed edges and that the required number of additions is at most twice its tree-based proximity. The preceding example shows that the unrooted equality e(N)=ℓ(N)e(N)=\ell(N) does not extend to rooted networks, since there e(N)=2>1=ℓ(N)e(N)=2>1=\ell(N).

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.