101/11/23 (五) Two open computational problems related to phylogeny 主講人: Prof. Siu-Ming Yiu
國立清華大學
資訊工程學系
Department Of Computer Science
National Tsing Hua University
專題演講
SEMINAR
主 講 人:Prof. Siu-Ming Yiu
SPEAKER (University of Hong Kong)
題 目:Two open computational problems related to phylogeny
TOPIC
時 間:101年11月23日(五) 上午11:00-12:00
DATE
地 點:台達館632室
PLACE
敬請踴躍參加
Abstract:
In this talk, we introduce two computational problems related to phylogenetic tree and network.
The first is called "phylogenetic tree reconstruction with protein linkage". In this problem, each species is represented by a set of proteins. In most of the phylogenetic tree construction methods, we assume that the proteins are independent, but in reality, these proteins interact with one another and may rely on each other. We define a new phylogenetic tree reconstruction problem by taking the relationship of proteins into account. The second problem is related to a new classification of phylogenetic networks, called "k-articulated networks". We will talk about the motivation (mainly computational reasons) on why we want to define this new class of networks. We will also briefly talk about some preliminary results we obtained although we may not go into the details of the algorithms.
The emphasis of the talk will be on the unsolved problems.
