公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
2010 | Hardness of comparing two run-length encoded strings | Chen, K.-Y.; Hsu, P.-H.; Chao, K.-M.; KUN-MA0 CHAO | Journal of Complexity | 8 | 7 | |
2006 | Heaviest Segments in a Number Sequence | Chao, Kun-Mao; 趙坤茂 | | | | |
2010 | Identifying approximate palindromes in run-length encoded strings | Chen, K.-Y.; Hsu, P.-H.; Chao, K.-M.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 3 | 0 | |
2011 | Identifying relevant matches with NOT semantics over XML documents | Lin, R.-R.; Chang, Y.-H.; Chao, K.-M.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2 | 0 | |
2006 | Improved algorithms for the k maximum-sums problems | Cheng, C.-H.; Chen, K.-Y.; Tien, W.-C.; Chao, K.-M.; KUN-MA0 CHAO | Theoretical Computer Science | 11 | 9 | |
2005 | Improved algorithms for the k maximum-sums problems | Cheng, C.-H.; Chen, K.-Y.; Tien, W.-C.; Chao, K.-M.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 7 | 0 | |
2011 | Improving the performance of identifying contributors for XML keyword search | Lin, R.-R.; Chang, Y.-H.; KUN-MA0 CHAO | SIGMOD Record | 7 | 9 | |
2013 | In-silico drug screening and potential target identification for hepatocellular carcinoma using Support Vector Machines based on drug screening result | Yang, W.L.R.; Lee, Y.-E.; Chen, M.-H.; KUN-MAO CHAO ; Huang, C.Y.F. | Gene | 10 | 6 | |
2012 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface | Chao, K.-M.; Hsu, T.-S.; Lee, D.-T.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 0 | | |
2002 | Light Graphs with Small Routing Cost | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Networks | 28 | 22 | |
1995 | Linear-space algorithms that build local alignments from fragments | Chao, K.-M.; Miller, W.; KUN-MA0 CHAO | Algorithmica | 23 | 18 | |
2011 | Linear-time algorithms for the multiple gene duplication problems | Luo, C.-W.; Chen, M.-C.; Chen, Y.-C.; Yang, R.W.L.; Liu, H.-F.; Chao, K.-M.; KUN-MA0 CHAO | IEEE/ACM Transactions on Computational Biology and Bioinformatics | 16 | 14 | |
2014 | Locating valid SLCAs for XML keyword search with NOT semantics | Lin, R.-R.; Chang, Y.-H.; Chao, K.-M.; KUN-MA0 CHAO | SIGMOD Record | | | |
1993 | Locating well-conserved regions within a pairwise alignment | KUN-MAO CHAO ; Hardison, R.C.; Miller, W. | Bioinformatics | 32 | 23 | |
2003 | MAVG: Locating non-overlaping maximum average segments in a given sequence | Lin, Y.-L.; Huang, X.; Jiang, T.; KUN-MAO CHAO | Bioinformatics | 32 | 29 | |
2011 | Message from the program co-chairs | Chao, K.-M.; Ng, K.-L.; KUN-MA0 CHAO | 11th IEEE International Conference on Bioinformatics and Bioengineering | 0 | 0 | |
2005 | Minimum Routing Cost Spanning Trees | Chao, Kun-Mao; 趙坤茂 | | | | |
- | Minimum Spanning Trees | Chao, Kun-Mao; 趙坤茂 | | | | |
2008 | Minkowski sum selection and finding | Luo, C.-W.; Liu, H.-F.; Chen, P.-A.; Chao, K.-M.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 0 | 0 | |
2011 | Minkowski sum selection and finding | Luo, C.-W.; Liu, H.-F.; Chen, P.-A.; KUN-MA0 CHAO | International Journal of Computational Geometry and Applications | 0 | 0 | |