Kun-Mao Chao

	2012
82		Kun-Mao Chao, An-Chiang Chu, Jesper Jansson, Richard S. Lemence, Alban Mancheron: Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics. TAMC 2012: 177-188
81		Chia-Jung Chang, Kun-Mao Chao: Efficient algorithms for local ranking. Inf. Process. Lett. 112(13): 517-522 (2012)
	2011
80		Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao: Identifying Relevant Matches with NOT Semantics over XML Documents. DASFAA (1) 2011: 466-480
79		Cheng-Wei Luo, Ming-Chiang Chen, Yi-Ching Chen, Roger W. L. Yang, Hsiao-Fei Liu, Kun-Mao Chao: Linear-Time Algorithms for the Multiple Gene Duplication Problems. IEEE/ACM Trans. Comput. Biology Bioinform. 8(1): 260-265 (2011)
78		Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao: Minkowski Sum Selection and Finding. Int. J. Comput. Geometry Appl. 21(3): 283-311 (2011)
77		Yi-Ching Chen, Kun-Mao Chao: On the generalized constrained longest common subsequence problems. J. Comb. Optim. 21(3): 383-392 (2011)
76		Matthias Bernt, Kuan-Yu Chen, Ming-Chiang Chen, An-Chiang Chu, Daniel Merkle, Hung-Lung Wang, Kun-Mao Chao, Martin Middendorf: Finding all sorting tandem duplication random loss operations. J. Discrete Algorithms 9(1): 32-48 (2011)
75		Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao: Improving the performance of identifying contributors for XML keyword search. SIGMOD Record 40(1): 5-10 (2011)
	2010
74		Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao: Faster Algorithms for Searching Relevant Matches in XML Databases. DEXA (1) 2010: 290-297
73		Kuan-Yu Chen, Kun-Mao Chao: A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings. ESA (1) 2010: 415-426
72		Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao: Identifying Approximate Palindromes in Run-Length Encoded Strings. ISAAC (2) 2010: 339-350
71		An-Chiang Chu, Bang Ye Wu, Hung-Lung Wang, Kun-Mao Chao: A tight bound on the min-ratio edge-partitioning problem of a tree. Discrete Applied Mathematics 158(14): 1471-1478 (2010)
70		Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao: Finding All Approximate Gapped Palindromes. Int. J. Found. Comput. Sci. 21(6): 925-939 (2010)
69		Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao: Hardness of comparing two run-length encoded strings. J. Complexity 26(4): 364-374 (2010)
	2009
68		Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao: Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard. CPM 2009: 168-179
67		Matthias Bernt, Ming-Chiang Chen, Daniel Merkle, Hung-Lung Wang, Kun-Mao Chao, Martin Middendorf: Finding All Sorting Tandem Duplication Random Loss Operations. CPM 2009: 301-313
66		Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao: Finding All Approximate Gapped Palindromes. ISAAC 2009: 1084-1093
65		Hsiao-Fei Liu, Kun-Mao Chao: On Locating Disjoint Segments with Maximum Sum of Densities. Algorithmica 54(1): 107-117 (2009)
64		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)
63		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
62		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
61		Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao: Minkowski Sum Selection and Finding. ISAAC 2008: 460-471
60		Kun-Mao Chao: Maximum-Density Segment. Encyclopedia of Algorithms 2008
59		Kun-Mao Chao: Maximum-scoring Segment with Length Restrictions. Encyclopedia of Algorithms 2008
58		Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao: The Swap Edges of a Multiple-Sources Routing Tree. Algorithmica 50(3): 299-311 (2008)
57		Peng-An Chen, Hsiao-Fei Liu, Kun-Mao Chao: CNVDetector: locating copy number variations using array CGH data. Bioinformatics 24(23): 2773-2775 (2008)
56		Hsiao-Fei Liu, Kun-Mao Chao: An Õ(n2.5)-Time Algorithm for Online Topological Ordering CoRR abs/0804.3860: (2008)
55		Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao: Minkowski Sum Selection and Finding CoRR abs/0809.1171: (2008)
54		Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao: Algorithms for Locating Constrained Optimal Intervals CoRR abs/0809.2097: (2008)
53		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		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		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		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		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		Kuan-Yu Chen, Kun-Mao Chao: On the range maximum-sum segment query problem. Discrete Applied Mathematics 155(16): 2043-2052 (2007)
47		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		Hsiao-Fei Liu, Kun-Mao Chao: On Locating Disjoint Segments with Maximum Sum of Densities. ISAAC 2006: 300-307
45		Chia-Jung Chang, Yao-Ting Huang, Kun-Mao Chao: A greedier approach for finding tag SNPs. Bioinformatics 22(6): 685-691 (2006)
44		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		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		Yao-Ting Huang, Kun-Mao Chao, Ting Chen: An approximation algorithm for haplotype inference by maximum parsimony. SAC 2005: 146-150
41		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		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		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		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		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		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		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		Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao: Approximation Algorithms for the Selection of Robust Tag SNPs. WABI 2004: 278-289
32		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		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		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		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		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		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		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		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		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		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		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		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		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		Ruei-Chuan Chang, Kun-Mao Chao: Parallel Operator-Precedence Parsing. J. Inf. Sci. Eng. 6(1): 51-61 (1990)

