Reticulation-visible networks

Magnus Bordewich, Charles Semple

Let $X$ be a finite set, $\mathcal{N}$ be a reticulation-visible network on $X$, and $\mathcal{T}$ be a rooted binary phylogenetic tree. We show that there is a polynomial-time algor…