Presentation List for Algorithms in Bioinformatics
-
吳晉賢 郭錦福 羅習五 馬德文 陳培勳: (1/16 2002, 2pm, NTU)
Y.-L. Lin, T. Jiang, and K.-M. Chao, "Efficient algorithms for locating the length-constrained heaviest segments, with applications to biomolecular sequence analysis", manuscript 2001.
-
張耀霖 蔡其杭 莊涵宇 黃友正 陳博準
slides:
(1/18 2002, 2pm, NTU)
Ben-Dor, Karp, Schwikowski and Yakhini: "Universal
DNA Tag Systems: a combinatorial design scheme", Proceedings of
RECOMB 2000, pages 65-75.
- 陳智豪 王緯誠 王秀綾 江志民 侯藹玲
slides:
(1/21 2002, 3pm, Sinica, IIS Room 727 (7F))
C. M. Zmasek and S. R. Eddy, "A simple algorithm to infer gene
duplication and spciation events on a gene tree",
Bioinformatics, 17(9): 821--828, 2001.
- 劉秉涵 黃崇隆 黃玟憲 許英修 鍾金城:
slides:
(1/23 2002, 3pm, Sinica, IIS Room 724 (7F))
T. Kampke, M. Kieninger, and M. Mecklenburg, "Efficient primer design algorithms", Bioinformatics 17(3):214--225, 2001.
- 李建鴻 朱漢農 饒瑞佶 吳明龍:
slides:
(1/24 2002, 1pm, Sinica, IIS Room 106 (1F))
A Arslan, O Egecioglu, and P. Pevzner, "A new approach to sequence
comparison: normalized sequence alignment", Bioinformatics, 17(4):
327-337, 2001.
- 蔡秉穎 張貴雲 莊凱翔 張民杰 辛逸軒: (1/30 2002, 10:30am, Sinica)
M. Steel,
"Sufficient Conditions for Two Tree Reconstruction Techniques to Succeed on
Sufficiently Long Sequences", SIAM Journal on Discrete Math 14(1): 36--48,
2001.
- 洪俊竹 田曉珮 林柏亨 葉正聖 陳薇如: (1/30 2002, 2:30pm, Sinica, IIS Room 724 (7F))
S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, S. Arikawa, G. Mauri, and G. Pavesi, "On-line construction of compact directed acyclic word graphs", CPM 2001, 169--180.
- 蘇展弘 游騰楷 張文亮 呂育恩 葉恆青
slides:
(1/31 2002, 2pm, Sinica, IIS Room 724 (7F)
M. Crochemore, G. M. Landau, and M. Ziv-Ukelson, "A subquadratic sequence alignment algorithm for unrestricted cost matrices", SODA 2002, pp. 679--688.
This set of webpages is maintained by Hsueh-I Lu
Number of accesses since August 11, 2001.
FastCounter by bCentral