Page 73 - 2017 Brochure
P. 73
究員
高明達 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, 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 essential proteins and protein functional modules, in protein-protein
interaction networks of model organisms and tried to render decent
My research interest is in the design and analysis of algorithms methods for predicting such protein objects. Recently, our interest
and graph theory with application to real world problems. Research has been extended to analysis and algorithmic issues emerging in
topics include problems on computational geometry, optimization social networks.
problems on graphs and algorithmic problems from bioinformatics.
With regard to computational geometry, we study geometric
p-center problems for facility location and signal network design
for VLSI layout. Theoretical optimization problems that we study
include Hamiltonian problems, domination problems, graph
searching problems, secure set problems, and isometric path cover
problems on various special graphs.
Our interests in algorithmic problems from bioinformatics are
focused on phylogeny construction and biological network analysis.
For phylogeny construction, we have studied the tree root problem
and its generalization, the Steiner root problem, which is to find a
phylogenetic tree such that its power contains the given graph as
an induced subgraph. On biological network analysis, we have
studied the topological characteristics of protein objects, such as
Publications 7. Han-Kuen Liang, Chia-Mao Huang, Ming-Tat Ko, Jenn-Kang Hwang,
“Amino acid-coupling patterns in thermophilic proteins,” Proteins:
1. Chih-En Kuo, Yue-Li Wang, Jia-Jie Liu, Ming-Tat Ko, “Resequencing Structure, Function and Genetics, Vol.59, Issue 1, pp. 58-63, April,
a Set of Strings Based on a Target String,” Algorithmica, Vol. 72, 2005.
Issue 2, pp. 430-449, June 2015.
8. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu and Ming-Tat
2. Maw-Shang Chang and Ming-Tat Ko and Hsueh-I Lu, “Linear Time Ko,“Characterization of Efficiently Solvable Problems on Distance-
Algorithms for Tree Root Problems,” Algorithmica, Vol. 71, Issue 2, Hereditary Graphs,” SIAM Journal on Discrete Mathematics, Vol. 15,
pp. 471-495, Feb. 2015. No. 4, pp. 488 - 518, 2002.
3. Chia-Hao Chin, Shu-Hwa Chen, Hsin-Hung Wu, Chin-Wen Ho, 9. Li-Fen Chen, Hong-Yuan Mark Liao, Ming-Tat Ko, Ja-Chen Lin and
Ming-Tat Ko, Chung-Yen Lin, “cytoHubba: identifying hub objects Gwo-Jong Yu, “A New LDA-based Face Recognition System Which
and subnetworks from complex interactome,” BMC Systems Biology, Can Solve the Small Sample Size Problem,” Pattern Recognition, Vol.
volume 8, number S4, pages S11, December 2014. 33, pp. 1713-1726, 2000.
4. Yue-Li Wang, Cheng-Ju Hsu, Jia-Jie Liu, Ming-Tat Ko, Fu-Hsing 10. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko
Wang, “The Composition Problem and Its Applications,” IEEE and Gen-Huey Chen, “A Faster Implementation of Parallel Tree
Transactions on Computers, Vol. 61, No. 12, pp.1813 -1822, Dec. Contraction Scheme and Its Applications on Distance-Hereditary
2012. Graphs,” Journal of Algorithms, Vol. 35, pp. 50-81, 2000.
5. Chia-Hao Chin, Chin-Wen Ho, Ming-Tat Ko and Chung-Yen Lin,
“A hub-attachment based method to detect functional modules from
confidence-scored protein interactions and expression profiles,” BMC
Bioinformatics, Vol. 11, No. S1, pages S25, January 2010.
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.
71
高明達 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, 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 essential proteins and protein functional modules, in protein-protein
interaction networks of model organisms and tried to render decent
My research interest is in the design and analysis of algorithms methods for predicting such protein objects. Recently, our interest
and graph theory with application to real world problems. Research has been extended to analysis and algorithmic issues emerging in
topics include problems on computational geometry, optimization social networks.
problems on graphs and algorithmic problems from bioinformatics.
With regard to computational geometry, we study geometric
p-center problems for facility location and signal network design
for VLSI layout. Theoretical optimization problems that we study
include Hamiltonian problems, domination problems, graph
searching problems, secure set problems, and isometric path cover
problems on various special graphs.
Our interests in algorithmic problems from bioinformatics are
focused on phylogeny construction and biological network analysis.
For phylogeny construction, we have studied the tree root problem
and its generalization, the Steiner root problem, which is to find a
phylogenetic tree such that its power contains the given graph as
an induced subgraph. On biological network analysis, we have
studied the topological characteristics of protein objects, such as
Publications 7. Han-Kuen Liang, Chia-Mao Huang, Ming-Tat Ko, Jenn-Kang Hwang,
“Amino acid-coupling patterns in thermophilic proteins,” Proteins:
1. Chih-En Kuo, Yue-Li Wang, Jia-Jie Liu, Ming-Tat Ko, “Resequencing Structure, Function and Genetics, Vol.59, Issue 1, pp. 58-63, April,
a Set of Strings Based on a Target String,” Algorithmica, Vol. 72, 2005.
Issue 2, pp. 430-449, June 2015.
8. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu and Ming-Tat
2. Maw-Shang Chang and Ming-Tat Ko and Hsueh-I Lu, “Linear Time Ko,“Characterization of Efficiently Solvable Problems on Distance-
Algorithms for Tree Root Problems,” Algorithmica, Vol. 71, Issue 2, Hereditary Graphs,” SIAM Journal on Discrete Mathematics, Vol. 15,
pp. 471-495, Feb. 2015. No. 4, pp. 488 - 518, 2002.
3. Chia-Hao Chin, Shu-Hwa Chen, Hsin-Hung Wu, Chin-Wen Ho, 9. Li-Fen Chen, Hong-Yuan Mark Liao, Ming-Tat Ko, Ja-Chen Lin and
Ming-Tat Ko, Chung-Yen Lin, “cytoHubba: identifying hub objects Gwo-Jong Yu, “A New LDA-based Face Recognition System Which
and subnetworks from complex interactome,” BMC Systems Biology, Can Solve the Small Sample Size Problem,” Pattern Recognition, Vol.
volume 8, number S4, pages S11, December 2014. 33, pp. 1713-1726, 2000.
4. Yue-Li Wang, Cheng-Ju Hsu, Jia-Jie Liu, Ming-Tat Ko, Fu-Hsing 10. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko
Wang, “The Composition Problem and Its Applications,” IEEE and Gen-Huey Chen, “A Faster Implementation of Parallel Tree
Transactions on Computers, Vol. 61, No. 12, pp.1813 -1822, Dec. Contraction Scheme and Its Applications on Distance-Hereditary
2012. Graphs,” Journal of Algorithms, Vol. 35, pp. 50-81, 2000.
5. Chia-Hao Chin, Chin-Wen Ho, Ming-Tat Ko and Chung-Yen Lin,
“A hub-attachment based method to detect functional modules from
confidence-scored protein interactions and expression profiles,” BMC
Bioinformatics, Vol. 11, No. S1, pages S25, January 2010.
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.
71
