| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Chia-Jung Chang, Kun-Mao Chao |
Efficient algorithms for local ranking.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Yi-Ching Chen, Kun-Mao Chao |
On the generalized constrained longest common subsequence problems. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao |
Improving the performance of identifying contributors for XML keyword search. |
SIGMOD Record |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao |
Minkowski Sum Selection and Finding. |
Int. J. Comput. Geometry Appl. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao |
Identifying Relevant Matches with NOT Semantics over XML Documents. |
DASFAA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao |
Hardness of comparing two run-length encoded strings. |
J. Complexity |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao |
Finding All Approximate Gapped Palindromes. |
Int. J. Found. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kuan-Yu Chen, Kun-Mao Chao |
A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings. |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rung-Ren Lin, Ya-Hui Chang, Kun-Mao Chao |
Faster Algorithms for Searching Relevant Matches in XML Databases. |
DEXA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao |
Identifying Approximate Palindromes in Run-Length Encoded Strings. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Chih-Huai Cheng, Hsiao-Fei Liu, Kun-Mao Chao |
Optimal algorithms for the average-constrained maximum-sum segment problem. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hung-Lung Wang, Bang Ye Wu, Kun-Mao Chao |
The backup 2-center and backup 2-median problems on trees. |
Networks |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hsiao-Fei Liu, Kun-Mao Chao |
On Locating Disjoint Segments with Maximum Sum of Densities. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Maximum-average segment, Maximum-density segment, Sequence analysis |
| 1 | Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao |
Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard. |
CPM |
2009 |
DBLP DOI BibTeX RDF |
3sum, wildcard matching, k-mismatches, alignment, run-length encoding |
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao |
Finding All Approximate Gapped Palindromes. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
palindrome, incremental string comparison, string matching |
| 1 | Hung-Lung Wang, Kun-Mao Chao |
The 2-radius and 2-radiian problems on trees. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao |
The Swap Edges of a Multiple-Sources Routing Tree. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Swap edge, Algorithm, Graph, Spanning tree, Optimization problem |
| 1 | Peng-An Chen, Hsiao-Fei Liu, Kun-Mao Chao |
CNVDetector: locating copy number variations using array CGH data. |
Bioinformatics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yao-Ting Huang, Kun-Mao Chao |
A new framework for the selection of tag SNPs by multimarker haplotypes. |
Journal of Biomedical Informatics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao |
Algorithms for Locating Constrained Optimal Intervals |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Hsiao-Fei Liu, Kun-Mao Chao |
An Õ(n2.5)-Time Algorithm for Online Topological Ordering |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao |
Minkowski Sum Selection and Finding |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Kun-Mao Chao |
Maximum-Density Segment. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kun-Mao Chao |
Maximum-scoring Segment with Length Restrictions. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao |
Minkowski Sum Selection and Finding. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
Bioinformatics, Sequence analysis, Minkowski sum |
| 1 | Hsiao-Fei Liu, Kun-Mao Chao |
A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao Chao |
On the uniform edge-partition of a tree. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kuan-Yu Chen, Kun-Mao Chao |
On the range maximum-sum segment query problem. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao |
Improved algorithms for the k maximum-sums problems. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Chia-Jung Chang, Yao-Ting Huang, Kun-Mao Chao |
A greedier approach for finding tag SNPs. |
Bioinformatics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hsiao-Fei Liu, Kun-Mao Chao |
On Locating Disjoint Segments with Maximum Sum of Densities. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao |
Finding a Length-Constrained Maximum-Density Path in a Tree. |
J. Comb. Optim. |
2005 |
DBLP DOI BibTeX RDF |
algorithm, tree, network design, computational biology |
| 1 | I-Hsuan Yang, Chien-Pin Huang, Kun-Mao Chao |
A fast algorithm for computing a longest common increasing subsequence. |
Inf. Process. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao |
Selecting additional tag SNPs for tolerating missing data in genotyping. |
BMC Bioinformatics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Yao-Ting Huang, Kun-Mao Chao, Ting Chen |
An Approximation Algorithm for Haplotype Inference by Maximum Parsimony. |
Journal of Computational Biology |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Yao-Ting Huang, Kun-Mao Chao, Ting Chen |
An approximation algorithm for haplotype inference by maximum parsimony. |
SAC |
2005 |
DBLP DOI BibTeX RDF |
integer quadratic programming, algorithm, maximum parsimony, haplotype inference, semi-definite programming |
| 1 | Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao |
Improved Algorithms for the k Maximum-Sums Problems. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaoqiu Huang, Liang Ye, Hui-Hsien Chou, I-Hsuan Yang, Kun-Mao Chao |
Efficient combination of multiple word models for improved sequence comparison. |
Bioinformatics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao |
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics. |
SIGMOD Record |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaoqiu Huang, Liang Ye, I-Hsuan Yang, Kun-Mao Chao |
A Sensitive Sequence Comparison Method. |
SNPD |
2004 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
Sequence Alignment, Database Search |
| 1 | Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao |
Approximation Algorithms for the Selection of Robust Tag SNPs. |
WABI |
2004 |
DBLP DOI BibTeX RDF |
approximation algorithm, missing data, SNP, haplotype block |
| 1 | Kuan-Yu Chen, Kun-Mao Chao |
On the Range Maximum-Sum Segment Query Problem. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
RMQ, maximum-sum interval, Algorithm, sequence analysis |
| 1 | Yaw-Ling Lin, Xiaoqiu Huang, Tao Jiang, Kun-Mao Chao |
MAVG: locating non-overlapping maximum average segments in a given sequence. |
Bioinformatics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaoqiu Huang, Kun-Mao Chao |
A generalized global alignment algorithm. |
Bioinformatics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao |
Finding a Length-Constrained Maximum-Density Path in a Tree. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
Algorithms, trees, network design, computational biology |
| 1 | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang |
Light graphs with small routing cost. |
Networks |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
maximum consecutive subsequence, length constraint, biomolecular sequence analysis, ungapped local alignment, Algorithm, efficiency |
| 1 | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang |
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees. |
J. Algorithms |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang |
Approximation algorithms for some optimum communication spanning tree problems. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang |
Approximation algorithms for the shortest total path length spanning tree problem. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang |
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. |
J. Comb. Optim. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Kun-Mao Chao |
Calign: aligning sequences with restricted affine gap penalties. |
Bioinformatics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang |
Constructing Light Spanning Trees with Small Routing Cost. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
approximation algorithms, network design, spanning trees |
| 1 | Q. S. Wu, Kun-Mao Chao, Richard C. T. Lee |
The NPO-Completeness of the Longest Hamiltonian Cycle Problem. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Kun-Mao Chao |
On Computing all Supoptimal Alignments. |
Inf. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang |
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
ultrametric trees, approximation algorithms, branch and bound, computational biology |
| 1 | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang |
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems. |
ISAAC |
1998 |
DBLP DOI BibTeX RDF |
approximation algorithms, network design, spanning trees |
| 1 | Kun-Mao Chao, Jinghui Zhang, James Ostell, Webb Miller |
A tool for aligning very similar DNA sequences. |
Computer Applications in the Biosciences |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Kun-Mao Chao |
Fast Algorithms for Aligning Sequences with Restricted Affine Gap Penalties. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Kun-Mao Chao, Webb Miller |
Linear-Space Algorithms that Build Local Alignments from Fragments. |
Algorithmica |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Kun-Mao Chao, Jinghui Zhang, James Ostell, Webb Miller |
A local alignment tool for very long DNA sequences. |
Computer Applications in the Biosciences |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Kun-Mao Chao, Ross C. Hardison, Webb Miller |
Recent Developments in Linear-Space Alignment Methods: A Survey. |
Journal of Computational Biology |
1994 |
DBLP BibTeX RDF |
|
| 1 | Kun-Mao Chao |
Computing all Suboptimal Alignments in Linear Space. |
CPM |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Kun-Mao Chao, Ross C. Hardison, Webb Miller |
Locating well-conserved regions within a pairwise alignment. |
Computer Applications in the Biosciences |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Kun-Mao Chao, William R. Pearson, Webb Miller |
Aligning two sequences within a specified diagonal band. |
Computer Applications in the Biosciences |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruei-Chuan Chang, Kun-Mao Chao |
Parallel Operator-Precedence Parsing. |
J. Inf. Sci. Eng. |
1990 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")