Network Classes and Their Mathematical Properties

发布时间：2024-05-31 作者：浏览次数：

Speaker:	张洛欣	DateTime:	2024年6月11日(周二）上午10:00-11:00
Brief Introduction to Speaker: 张洛欣教授在加拿大滑铁卢大学获计算机博士学位，现为新加坡国立大学数学系教授、博士生导师。主要研究方向为计算生物学、离散应用数学和理论计算机科学，在生物序列进化分析理论和算法方面发表上百篇论文，2005年获国家自然科学基金委B类杰出青年基金，1997年获新加坡李光耀博士后研究奖。		Place:	M323
Abstract: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 counting and enumeration of count tree-child networks and its subclasses.