Coauthor Index

1	Vineet Bafna	[12] [15]
2	Matthias Bernt	[67] [76]
3	Chao-Hui Chang	[62]
4	Chia-Jung Chang	[45] [81]
5	Hao-Teng Chang	[26] [27]
6	Jia-Ming Chang	[26] [27]
7	Margaret Dah-Tsyr Chang	[26] [27]
8	Ruei-Chuan Chang	[1]
9	Ya-Hui Chang	[31] [74] [75] [80]
10	Kuan-Yu Chen	[35] [39] [43] [44] [48] [66] [68] [69] [70] [72] [73] [76]
11	Ming-Chiang Chen	[67] [76] [79]
12	Peng-An Chen	[50] [54] [55] [57] [61] [78]
13	Ting Chen	[33] [37] [41] [42]
14	Yang-Ho Chen	[36]
15	Yi-Ching Chen	[77] [79]
16	Chih-Huai Cheng	[43] [44] [64]
17	Yu-Han Chiou	[26] [27]
18	Hui-Hsien Chou	[32]
19	Wei-I Chou	[26] [27]
20	An-Chiang Chu	[71] [76] [82]
21	Ross C. Hardison	[3] [4]
22	Yi-Ren Hong	[62]
23	Chih-Yuan Hsiao	[58]
24	Ping-Hui Hsu	[66] [68] [69] [70] [72]
25	Chi-Ying F. Huang	[62]
26	Chien-Pin Huang	[40]
27	Pao-Hsian Huang	[36]
28	Xiaoqiu Huang	[28] [29] [32] [34] [36]
29	Yao-Ting Huang	[33] [37] [41] [42] [45] [53]
30	Jesper Jansson	[82]
31	Tao Jiang	[24] [25] [29]
32	Shih Ta Kuan	[49]
33	Wen-Hsiung Kuo	[30] [38]
34	Jin-Mei Lai	[62]
35	Giuseppe Lancia	[12] [15]
36	Richard C. T. Lee (Richard Chia-Tung Lee)	[11]
37	Sheng-An Lee	[62]
38	Richard S. Lemence	[82]
39	Rung-Ren Lin	[30] [38] [74] [75] [80]
40	Tsu-Chun Emma Lin	[62]
41	Yaw-Ling Lin	[24] [25] [29]
42	Hsiao-Fei Liu	[31] [46] [47] [50] [52] [54] [55] [56] [57] [61] [64] [65] [78] [79]
43	Chin Lung Lu	[26] [27]
44	Cheng-Wei Luo	[55] [61] [78] [79]
45	Alban Mancheron	[82]
46	Daniel Merkle	[67] [76]
47	Martin Middendorf	[67] [76]
48	Webb Miller (Webb C. Miller)	[2] [3] [4] [6] [7] [8]
49	James Ostell	[6] [8]
50	William R. Pearson	[2]
51	R. Ravi	[12] [15]
52	Yuh-Ju Sun	[26] [27]
53	Chuan Yi Tang	[12] [13] [14] [15] [16] [17] [19] [20] [21] [22] [23] [26] [27]
54	Wen-Chin Tien	[43] [44]
55	Yin-Te Tsai	[26] [27]
56	Tzu-Ling Tseng	[62]
57	Hung-Lung Wang	[49] [51] [63] [67] [71] [76]
58	Sheng-Ho Wang	[36]
59	Bang Ye Wu	[12] [13] [14] [15] [16] [17] [19] [20] [21] [22] [23] [49] [58] [63] [71]
60	Chia-Mao Wu	[26] [27]
61	Q. S. Wu	[11]
62	Chia-Ying Yang	[62]
63	I-Hsuan Yang	[32] [34] [36] [40]
64	Jinn-Moon Yang	[62]
65	Roger W. L. Yang	[79]
66	Liang Ye	[32] [34] [36]
67	Chueh-Chuan Yen	[62]
68	Ya-Ling Yu	[62]
69	Jinghui Zhang	[6] [8]
70	Kui Zhang	[33] [41]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page