The edge-addition conjecture for rooted phylogenetic networks
Statement
Let be a rooted phylogenetic network on leaf set . The quantities and measure, respectively, the tree-based proximity of and the minimum number of directed edges that must be added to make tree-based. Edge-addition conjecture. There exists a set of directed edges that can be added to to turn it into a tree-based rooted phylogenetic network on leaf set . Furthermore,
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 does not extend to rooted networks, since there .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.