演講公告

新聞標題：　( 2015-03-04 )

• 演講主題：Learning Hidden Graphs

• 主講人：傅恆霖 教授(交通大學 應用數學系)

• 演講日期：2015年3月10日(星期二) 下午2:00 –3:00

• 演講地點：(光復校區) 科學一館223室

• 茶會時間：當天下午1:30 (科學一館205室)

• 摘要內容：
  

  This talk is devoted to introducing a topic of group testing and its applications on computational molecular biology. The topic we study is complex group testing. Complex group testing has an equivalent formulation in graph theory: Given a graph (or a hypergraph) G = (V, E) where the vertices would represent the items and edges would represent the complexes, the main task is to identify all edges by edge detecting queries of the form “Q(S): does S induce at least one edge of G?” Here, S is a subset of V. For convenience, we let V = [n] = {1, 2, 3, …, n}. A query on a subset S of [n] can be represented by Q(S) = 1 means the outcome is yes and Q(s) = 0 otherwise.
  
  In has been studied by several authors where the size of each complex is restricted to be 2. It is less known where the size of complexes are of size larger than 2. In this talk, we shall first introduce the motivation of learning a hidden graph and then report our results on the case where the complexes are larger than 2. Mainly, adaptive algorithms of group testing are utilized in our works.

go back