Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks

arXiv: Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks https://t.co/VpZHENN6Np

arXiv: Hypercubes and Hamiltonian Cycles of Display Sets of Rooted Phylogenetic Networks https://t.co/lprmEfkLxo

rooted binary phylogenetic trees can be embedded in a level-1 network without inferring any additional trees. Lastly, we show how these conditions translate into a polynomial-time algorithm to reconstruct such a network if it exists. [6/6 of https://t.co/o

in N, then G has a Hamiltonian cycle. Second, by exploiting rSPR graphs and properties of hypercubes, we turn to the well-studied class of rooted binary level-1 networks and give necessary and sufficient conditions for when a set of [5/6 of https://t.co/oS