报告题目：Network Classes and Their Mathematical Properties

报告人：张洛欣(National University of Singapore)

报告时间：5月30日下午4:00-5:00

报告地点：5107

摘要：Phylogenetic networks over a set of taxa are rooted, directed acyclic graphs in which leaves represent the taxa, the non-leaf indegree-1 nodes represent speciation events and the nodes with multiple incoming edges represent reticulation events when they are used to model the evolutionary history of a set of genomes. In the study of algorithmic issues of phylogenetic networks, different classes of phylogenetic networks have been investigated. The popular network classes include galled network, tree-child network, tree-based network, etc. I will discuss our recent work on how to count tree-child networks and its subclasses.