Slides of the talks

Louxin Zhang (National University of Singapore)

Combinatorial and Algorithmic Issues of Reticulation-Visible Phylogenetic Networks

A network is reticulation-visible if for every reticulation node, there exists a leaf such that every path from the network root to the leaf must contain the reticulation node. Recently, it has been shown that reticulation-visible networks have nice combinatorial properties. It has also been shown that the tree containment problem is polynomial time solvable on such networks. I this talk, I will discuss these results and the techniques used in the study of such networks.