Prof. Frank Kwang-Ming Hwang 黃光明

(理論科學講座教授)
　

12月6日-12月22日，每星期二及星期四， 上午10:10-11:40 (每次90分鐘)
第一次上課時間為: 12月6日
　

國立交通大學應用數學系科學一館307研討室
　

由黃光明教授講授 Graph Searching and Its DNA Applications
共三週六次課程
　

1) Let the students know that graph theory is useful after they have learned some basic graph theory in the previous weeks.
2) Introduce the new topic “graph searching” in graph theory which can provide many research problems for students.
3) Introduce the important DNA applications of graph searching to familiarize the students with some combinatorial DNA problems.
　

• 課程內容:

1) The graph searching problem and pooling designs for the complex  model.
2) Disjunct matrices for the complex model.

3) Random and 2-stage pooling designs.
4) Sequential algorithms for graph searching.
5) The contig sequencing problem.
6) Quantitative models.
　

• 課程聯絡人: