2009 | ||
---|---|---|
63 | EE | Chih-Huai Cheng, Hsiao-Fei Liu, Kun-Mao Chao: Optimal algorithms for the average-constrained maximum-sum segment problem. Inf. Process. Lett. 109(3): 171-174 (2009) |
62 | EE | Hung-Lung Wang, Bang Ye Wu, Kun-Mao Chao: The backup 2-center and backup 2-median problems on trees. Networks 53(1): 39-49 (2009) |
2008 | ||
61 | EE | Chia-Ying Yang, Chao-Hui Chang, Ya-Ling Yu, Tsu-Chun Emma Lin, Sheng-An Lee, Chueh-Chuan Yen, Jinn-Moon Yang, Jin-Mei Lai, Yi-Ren Hong, Tzu-Ling Tseng, Kun-Mao Chao, Chi-Ying F. Huang: PhosphoPOINT: a comprehensive human kinase interactome and phospho-protein database. ECCB 2008: 14-20 |
60 | EE | Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao: Minkowski Sum Selection and Finding. ISAAC 2008: 460-471 |
59 | EE | Kun-Mao Chao: Maximum-Density Segment. Encyclopedia of Algorithms 2008 |
58 | EE | Kun-Mao Chao: Maximum-scoring Segment with Length Restrictions. Encyclopedia of Algorithms 2008 |
57 | EE | Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao: The Swap Edges of a Multiple-Sources Routing Tree. Algorithmica 50(3): 299-311 (2008) |
56 | EE | Hsiao-Fei Liu, Kun-Mao Chao: An Õ(n2.5)-Time Algorithm for Online Topological Ordering CoRR abs/0804.3860: (2008) |
55 | EE | Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao: Minkowski Sum Selection and Finding CoRR abs/0809.1171: (2008) |
54 | EE | Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao: Algorithms for Locating Constrained Optimal Intervals CoRR abs/0809.2097: (2008) |
53 | EE | Yao-Ting Huang, Kun-Mao Chao: A new framework for the selection of tag SNPs by multimarker haplotypes. Journal of Biomedical Informatics 41(6): 953-961 (2008) |
52 | EE | Hsiao-Fei Liu, Kun-Mao Chao: Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence. Theor. Comput. Sci. 407(1-3): 349-358 (2008) |
51 | EE | Hung-Lung Wang, Kun-Mao Chao: The 2-radius and 2-radiian problems on trees. Theor. Comput. Sci. 407(1-3): 524-531 (2008) |
2007 | ||
50 | EE | Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao: Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis. ISAAC 2007: 834-845 |
49 | EE | Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao Chao: On the uniform edge-partition of a tree. Discrete Applied Mathematics 155(10): 1213-1223 (2007) |
48 | EE | Kuan-Yu Chen, Kun-Mao Chao: On the range maximum-sum segment query problem. Discrete Applied Mathematics 155(16): 2043-2052 (2007) |
47 | EE | Hsiao-Fei Liu, Kun-Mao Chao: A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering. Theor. Comput. Sci. 389(1-2): 182-189 (2007) |
2006 | ||
46 | EE | Hsiao-Fei Liu, Kun-Mao Chao: On Locating Disjoint Segments with Maximum Sum of Densities. ISAAC 2006: 300-307 |
45 | EE | Chia-Jung Chang, Yao-Ting Huang, Kun-Mao Chao: A greedier approach for finding tag SNPs. Bioinformatics 22(6): 685-691 (2006) |
44 | EE | Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao: Improved algorithms for the k maximum-sums problems. Theor. Comput. Sci. 362(1-3): 162-170 (2006) |
2005 | ||
43 | EE | Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao: Improved Algorithms for the k Maximum-Sums Problems. ISAAC 2005: 799-808 |
42 | EE | Yao-Ting Huang, Kun-Mao Chao, Ting Chen: An approximation algorithm for haplotype inference by maximum parsimony. SAC 2005: 146-150 |
41 | EE | Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao: Selecting additional tag SNPs for tolerating missing data in genotyping. BMC Bioinformatics 6: 263 (2005) |
40 | EE | I-Hsuan Yang, Chien-Pin Huang, Kun-Mao Chao: A fast algorithm for computing a longest common increasing subsequence. Inf. Process. Lett. 93(5): 249-253 (2005) |
39 | EE | Kuan-Yu Chen, Kun-Mao Chao: Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint. Inf. Process. Lett. 96(6): 197-201 (2005) |
38 | EE | Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao: Finding a Length-Constrained Maximum-Density Path in a Tree. J. Comb. Optim. 9(2): 147-156 (2005) |
37 | EE | Yao-Ting Huang, Kun-Mao Chao, Ting Chen: An Approximation Algorithm for Haplotype Inference by Maximum Parsimony. Journal of Computational Biology 12(10): 1261-1274 (2005) |
2004 | ||
36 | EE | I-Hsuan Yang, Sheng-Ho Wang, Yang-Ho Chen, Pao-Hsian Huang, Liang Ye, Xiaoqiu Huang, Kun-Mao Chao: Efficient Methods for Generating Optimal Single and Multiple Spaced Seeds. BIBE 2004: 411-418 |
35 | EE | Kuan-Yu Chen, Kun-Mao Chao: On the Range Maximum-Sum Segment Query Problem. ISAAC 2004: 294-305 |
34 | Xiaoqiu Huang, Liang Ye, I-Hsuan Yang, Kun-Mao Chao: A Sensitive Sequence Comparison Method. SNPD 2004: 77-80 | |
33 | EE | Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao: Approximation Algorithms for the Selection of Robust Tag SNPs. WABI 2004: 278-289 |
32 | EE | Xiaoqiu Huang, Liang Ye, Hui-Hsien Chou, I-Hsuan Yang, Kun-Mao Chao: Efficient combination of multiple word models for improved sequence comparison. Bioinformatics 20(16): 2529-2533 (2004) |
31 | EE | Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao: An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics. SIGMOD Record 33(2): 21-26 (2004) |
2003 | ||
30 | EE | Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao: Finding a Length-Constrained Maximum-Density Path in a Tree. ISAAC 2003: 78-87 |
29 | Yaw-Ling Lin, Xiaoqiu Huang, Tao Jiang, Kun-Mao Chao: MAVG: locating non-overlapping maximum average segments in a given sequence. Bioinformatics 19(1): 151-152 (2003) | |
28 | Xiaoqiu Huang, Kun-Mao Chao: A generalized global alignment algorithm. Bioinformatics 19(2): 228-233 (2003) | |
27 | EE | Chuan Yi Tang, Chin Lung Lu, Margaret Dah-Tsyr Chang, Yin-Te Tsai, Yuh-Ju Sun, Kun-Mao Chao, Jia-Ming Chang, Yu-Han Chiou, Chia-Mao Wu, Hao-Teng Chang, Wei-I Chou: Constrained Multiple Sequence Alignment Tool Development Andits Application to Rnase Family Alignment. J. Bioinformatics and Computational Biology 1(2): 267-288 (2003) |
2002 | ||
26 | EE | Chuan Yi Tang, Chin Lung Lu, Margaret Dah-Tsyr Chang, Yin-Te Tsai, Yuh-Ju Sun, Kun-Mao Chao, Jia-Ming Chang, Yu-Han Chiou, Chia-Mao Wu, Hao-Teng Chang, Wei-I Chou: Constrained Multiple Sequence Alignment Tool Development and Its Application to RNase Family Alignment. CSB 2002: 127-137 |
25 | EE | Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao: Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis. MFCS 2002: 459-470 |
24 | EE | Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao: Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. J. Comput. Syst. Sci. 65(3): 570-586 (2002) |
23 | EE | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: Light graphs with small routing cost. Networks 39(3): 130-138 (2002) |
2000 | ||
22 | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: Approximation algorithms for some optimum communication spanning tree problems. Discrete Applied Mathematics 102(3): 245-266 (2000) | |
21 | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: Approximation algorithms for the shortest total path length spanning tree problem. Discrete Applied Mathematics 105(1-3): 273-289 (2000) | |
20 | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees. J. Algorithms 36(2): 182-204 (2000) | |
1999 | ||
19 | EE | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: Constructing Light Spanning Trees with Small Routing Cost. STACS 1999: 334-344 |
18 | Kun-Mao Chao: Calign: aligning sequences with restricted affine gap penalties. Bioinformatics 15(4): 298-304 (1999) | |
17 | EE | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree. Inf. Process. Lett. 69(2): 63-67 (1999) |
16 | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. J. Comb. Optim. 3(2-3): 199-211 (1999) | |
15 | Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang: A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees. SIAM J. Comput. 29(3): 761-778 (1999) | |
1998 | ||
14 | EE | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. COCOON 1998: 299-308 |
13 | EE | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: Approximation Algorithms for Some Optimum Communication Spanning Tree Problems. ISAAC 1998: 407-416 |
12 | Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang: A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees. SODA 1998: 21-32 | |
11 | EE | Q. S. Wu, Kun-Mao Chao, Richard C. T. Lee: The NPO-Completeness of the Longest Hamiltonian Cycle Problem. Inf. Process. Lett. 65(3): 119-123 (1998) |
10 | Kun-Mao Chao: On Computing all Supoptimal Alignments. Inf. Sci. 105(1-4): 189-207 (1998) | |
1997 | ||
9 | Kun-Mao Chao: Fast Algorithms for Aligning Sequences with Restricted Affine Gap Penalties. COCOON 1997: 264-273 | |
8 | Kun-Mao Chao, Jinghui Zhang, James Ostell, Webb Miller: A tool for aligning very similar DNA sequences. Computer Applications in the Biosciences 13(1): 75-80 (1997) | |
1995 | ||
7 | Kun-Mao Chao, Webb Miller: Linear-Space Algorithms that Build Local Alignments from Fragments. Algorithmica 13(1/2): 106-134 (1995) | |
6 | Kun-Mao Chao, Jinghui Zhang, James Ostell, Webb Miller: A local alignment tool for very long DNA sequences. Computer Applications in the Biosciences 11(2): 147-153 (1995) | |
1994 | ||
5 | Kun-Mao Chao: Computing all Suboptimal Alignments in Linear Space. CPM 1994: 31-42 | |
4 | Kun-Mao Chao, Ross C. Hardison, Webb Miller: Recent Developments in Linear-Space Alignment Methods: A Survey. Journal of Computational Biology 1(4): 271-292 (1994) | |
1993 | ||
3 | Kun-Mao Chao, Ross C. Hardison, Webb Miller: Locating well-conserved regions within a pairwise alignment. Computer Applications in the Biosciences 9(4): 387-396 (1993) | |
1992 | ||
2 | Kun-Mao Chao, William R. Pearson, Webb Miller: Aligning two sequences within a specified diagonal band. Computer Applications in the Biosciences 8(5): 481-487 (1992) | |
1990 | ||
1 | EE | Ruei-Chuan Chang, Kun-Mao Chao: Parallel Operator-Precedence Parsing. J. Inf. Sci. Eng. 6(1): 51-61 (1990) |