公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
2015 | A fixed-parameter algorithm for detecting a singleton attractor in an AND/OR boolean network with bounded treewidth | Chang, C.-J.; Tamura, T.; Chao, K.-M.; Akutsu, T.; KUN-MA0 CHAO | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences | 2 | 1 | |
2013 | A fully compressed algorithm for computing the edit distance of run-length encoded strings | Chen, K.-Y.; Chao, K.-M.; KUN-MA0 CHAO | Algorithmica | 7 | 3 | |
2003 | A generalized global alignment algorithm | Huang, X.; Chao, K.-M.; KUN-MA0 CHAO | Bioinformatics | 65 | 51 | |
2006 | A greedier approach for finding tag SNPs | Chang, C.-J.; Huang, Y.-T.; Chao, K.-M.; KUN-MA0 CHAO | Bioinformatics | 25 | 22 | |
2013 | A linear-time algorithm for finding an edge-partition with max-min ratio at most two | Chu, A.-C.; Wu, B.Y.; Chao, K.-M.; KUN-MA0 CHAO | Discrete Applied Mathematics | 3 | 2 | |
1995 | A local alignment tool for very long DNA sequences | Chao, K.-M.; Zhang, J.; Ostell, J.; Miller, W.; KUN-MA0 CHAO | Computer Applications in the Biosciences | 40 | 0 | |
2000 | A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Journal of Algorithms | 22 | 17 | |
2000 | A polynomial-time approximation scheme for minimum routing cost spanning trees | Wu, B.Y.; Lancia, G.; Bafna, V.; Chao, K.-M.; Ravi, R.; Tang, C.Y.; KUN-MA0 CHAO | SIAM Journal on Computing | | | |
2010 | A tight bound on the min-ratio edge-partitioning problem of a tree | Chu, A.-C.; Wu, B.Y.; Wang, H.-L.; Chao, K.-M.; KUN-MA0 CHAO | Discrete Applied Mathematics | 4 | 3 | |
1997 | A tool for aligning very similar DNA sequences | Chao, K.-M.; Zhang, J.; Ostell, J.; Miller, W.; KUN-MA0 CHAO | Computer Applications in the Biosciences | | | |
2014 | Algorithms and Computation (ISAAC 2012) | Chao, K.-M.; Hsu, T.-S.; KUN-MA0 CHAO | Theoretical Computer Science | 0 | 0 | |
2007 | Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis | Liu, H.-F.; Chen, P.-A.; Chao, K.-M. | The 18th Annual Symposium on Algorithms and Computation | | | |
2007 | Algorithms for computing the length-constrained max-score segments with applications to DNA copy number data analysis | Liu, H.-F.; Chen, P.-A.; Chao, K.-M.; KUN-MA0 CHAO | Lecture Notes in Computer Science | | | |
1992 | Aligning two sequences within a specified diagonal band | Chao, K.-M.; Pearson, W.R.; Miller, W.; KUN-MA0 CHAO | Computer Applications in the Biosciences | 119 | 0 | |
2005 | An approximation algorithm for haplotype interence by maximum parsimony | Huang, Y.-T.; Chao, K.-M.; Chen, T.; KUN-MA0 CHAO | ACM Symposium on Applied Computing | | | |
1999 | An efficient algorithm for the length-constrained heaviest path problem on a tree | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Information Processing Letters | | | |
2009 | Approximate matching for run-length encoded strings is 3sum-hard | 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) | 8 | 0 | |
1998 | Approximation algorithms for some optimum communication spanning tree problems | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Lecture Notes in Computer Science | | | |
2000 | Approximation algorithms for some optimum communication spanning tree problems | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Discrete Applied Mathematics | | | |
2000 | Approximation Algorithms for some Optimum Communication Spanning Tree Problems | Wu, B. Y.; Chao, K.-M.; Tang, C. Y. | Discrete Applied Mathematics | | | |