Final Presentation for Algorithms in Bioinformatics 2003
The information about each presentation team.
- 鄭智懷, 黃敬強, 胡書瑜
- Paper: A
segment alignment approach to protein comparison,
by Yuzhen Ye, Lukasz Jaroszewski, Weizhong Li and Adam
Godzik, Bioinformatics, 19(6):742-749, 2003.
- Time: 1pm, Monday, December 1, 2003.
- Place: Room 724, IIS, Sinica.
- Slides: ppt
- Picture: jpg
- 張耿豪, 王姵瑾, 吳亭範
- Paper: Sparse
LCS Common Substring Alignment, by Gad M. Landau,
Baruch Schieber, and Michal Ziv-Ukelson, in
Proceedings of the 14th Annual Symposium on
Combinatorial Pattern Matching (CPM03), Morelia,
Michoacan, Mexico, June 25-27, 2003, pages 225 - 236.
- Time: 10:20AM, Tuesday, December 23, 2003.
- Place: classroom.
- Slides: ppt
- 張嘉宏
- Paper: Tandem
Cyclic Alignment, by Gary Benson, in
Proceedings of the 12th Annual Symposium on
Combinatorial Pattern Matching (CPM 2001), LNCS
2089, pages 118-130, 2001.
- Time: 1:40PM, Thursday, December 25, 2003.
- Place: Room 724, IIS, Academia Sinica.
- Slides: ppt
- 湯凱富
- Paper: A Dynamic Programming Approach to De Novo
Peptide Sequencing via Tandem Mass Spectrometry, by Ting
Chen, Ming-Yang Kao, Matthew Tepel, John Rush, and George
M. Church, Journal of Computational Biology 8(3):
325-337 (2001). (ps)
- Time: 1:30PM, Tuesday, December 30, 2003.
- Place: Room 439, CSIE, NTU.
- Slides: ps
- 黃鼎翔, 田知本, 巨彥霖
- Paper: Analysis
of Tree Edit Distance Algorithms, by Serge Dulucq
and Helene Touzet, in
Proceedings of the 14th Annual Symposium on
Combinatorial Pattern Matching (CPM03), Morelia,
Michoacan, Mexico, June 25-27, 2003, pages 89-95.
- Time: 10AM, Wednesday, December 31, 2003.
- Place: Room 321, CSIE, NTU.
- Slides: ppt
- 高孟駿, 李庭諭
- 田文錦, 陳冠宇, 劉效飛
- Paper: Simple
linear work suffix array construction, by Juha
Karkkainen and Peter Sanders. In
Proceedings of the 30th International Colloquium on
Automata, Languages and Programming (ICALP '03). LNCS
2719, Springer, 2003, pp. 943-955.
- Time: 9:45AM, Monday, Jan 5, 2004.
- Place: Room 708, IIS, Academia Sinica.
- Slides: ppt
- 高偉鈞, 張嘉真, 林虹佑
- 張譽馨, 吳俐瑩
- Paper: Function
matching: algorithm, application, and a lower
bound, by Amihood Amir, Yonatan Aumann, Richard
Cole, Moshe Lewenstein, and Ely Porat. In
Proceedings of ICALP, pages 929-942, 2003.
- Time: 2pm, Wed, Jan 7, 2004.
- Place: Room 724, IIS, Academia Sinica.
- Slides: ppt
- 余宗恩, 何明彥, 李宜益
- Paper: Faster
algorithms for string matching with k mismatches, by
Amihood Amir, Moshe Lewenstein, and Ely Porat, Journal of
Algorithms, to appear, 2003/2004.
- Time: 10AM, Friday, Jan 9, 2004.
- Place: Room 724, IIS, Academia Sinica.
- Slides: ppt
- 林聖凱, 高海峰, 謝俊瑋
- Paper: The
Longest Common Subsequence Problem for Arc-Annotated
Sequences, by Tao Jiang, Guo-Hui Lin, Bin Ma, and
Kaizhong Zhang, in
Proceedings of the 11th Combinatorial Pattern
Matching, Montreal, Canada, June 21-23 2000, pages
154-165.
- Time: 2PM, Friday, Jan 9, 2004.
- Place: Room 724, IIS, Academia Sinica.
- Slides: ppt
- 蔡明潔, 黃寶萱, 李明翰
- Paper: Greedy
method for inferring tandem duplication history,
by Louxin Zhang, Bin Ma, Lusheng Wang and Ying Xu,
Bioinformatics, 19(12)1497-1504, 2003.
- Time: 2:30PM, Monday, Jan 12, 2004.
- Place: Room 724, IIS, Academia Sinica.
- Slides: ppt
- 蔡欣穆, 黃輔中
- 聶正邦, 張經略, 李沛倫
- Paper: Linear-time
construction of suffix arrays, by Dong Kyue Kim, Jeong
Seop Sim, Heejin Park, Kunsoo Park, in
Proceedings of the 14th Annual Symposium on
Combinatorial Pattern Matching (CPM03), Morelia,
Michoacan, Mexico, June 25-27, 2003, pages 186-199.
- Time: 4:00PM, Monday, Jan 19, 2004.
- Place: Room 724, IIS, Academia Sinica.
- Slides: zip of JPEGs
This set of webpages is maintained by Hsueh-I Lu
Number of accesses since August 11, 2001.
FastCounter by bCentral
