Page 169 - My FlipBook
P. 169
Research Fellow 高明達 研
究
Ming-Tat Ko 人
員
Ph.D., Computer Science, National Tsing-Hua University, Taiwan Faculty
T +886-2-27883799 ext. 1821 E mtko@iis.sinica.edu.tw
F +886-227824814 W www.iis.sinica.edu.tw/pages/mtko
・ Research Fellow, Institute of Information Science, Academia Sinica (2000-present)
・ Associate Research Fellow, Institute of Information Science, Academia Sinica (1988-
2000)
・ Ph.D., Computer Science, National Tsing-Hua University (1988)
・ M.S., Mathematics, National Taiwan University (1982)
・ B. S., Mathematics, National Taiwan University (1979)
Research Description
My research interest has been on the design and analysis of algorithms and graph theory with application to the real world problems. The
research topics include problems on computational geometry, optimization problems on graphs and algorithmic problems arisen from
bioinformatics. On computation geometry, geometric p-center problems for facility location, signal network design for VLSI layout are
studied. Theoretical optimization problems studied include Hamiltonian problems, domination problems, graph searching problems, secure
set problems, isometric path cover problems on various special graphs.
Algorithmic problems arisen from bioinformatics are focused on phylogeny construction and biological network analysis. On phylogeny
construction, we have studied the tree root problem and its generalization, the Steiner root problem that is to find a phylogenetic tree
such that its power contains the given graph as an induced subgraph. On the biological network analysis, we have studied the topological
characteristic of protein objects, such as essential proteins, protein functional modules, in protein-protein interaction networks of model
organisms and tried to render decent methods for predicting such protein objects. Recently, my interest shifts to computational linguistics
especially on Taiwanese.
1. Chih-En Kuo, Yue-Li Wang, Jia-Jie Liu, Ming-Tat Ko, Publications
"Resequencing a Set of Strings Based on a Target String,"
Algorithmica, Vol. 72, Issue 2, pp. 430-449, June 2015. 7. Han-Kuen Liang, Chia-Mao Huang, Ming-Tat Ko, Jenn-Kang
Hwang, "Amino acid-coupling patterns in thermophilic proteins,"
2. Maw-Shang Chang and Ming-Tat Ko and Hsueh-I Lu, "Linear Proteins: Structure, Function and Genetics, Vol.59, Issue 1, pp.
Time Algorithms for Tree Root Problems," Algorithmica, Vol. 71, 58-63, April, 2005.
Issue 2, pp. 471-495, Feb. 2015.
8. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu and Ming-
3. Chia-Hao Chin, Shu-Hwa Chen, Hsin-Hung Wu, Chin-Wen Tat Ko, "Characterization of Efficiently Solvable Problems
Ho, Ming-Tat Ko, Chung-Yen Lin, "cytoHubba: identifying on Distance-Hereditary Graphs," SIAM Journal on Discrete
hub objects and subnetworks from complex interactome," BMC Mathematics, Vol. 15, No. 4, pp. 488-518, 2002.
Systems Biology, Vol. 8, number S4, pages S11, December 2014.
9. Li-Fen Chen, Hong-Yuan Mark Liao, Ming-Tat Ko, Ja-Chen Lin
4. Yue-Li Wang, Cheng-Ju Hsu, Jia-Jie Liu, Ming-Tat Ko, Fu-Hsing and Gwo-Jong Yu, "A New LDA-based Face Recognition System
Wang, "The Composition Problem and Its Applications," IEEE Which Can Solve the Small Sample Size Problem," Pattern
Transactions on Computers, Vol. 61, No. 12, pp.1813-1822, Dec. Recognition, Vol. 33, pp. 1713-1726, 2000.
2012.
10. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko
5. Chia-Hao Chin, Chin-Wen Ho, Ming-Tat Ko and Chung-Yen Lin, and Gen-Huey Chen, "A Faster Implementation of Parallel Tree
"A hub-attachment based method to detect functional modules Contraction Scheme and Its Applications on Distance-Hereditary
from confidence-scored protein interactions and expression Graphs," Journal of Algorithms, Vol. 35, pp. 50-81, 2000.
profiles," BMC Bioinformatics , Vol. 11, No. S1, pages S25,
January 2010. Brochure 2020
6. Hsin-Hung Chou, Ming-Tat Ko, Chin-Wen Ho, and Gen-Huey
Chen, "Node- Searching Problem on Block Graphs," Discrete
Applied Mathematics, Vol. 156, No. 1, pp. 55-75, January 2008.
167
究
Ming-Tat Ko 人
員
Ph.D., Computer Science, National Tsing-Hua University, Taiwan Faculty
T +886-2-27883799 ext. 1821 E mtko@iis.sinica.edu.tw
F +886-227824814 W www.iis.sinica.edu.tw/pages/mtko
・ Research Fellow, Institute of Information Science, Academia Sinica (2000-present)
・ Associate Research Fellow, Institute of Information Science, Academia Sinica (1988-
2000)
・ Ph.D., Computer Science, National Tsing-Hua University (1988)
・ M.S., Mathematics, National Taiwan University (1982)
・ B. S., Mathematics, National Taiwan University (1979)
Research Description
My research interest has been on the design and analysis of algorithms and graph theory with application to the real world problems. The
research topics include problems on computational geometry, optimization problems on graphs and algorithmic problems arisen from
bioinformatics. On computation geometry, geometric p-center problems for facility location, signal network design for VLSI layout are
studied. Theoretical optimization problems studied include Hamiltonian problems, domination problems, graph searching problems, secure
set problems, isometric path cover problems on various special graphs.
Algorithmic problems arisen from bioinformatics are focused on phylogeny construction and biological network analysis. On phylogeny
construction, we have studied the tree root problem and its generalization, the Steiner root problem that is to find a phylogenetic tree
such that its power contains the given graph as an induced subgraph. On the biological network analysis, we have studied the topological
characteristic of protein objects, such as essential proteins, protein functional modules, in protein-protein interaction networks of model
organisms and tried to render decent methods for predicting such protein objects. Recently, my interest shifts to computational linguistics
especially on Taiwanese.
1. Chih-En Kuo, Yue-Li Wang, Jia-Jie Liu, Ming-Tat Ko, Publications
"Resequencing a Set of Strings Based on a Target String,"
Algorithmica, Vol. 72, Issue 2, pp. 430-449, June 2015. 7. Han-Kuen Liang, Chia-Mao Huang, Ming-Tat Ko, Jenn-Kang
Hwang, "Amino acid-coupling patterns in thermophilic proteins,"
2. Maw-Shang Chang and Ming-Tat Ko and Hsueh-I Lu, "Linear Proteins: Structure, Function and Genetics, Vol.59, Issue 1, pp.
Time Algorithms for Tree Root Problems," Algorithmica, Vol. 71, 58-63, April, 2005.
Issue 2, pp. 471-495, Feb. 2015.
8. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu and Ming-
3. Chia-Hao Chin, Shu-Hwa Chen, Hsin-Hung Wu, Chin-Wen Tat Ko, "Characterization of Efficiently Solvable Problems
Ho, Ming-Tat Ko, Chung-Yen Lin, "cytoHubba: identifying on Distance-Hereditary Graphs," SIAM Journal on Discrete
hub objects and subnetworks from complex interactome," BMC Mathematics, Vol. 15, No. 4, pp. 488-518, 2002.
Systems Biology, Vol. 8, number S4, pages S11, December 2014.
9. Li-Fen Chen, Hong-Yuan Mark Liao, Ming-Tat Ko, Ja-Chen Lin
4. Yue-Li Wang, Cheng-Ju Hsu, Jia-Jie Liu, Ming-Tat Ko, Fu-Hsing and Gwo-Jong Yu, "A New LDA-based Face Recognition System
Wang, "The Composition Problem and Its Applications," IEEE Which Can Solve the Small Sample Size Problem," Pattern
Transactions on Computers, Vol. 61, No. 12, pp.1813-1822, Dec. Recognition, Vol. 33, pp. 1713-1726, 2000.
2012.
10. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko
5. Chia-Hao Chin, Chin-Wen Ho, Ming-Tat Ko and Chung-Yen Lin, and Gen-Huey Chen, "A Faster Implementation of Parallel Tree
"A hub-attachment based method to detect functional modules Contraction Scheme and Its Applications on Distance-Hereditary
from confidence-scored protein interactions and expression Graphs," Journal of Algorithms, Vol. 35, pp. 50-81, 2000.
profiles," BMC Bioinformatics , Vol. 11, No. S1, pages S25,
January 2010. Brochure 2020
6. Hsin-Hung Chou, Ming-Tat Ko, Chin-Wen Ho, and Gen-Huey
Chen, "Node- Searching Problem on Block Graphs," Discrete
Applied Mathematics, Vol. 156, No. 1, pp. 55-75, January 2008.
167
