Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Kun-Mao Chao
2010 – today
- 2013
[j53]Kuan-Yu Chen, Kun-Mao Chao: A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings. Algorithmica 65(2): 354-370 (2013)- [j52]An-Chiang Chu, Bang Ye Wu, Kun-Mao Chao: A linear-time algorithm for finding an edge-partition with max-min ratio at most two. Discrete Applied Mathematics 161(7-8): 932-943 (2013)
- [c29]Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao: A Compact and Efficient Labeling Scheme for XML Documents. DASFAA (1) 2013: 269-283
- 2012
- [j51]Chia-Jung Chang, Kun-Mao Chao: Efficient algorithms for local ranking. Inf. Process. Lett. 112(13): 517-522 (2012)
- [j50]Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao: Efficient retrieval of approximate palindromes in a run-length encoded string. Theor. Comput. Sci. 432: 28-37 (2012)
- [c28]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
- [c27]Matthias Bernt, Kun-Mao Chao, Jyun-Wei Kao, Martin Middendorf, Eric Tannier: Preserving Inversion Phylogeny Reconstruction. WABI 2012: 1-13
- [e1]Kun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee (Eds.): Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings. Lecture Notes in Computer Science 7676, Springer 2012, ISBN 978-3-642-35260-7
- 2011
- [j49]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)
- [j48]Yi-Ching Chen, Kun-Mao Chao: On the generalized constrained longest common subsequence problems. J. Comb. Optim. 21(3): 383-392 (2011)
- [j47]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)
- [j46]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)
- [j45]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)
- [c26]Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao: Identifying Relevant Matches with NOT Semantics over XML Documents. DASFAA (1) 2011: 466-480
- 2010
- [j44]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)
- [j43]Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao: Finding All Approximate Gapped Palindromes. Int. J. Found. Comput. Sci. 21(6): 925-939 (2010)
- [j42]Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao: Hardness of comparing two run-length encoded strings. J. Complexity 26(4): 364-374 (2010)
- [c25]Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao: Faster Algorithms for Searching Relevant Matches in XML Databases. DEXA (1) 2010: 290-297
- [c24]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
- [c23]Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao: Identifying Approximate Palindromes in Run-Length Encoded Strings. ISAAC (2) 2010: 339-350
2000 – 2009
- 2009
- [j41]Hsiao-Fei Liu, Kun-Mao Chao: On Locating Disjoint Segments with Maximum Sum of Densities. Algorithmica 54(1): 107-117 (2009)
- [j40]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)
- [j39]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)
- [c22]Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao: Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard. CPM 2009: 168-179
- [c21]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
- [c20]Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao: Finding All Approximate Gapped Palindromes. ISAAC 2009: 1084-1093
- 2008
- [j38]Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao: The Swap Edges of a Multiple-Sources Routing Tree. Algorithmica 50(3): 299-311 (2008)
- [j37]Peng-An Chen, Hsiao-Fei Liu, Kun-Mao Chao: CNVDetector: locating copy number variations using array CGH data. Bioinformatics 24(23): 2773-2775 (2008)
- [j36]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)
- [j35]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)
- [j34]Hung-Lung Wang, Kun-Mao Chao: The 2-radius and 2-radiian problems on trees. Theor. Comput. Sci. 407(1-3): 524-531 (2008)
- [c19]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
- [c18]Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao: Minkowski Sum Selection and Finding. ISAAC 2008: 460-471
- [r2]
- [r1]
- [i3]Hsiao-Fei Liu, Kun-Mao Chao: An Õ(n2.5)-Time Algorithm for Online Topological Ordering. CoRR abs/0804.3860 (2008)
- [i2]Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao: Minkowski Sum Selection and Finding. CoRR abs/0809.1171 (2008)
- [i1]Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao: Algorithms for Locating Constrained Optimal Intervals. CoRR abs/0809.2097 (2008)
- 2007
- [j33]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)
- [j32]Kuan-Yu Chen, Kun-Mao Chao: On the range maximum-sum segment query problem. Discrete Applied Mathematics 155(16): 2043-2052 (2007)
- [j31]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)
- [c17]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
- 2006
- [j30]Chia-Jung Chang, Yao-Ting Huang, Kun-Mao Chao: A greedier approach for finding tag SNPs. Bioinformatics 22(6): 685-691 (2006)
- [j29]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)
- [c16]Hsiao-Fei Liu, Kun-Mao Chao: On Locating Disjoint Segments with Maximum Sum of Densities. ISAAC 2006: 300-307
- 2005
- [j28]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)
- [j27]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)
- [j26]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)
- [j25]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)
- [j24]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)
- [c15]Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao: Improved Algorithms for the k Maximum-Sums Problems. ISAAC 2005: 799-808
- [c14]Yao-Ting Huang, Kun-Mao Chao, Ting Chen: An approximation algorithm for haplotype inference by maximum parsimony. SAC 2005: 146-150
- 2004
- [j23]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)
- [j22]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)
- [c13]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
- [c12]
- [c11]Xiaoqiu Huang, Liang Ye, I-Hsuan Yang, Kun-Mao Chao: A Sensitive Sequence Comparison Method. SNPD 2004: 77-80
- [c10]Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao: Approximation Algorithms for the Selection of Robust Tag SNPs. WABI 2004: 278-289
- 2003
- [j21]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)
- [j20]Xiaoqiu Huang, Kun-Mao Chao: A generalized global alignment algorithm. Bioinformatics 19(2): 228-233 (2003)
- [j19]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)
- [c9]Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao: Finding a Length-Constrained Maximum-Density Path in a Tree. ISAAC 2003: 78-87
- 2002
- [j18]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)
- [j17]Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: Light graphs with small routing cost. Networks 39(3): 130-138 (2002)
- [c8]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
- [c7]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
- 2000
- [j16]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)
- [j15]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)
- [j14]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)
1990 – 1999
- 1999
- [j13]Kun-Mao Chao: Calign: aligning sequences with restricted affine gap penalties. Bioinformatics 15(4): 298-304 (1999)
- [j12]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)
- [j11]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)
- [j10]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)
- [c6]Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: Constructing Light Spanning Trees with Small Routing Cost. STACS 1999: 334-344
- 1998
- [j9]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)
- [j8]
- [c5]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
- [c4]Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang: Approximation Algorithms for Some Optimum Communication Spanning Tree Problems. ISAAC 1998: 407-416
- [c3]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
- 1997
- [j7]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)
- [c2]Kun-Mao Chao: Fast Algorithms for Aligning Sequences with Restricted Affine Gap Penalties. COCOON 1997: 264-273
- 1995
- [j6]Kun-Mao Chao, Webb Miller: Linear-Space Algorithms that Build Local Alignments from Fragments. Algorithmica 13(1/2): 106-134 (1995)
- [j5]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
- [j4]Kun-Mao Chao, Ross C. Hardison, Webb Miller: Recent Developments in Linear-Space Alignment Methods: A Survey. Journal of Computational Biology 1(4): 271-291 (1994)
- [c1]
- 1993
- [j3]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
- [j2]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
- [j1]Ruei-Chuan Chang, Kun-Mao Chao: Parallel Operator-Precedence Parsing. J. Inf. Sci. Eng. 6(1): 51-61 (1990)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-08 22:58 CEST by the dblp team