Page 74 - profile2014.indd

研究員
高明達 Ming-Tat Ko

Research Fellow
Ph.D., Computer Science, National Tsing-Hua University
Tel: +886-2-2788-3799 ext. 1821 Fax: +886-2-2782-4814
Email: mtko@iis.sinica.edu.tw
http://www.iis.sinica.edu.tw/pages/mtko

● Research Fellow, IIS, Academia Research Description
Sinica (2000 - )
● Associate Research Fellow, IIS, My research interest is the design and analysis of algorithms and graph theory with appli-
Academia Sinica (1988-2000) cation to real world problems. Our research has been on geometric p-center problems for
● Ph.D., Computer Science, Na- facility location, signal network design for VLSI layout, and theoretical optimization prob-
tional Tsing-Hua University (1988) lems, such as Hamiltonian problems, domination problems, graph searching problems, and
secure set problems on various special graphs.
● M.S., Mathematics, National
Taiwan University (1982) Recently, my research interests have focused on the algorithmic problems arising from
● B. S., Mathematics, National bioinformatics, especially those related to phylogeny construction and biological network
Taiwan University (1979) analysis. As regards phylogeny construction, we have studied the tree root problem and its
generalization, the Steiner root problem (construction of a phylogenetic tree in such a way
that its power contains the given graph as an induced subgraph). On biological network
analysis, we have studied the topological characteristic of protein objects, such as essential proteins and protein functional modules, in
protein-protein interaction networks of model organisms, and tried to render suitable methods for predicting such protein objects. This
interest has been extended to analysis and algorithmic issues emerging in large-scale evolving networks, such as social networks and
communication networks.

Publications

1. Chih-En Kuo, Yue-Li Wang, Jia-Jie Liu, Ming-Tat Ko, “Rese- 7. Han-Kuen Liang, Chia-Mao Huang, Ming-Tat Ko, Jenn-Kang
quencing a Set of Strings Based on a Target String,” Algorith- Hwang, “Amino acid-coupling patterns in thermophilic pro-
mica, Dec. 2013. teins,” Proteins: Structure, Function and Genetics, Vol.59, Is-
sue 1, pp. 58-63, April, 2005.
2. Maw-Shang Chang and Ming-Tat Ko and Hsueh-I Lu, “Lin-
ear Time Algorithms for Tree Root Problems,” Algorithmica, 8. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu and Ming-
Aug. 2013. Tat Ko, “Characterization of Efficiently Solvable Problems

on Distance-Hereditary Graphs,” SIAM Journal on Discrete
3. Yue-Li Wang, Cheng-Ju Hsu, Jia-Jie Liu, Ming-Tat Ko, Fu- Mathematics, Vol. 15, No. 4, pp. 488 - 518, 2002.
Hsing Wang, “The Composition Problem and Its Applica-
tions,” IEEE Transactions on Computers, Vol. 61, No. 12, 9. Li-Fen Chen, Hong-Yuan Mark Liao, Ming-Tat Ko, Ja-Chen
pp.1813 -1822, Dec. 2012. Lin and Gwo-Jong Yu, “A New LDA-based Face Recognition
System Which Can Solve the Small Sample Size Problem,”
4. Chia-Hao Chin, Chin-Wen Ho, Ming-Tat Ko and Chung-Yen
Pattern Recognition, Vol. 33, pp. 1713-1726, 2000.
Lin, “A hub-attachment based method to detect functional

modules from confidence-scored protein interactions and 10. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat
expression profiles,” BMC Bioinformatics, Vol. 11, No. S1, Ko and Gen-Huey Chen, “A Faster Implementation of Parallel

pages S25, January 2010. Tree Contraction Scheme and Its Applications on Distance-
Hereditary Graphs,” Journal of Algorithms, Vol. 35, pp. 50-81,
5. Lin, C. Y.*, Chin, C. H., Wu, H. H., Chen, S. H., Ho, C. W.,* 2000.
Ko, M. T.*, “Hubba: Hub Objects Analyzer : A Framework of

Interactome Hubs Identification for Network Biology,” Nucle-
ic Acids Research, Vol. 36, No. 2008 Web application Issue,
pp. W438-W443, July 2008.
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.

74 研究人員 Research Faculty