專題演講 Keynote

cmct20220624_keynote1-hon.pdf
File Size: 9138 kb
File Type: pdf
下載檔案
Time：06/24 10:30
Chair：林耀鈴教授
​Speaker：Wing-Kai Hon​ 韓永楷
  •  Department of Computer Science, National Tsing-Hua University
Title：An Introduction of Burrows-Wheeler Transform (BWT) and Its Variants
Abstract：Burrows-Wheeler transform (BWT) was proposed in 1994 as a means to perform lossless compression on text strings. Soon after that, Ferragina and Manzini (FOCS'00; JACM'05) discovered the string matching power of BWT, and this result, together with independent work by Grossi and Vitter (STOC'00; SICOMP'07)  and by Sadakane (ISAAC'00; JALG'03), subsequently started the field of compressed text indexing.  Nowadays, BWT gains much popularity in bioinformatics areas, for a couple of famous applications such as BWA, Bowtie, and SOAP2, use BWT as the core in their design.
        In this talk, we will give an introduction of BWT and some of its variants, and show how they work, and how they can be used to derive interesting results, both in theory and in practice. 
​Expected audience: No background knowledge is required.
cmct20220625_keynote2-iwama.ppt
File Size: 2899 kb
File Type: ppt
下載檔案
Time：06/25 09:20
Chair：廖崇碩教授 (林春成教授)
Speaker：Kazuo Iwama 岩間一雄​​
  • Visiting Chair Professor, Dep. of Industrial Engineering and Engineering Management, National Tsing-Hua University
Title：Stable Matching: Why Interesting, Important and Fun?
Abstract：This talk looks at the stable matching problem from three different angles, namely why it is important (Nobel Prize winners produced), why it is interesting (e.g. compared to the conventional matching
problems) and why it has a lot of fun (e.g., a conjecture by Knuth was wrong).  The lecture includes its (long) history, basic notions and results and some extensions in the last 20 years. 
​Expected audience: all levels of TCS researchers including graduate students.

第 39 屆組合數學與計算理論研討會

地主辦單位：政治大學資訊學院資訊科學系、演算法與計算理論學會
協辦單位：科技部工程科技推展中心、中央研究院資訊科學研究所、中央研究院資訊科技創新研究中心 (CITI)
聯絡人：張家銘 chang.jiaming GMAIL