第 1 到 31 筆結果,共 31 筆。
公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 | |
---|---|---|---|---|---|---|---|
1 | 2009 | Optimal algorithms for the average-constrained maximum-sum segment problem | Cheng, C.-H.; Liu, H.-F.; KUN-MAO CHAO | Information Processing Letters | 3 | 3 | |
2 | 2009 | The backup 2-center and backup 2-median problems on trees | Wang, Hung-Lung; Wu, Bang Ye; Chao, Kun-Mao; KUN-MA0 CHAO | Networks | 10 | 10 | |
3 | 2008 | CNVDetector: Locating copy number variations using array CGH data | Chen, Peng-An; Liu, Hsiao-Fei; KUN-MAO CHAO | Bioinformatics | 11 | 10 | |
4 | 2008 | A new framework for the selection of tag SNPs by multimarker haplotypes | Huang, Yao-Ting; KUN-MAO CHAO | Journal of Biomedical Informatics | 5 | 6 | |
5 | 2008 | Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence | Liu, Hsiao-Fei; KUN-MAO CHAO | Theoretical Computer Science | 9 | 6 | |
6 | 2008 | The 2-radius and 2-radiian problems on trees | Wang, Hung-Lung; KUN-MAO CHAO | Theoretical Computer Science | 0 | ||
7 | 2007 | On the range maximum-sum segment query problem | Chen, K.-Y.; Chao, K.-M.; KUN-MA0 CHAO | Discrete Applied Mathematics | 14 | 11 | |
8 | 2007 | On the uniform edge-partition of a tree | Wu, Bang Ye; Wang, Hung-Lung; Ta Kuan, Shih; KUN-MAO CHAO | Discrete Applied Mathematics | 9 | ||
9 | 2007 | A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering | Liu, Hsiao-Fei; KUN-MAO CHAO | Theoretical Computer Science | 9 | 6 | |
10 | 2006 | On Locating Disjoint Segments with Maximum Sum of Densities | Hsiao-Fei Liu; KUN-MAO CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 0 | ||
11 | 2006 | Heaviest Segments in a Number Sequence | Chao, Kun-Mao; 趙坤茂 | ||||
12 | 2006 | Counting Spanning Trees | Chao, Kun-Mao; 趙坤茂 | ||||
13 | 2005 | A fast algorithm for computing a longest common increasing subsequence | Yang, I.-H.; Huang, C.-P.; KUN-MAO CHAO | Information Processing Letters | 43 | 35 | |
14 | 2005 | Selecting additional tag SNPs for tolerating missing data in genotyping | Huang, Yao-Ting; Zhang, Kui; Chen, Ting; KUN-MAO CHAO | BMC Bioinformatics | 18 | 17 | |
15 | 2005 | An approximation algorithm for haplotype inference by maximum parsimony | Huang, Y.-T.; KUN-MAO CHAO ; Chen, T. | Journal of Computational Biology | 33 | 32 | |
16 | 2005 | Finding a length-constrained maximum-density path in a tree | Lin, Rung-Ren; Kuo, Wen-Hsiung; KUN-MAO CHAO | Journal of Combinatorial Optimization | 11 | ||
17 | 2005 | Approximation algorithms for the optimization problems of SNPs and haplotypes | Huang, Yao-Ting; KUN-MAO CHAO | Emerging Information Technology Conference 2005 | 0 | 0 | |
18 | 2005 | Fast Local Alignment Methods | Chao, Kun-Mao; 趙坤茂 | ||||
19 | 2005 | Dynamic Programming | Chao, Kun-Mao; 趙坤茂 | ||||
20 | 2005 | Minimum Routing Cost Spanning Trees | Chao, Kun-Mao; 趙坤茂 | ||||
21 | 2004 | An optimal algorithm for querying tree structures and its applications in bioinformatics | Liu, Hsiao-Fei; Chang, Ya-Hui; KUN-MAO CHAO | SIGMOD Record | 1 | 0 | |
22 | 2004 | 比較相似度間間斷斷序列的動態規劃演算法(1/3) | 趙坤茂 | ||||
23 | 2003 | A generalized global alignment algorithm | Huang, X.; Chao, K.-M.; KUN-MA0 CHAO | Bioinformatics | 65 | 51 | |
24 | 2003 | MAVG: Locating non-overlaping maximum average segments in a given sequence | Lin, Y.-L.; Huang, X.; Jiang, T.; KUN-MAO CHAO | Bioinformatics | 32 | 29 | |
25 | 2003 | 多重基因組序列的快速排比方法(3/3) | 趙坤茂 | ||||
26 | 2002 | Efficient algorithms for locating the length-constrained heaviest segments, with applications to biomolecular sequence analysis | Lin, Yaw-Ling; Jiang, Tao; KUN-MAO CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 9 | ||
27 | 2002 | Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis | Lin, Yaw-Ling; Jiang, Tao; KUN-MAO CHAO | Journal of Computer and System Sciences | 69 | 58 | |
28 | 2002 | Dynamic-Programming Strategies for Analyzing Biomolecular Sequences | Chao, Kun-Mao; 趙坤茂 | ||||
29 | 2002 | Constrained multiple sequence alignment tool development and its application to RNase family alignment. | Tang, Chuan Yi; Lu, Chin Lung; Chang M.D.-T.; Tsai, Yin-Te; Sun, Yuh-Ju; KUN-MAO CHAO ; Chang, Jia-Ming; Chiou, Yu-Han; Wu, Chia-Mao; Chang, Hao-Teng; Chou, Wei-I. | Proceedings - IEEE Computer Society Bioinformatics Conference, CSB 2002 | 16 | 0 | |
30 | - | Sequence Alignment | Chao, Kun-Mao; 趙坤茂 | ||||
31 | - | Minimum Spanning Trees | Chao, Kun-Mao; 趙坤茂 |