公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
2003 | A Generalized Global Alignment Algorithm | Huang, X.; Chao, K.-M. | Bioinformatics | | | |
2007 | Genomic Sequence Analysis: A Case Study in Constrained Heaviest Segments | Chao, K.-M. | Chapter 4 of the book “Computational Genomics: Current Methods,” edited by Nikola Stojanovic,? Horizon Press | | | |
1994 | Globin Gene Server: A Prototype E-Mail Database Server Featuring Extensive Multiple Alignments and Data Compilation for Electronic Genetic Analysis | Hardison, R.; Chao, K.-M.; Schwartz, S.; Stojanovic, N.; Ganetsky, M.; Miller, W.; KUN-MA0 CHAO | Genomics | 31 | 27 | |
2006 | A Greedier Approach for Finding Tag SNPs | Chang, C.-J.; Chang, Chia-Jung; Huang, Yao-Ting; Huang, Y.-T.; Chao, Kun-Mao; Chao, K.-M. | Bioinformatics | | | |
2013 | Guest editors' foreword | Chao, K.-M.; Hsu, T.-S.; KUN-MA0 CHAO | International Journal of Computational Geometry and Applications | 0 | 0 | |
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 | 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 | |
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) | | | |
2002 | Light Graph with Small Routing Cost | Wu, B. Y.; Chao, K.-M.; Tang, C. Y. | Networks | | | |
2002 | Light Graphs with Small Routing Cost | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Networks | 28 | 22 | |
2007 | A Linear Time Algorithm for the Backup 2-Center Problem on a Tree | Wang, H.-L.; Wu, B. Y.; Chao, K.-M. | The 24th Workshop on Combinatorial Math and Computation Theory | | | |
2000 | Linear Time Algorithm for the Hamiltonian Path Problem on a Series-Paralle Graph | Wu, Q. S.; Lee, R. C. T.; Chao, K.-M. | International Conference on Computer Science and Informatics | | | |
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 | | | |
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 | |
2011 | On the generalized constrained longest common subsequence problems | Chen, Y.-C.; Chao, K.-M.; KUN-MA0 CHAO | Journal of Combinatorial Optimization | 56 | 43 | |
2002 | On the Optimum Requirement Graph Problem | Wu, B. Y.; Chao, K.-M.; Tang, C. Y. | Workshop on Combinatorial Mathematics and Computational Theory | | | |
2004 | On the range maximum-sum segment query problem | Chen, K.-Y.; Chao, K.-M.; KUN-MA0 CHAO | Lecture Notes in Computer Science | | | |
2004 | On the Range Maximum-Sum Segment Query Problem | Chen, K.-Y.; Chao, K.-M. | International Symposium on Algorithms and Computation | | | |