Kun-Mao Chao

Publication Activity (10 Years)

Years Active: 1990-2022
Publications (10 Years): 5

Top Topics

Top Venues

Discret. Appl. Math.

Publications

Min-Jen Chen, Kun-Mao Chao
Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection. Discret. Appl. Math. 321 (2022)
Albert Jhih-Heng Huang, Hung-Lung Wang, Kun-Mao Chao
Computing the Line-Constrained k-center in the Plane for Small k. AAIM (2016)
Tsung-Han Tsai, Lih-Jen Kau, Kun-Mao Chao
A Takagi-Sugeno fuzzy neural network-based algorithm with single-channel EEG signal for the discrimination between light and deep sleep stages. BioCAS (2016)
Chia-Jung Chang, Takeyuki Tamura, Kun-Mao Chao, Tatsuya Akutsu
A Fixed-Parameter Algorithm for Detecting a Singleton Attractor in an AND/OR Boolean Network with Bounded Treewidth. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (1) (2015)
Wei-Yin Lin, Yen-Wei Wu, Hung-Lung Wang, Kun-Mao Chao
Forming Plurality at Minimum Cost. WALCOM (2015)
Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao
Locating Valid SLCAs for XML Keyword Search with NOT Semantics. SIGMOD Rec. 43 (2) (2014)
Kun-Mao Chao, Tsan-sheng Hsu, D. T. Lee
Algorithms and Computation (ISAAC 2012). Theor. Comput. Sci. 544 (2014)
Chia-Jung Chang, Pei-Lung Chen, Wei-Shiung Yang, Kun-Mao Chao
A fault-tolerant method for HLA typing with PacBio data. BMC Bioinform. 15 (2014)
Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao
The Generalized Popular Condensation Problem. ISAAC (2014)
Kun-Mao Chao, Tsan-sheng Hsu, D. T. Lee
Preface Algorithms and Computation (ISAAC 2012). Algorithmica 70 (4) (2014)
Kun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 23 (6) (2013)
Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao
An Optimal Algorithm for the Popular Condensation Problem. IWOCA (2013)
Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao
Computing Plurality Points and Condorcet Points in Euclidean Space. ISAAC (2013)
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. Discret. Appl. Math. 161 (7-8) (2013)
Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao
A Compact and Efficient Labeling Scheme for XML Documents. DASFAA (1) (2013)
Kuan-Yu Chen, Kun-Mao Chao
A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings. Algorithmica 65 (2) (2013)
Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao
Efficient retrieval of approximate palindromes in a run-length encoded string. Theor. Comput. Sci. 432 (2012)
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)
Matthias Bernt, Kun-Mao Chao, Jyun-Wei Kao, Martin Middendorf, Eric Tannier
Preserving Inversion Phylogeny Reconstruction. WABI (2012)
Chia-Jung Chang, Kun-Mao Chao
Efficient algorithms for local ranking. Inf. Process. Lett. 112 (13) (2012)
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) (2011)
Yi-Ching Chen, Kun-Mao Chao
On the generalized constrained longest common subsequence problems. J. Comb. Optim. 21 (3) (2011)
Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao
Minkowski Sum Selection and Finding. Int. J. Comput. Geom. Appl. 21 (3) (2011)
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. Biol. Bioinform. 8 (1) (2011)
Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao
Improving the performance of identifying contributors for XML keyword search. SIGMOD Rec. 40 (1) (2011)
Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao
Identifying Relevant Matches with NOT Semantics over XML Documents. DASFAA (1) (2011)
Kuan-Yu Chen, Kun-Mao Chao
A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings. ESA (1) (2010)
Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao
Finding All Approximate Gapped Palindromes. Int. J. Found. Comput. Sci. 21 (6) (2010)
Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao
Hardness of comparing two run-length encoded strings. J. Complex. 26 (4) (2010)
Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao
Faster Algorithms for Searching Relevant Matches in XML Databases. DEXA (1) (2010)
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. Discret. Appl. Math. 158 (14) (2010)
Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao
Identifying Approximate Palindromes in Run-Length Encoded Strings. ISAAC (2) (2010)
Hung-Lung Wang, Bang Ye Wu, Kun-Mao Chao
The backup 2-center and backup 2-median problems on trees. Networks 53 (1) (2009)
Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao
Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard. CPM (2009)
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)
Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao
Finding All Approximate Gapped Palindromes. ISAAC (2009)
Chih-Huai Cheng, Hsiao-Fei Liu, Kun-Mao Chao
Optimal algorithms for the average-constrained maximum-sum segment problem. Inf. Process. Lett. 109 (3) (2009)
Hsiao-Fei Liu, Kun-Mao Chao
On Locating Disjoint Segments with Maximum Sum of Densities. Algorithmica 54 (1) (2009)
Hsiao-Fei Liu, Kun-Mao Chao
)-Time Algorithm for Online Topological Ordering CoRR (2008)
Yao-Ting Huang, Kun-Mao Chao
A new framework for the selection of tag SNPs by multimarker haplotypes. J. Biomed. Informatics 41 (6) (2008)
Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao
Minkowski Sum Selection and Finding CoRR (2008)
Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao
The Swap Edges of a Multiple-Sources Routing Tree. Algorithmica 50 (3) (2008)
Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao
Algorithms for Locating Constrained Optimal Intervals CoRR (2008)
Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao
Minkowski Sum Selection and Finding. ISAAC (2008)
Hung-Lung Wang, Kun-Mao Chao
The 2-radius and 2-radiian problems on trees. Theor. Comput. Sci. 407 (1-3) (2008)
Peng-An Chen, Hsiao-Fei Liu, Kun-Mao Chao
CNVDetector: locating copy number variations using array CGH data. Bioinform. 24 (23) (2008)
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) (2008)
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)
Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao Chao
On the uniform edge-partition of a tree. Discret. Appl. Math. 155 (10) (2007)
Kuan-Yu Chen, Kun-Mao Chao
On the range maximum-sum segment query problem. Discret. Appl. Math. 155 (16) (2007)
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)
Hsiao-Fei Liu, Kun-Mao Chao
A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering. Theor. Comput. Sci. 389 (1-2) (2007)
Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao
maximum-sums problems. Theor. Comput. Sci. 362 (1-3) (2006)
Chia-Jung Chang, Yao-Ting Huang, Kun-Mao Chao
A greedier approach for finding tag SNPs. Bioinform. 22 (6) (2006)
Hsiao-Fei Liu, Kun-Mao Chao
On Locating Disjoint Segments with Maximum Sum of Densities. ISAAC (2006)
Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao
Maximum-Sums Problems. ISAAC (2005)
Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao
Finding a Length-Constrained Maximum-Density Path in a Tree. J. Comb. Optim. 9 (2) (2005)
I-Hsuan Yang, Chien-Pin Huang, Kun-Mao Chao
A fast algorithm for computing a longest common increasing subsequence. Inf. Process. Lett. 93 (5) (2005)
Yao-Ting Huang, Kun-Mao Chao, Ting Chen
An Approximation Algorithm for Haplotype Inference by Maximum Parsimony. J. Comput. Biol. 12 (10) (2005)
Yao-Ting Huang, Kun-Mao Chao, Ting Chen
An approximation algorithm for haplotype inference by maximum parsimony. SAC (2005)
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) (2005)
Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao
Selecting additional tag SNPs for tolerating missing data in genotyping. BMC Bioinform. 6 (2005)
Xiaoqiu Huang, Liang Ye, Hui-Hsien Chou, I-Hsuan Yang, Kun-Mao Chao
Efficient combination of multiple word models for improved sequence comparison. Bioinform. 20 (16) (2004)
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)
Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao
Approximation Algorithms for the Selection of Robust Tag SNPs. WABI (2004)
Kuan-Yu Chen, Kun-Mao Chao
On the Range Maximum-Sum Segment Query Problem. ISAAC (2004)
Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics. SIGMOD Rec. 33 (2) (2004)
Xiaoqiu Huang, Liang Ye, I-Hsuan Yang, Kun-Mao Chao
A Sensitive Sequence Comparison Method. SNPD (2004)
Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao
Finding a Length-Constrained Maximum-Density Path in a Tree. ISAAC (2003)
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. Bioinform. Comput. Biol. 1 (2) (2003)
Yaw-Ling Lin, Xiaoqiu Huang, Tao Jiang, Kun-Mao Chao
MAVG: locating non-overlapping maximum average segments in a given sequence. Bioinform. 19 (1) (2003)
Xiaoqiu Huang, Kun-Mao Chao
A generalized global alignment algorithm. Bioinform. 19 (2) (2003)
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) (2002)
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
Light graphs with small routing cost. Networks 39 (3) (2002)
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)
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)
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) (2000)
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
Approximation algorithms for the shortest total path length spanning tree problem. Discret. Appl. Math. 105 (1-3) (2000)
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
Approximation algorithms for some optimum communication spanning tree problems. Discret. Appl. Math. 102 (3) (2000)
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) (1999)
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) (1999)
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
Constructing Light Spanning Trees with Small Routing Cost. STACS (1999)
Kun-Mao Chao
Calign: aligning sequences with restricted affine gap penalties. Bioinform. 15 (4) (1999)
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) (1999)
Kun-Mao Chao
On Computing all Supoptimal Alignments. Inf. Sci. 105 (1-4) (1998)
Q. S. Wu, Kun-Mao Chao, Richard C. T. Lee
The NPO-Completeness of the Longest Hamiltonian Cycle Problem. Inf. Process. Lett. 65 (3) (1998)
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems. ISAAC (1998)
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. COCOON (1998)
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)
Kun-Mao Chao
Fast Algorithms for Aligning Sequences with Restricted Affine Gap Penalties. COCOON (1997)
Kun-Mao Chao, Jinghui Zhang, James Ostell, Webb Miller
A tool for aligning very similar DNA sequences. Comput. Appl. Biosci. 13 (1) (1997)
Kun-Mao Chao, Webb Miller
Linear-Space Algorithms that Build Local Alignments from Fragments. Algorithmica 13 (1/2) (1995)
Kun-Mao Chao, Jinghui Zhang, James Ostell, Webb Miller
A local alignment tool for very long DNA sequences. Comput. Appl. Biosci. 11 (2) (1995)
Kun-Mao Chao, Ross C. Hardison, Webb Miller
Recent Developments in Linear-Space Alignment Methods: A Survey. J. Comput. Biol. 1 (4) (1994)
Kun-Mao Chao
Computing all Suboptimal Alignments in Linear Space. CPM (1994)
Kun-Mao Chao, Ross C. Hardison, Webb Miller
Locating well-conserved regions within a pairwise alignment. Comput. Appl. Biosci. 9 (4) (1993)
Kun-Mao Chao, William R. Pearson, Webb Miller
Aligning two sequences within a specified diagonal band. Comput. Appl. Biosci. 8 (5) (1992)
Ruei-Chuan Chang, Kun-Mao Chao
Parallel Operator-Precedence Parsing. J. Inf. Sci. Eng. 6 (1) (1990)