第 1 到 48 筆結果,共 48 筆。
公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 | |
---|---|---|---|---|---|---|---|
1 | 2016 | SMART: Statistical Metabolomics Analysis - An R Tool | Liang, Y.-J.; Lin, Y.-T.; Chen, C.-W.; Lin, C.-W.; Chao, K.-M.; Pan, W.-H.; Yang, H.-C.; KUN-MA0 CHAO | Analytical Chemistry | |||
2 | 2015 | Forming plurality at minimum cost | Lin, W.-Y.; Wu, Y.-W.; Wang, H.-L.; Chao, K.-M.; KUN-MA0 CHAO | Lecture Notes in Computer Science | |||
3 | 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 | |
4 | 2014 | Algorithms and Computation (ISAAC 2012) | Chao, K.-M.; Hsu, T.-S.; KUN-MA0 CHAO | Theoretical Computer Science | 0 | 0 | |
5 | 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 | |||
6 | 2013 | Guest editors' foreword | Chao, K.-M.; Hsu, T.-S.; KUN-MA0 CHAO | International Journal of Computational Geometry and Applications | 0 | 0 | |
7 | 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 | |
8 | 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 | |
9 | 2012 | Efficient retrieval of approximate palindromes in a run-length encoded string | Chen, K.-Y.; Hsu, P.-H.; Chao, K.-M.; KUN-MA0 CHAO | Theoretical Computer Science | 5 | 1 | |
10 | 2012 | Efficient algorithms for local ranking | Chang, C.-J.; Chao, K.-M.; KUN-MA0 CHAO | Information Processing Letters | 1 | 1 | |
11 | 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) | |||
12 | 2012 | Preserving inversion phylogeny reconstruction | Bernt, M.; Chao, K.-M.; Kao, J.-W.; Middendorf, M.; Tannier, E.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |||
13 | 2011 | Finding all sorting tandem duplication random loss operations | Bernt, M.; Chen, K.-Y.; Chen, M.-C.; Chu, A.-C.; Merkle, D.; Wang, H.-L.; Chao, K.-M.; KUN-MA0 CHAO | Journal of Discrete Algorithms | 15 | 0 | |
14 | 2011 | On the generalized constrained longest common subsequence problems | Chen, Y.-C.; Chao, K.-M.; KUN-MA0 CHAO | Journal of Combinatorial Optimization | 56 | 43 | |
15 | 2011 | The extent of linkage disequilibrium and computational challenges of single nucleotide polymorphisms in genome-wide association studies | Huang, Y.-T.; Chang, C.-J.; Chao, K.-M.; KUN-MA0 CHAO | Current Drug Metabolism | 2 | 3 | |
16 | 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 | |
17 | 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 | |
18 | 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 | |
19 | 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 | |
20 | 2009 | Securing information display for multiple secrets | Shyu, S.J.; Chen, M.-C.; Chao, K.-M.; KUN-MA0 CHAO | Optical Engineering | 3 | 2 | |
21 | 2009 | Finding All sorting tandem duplication random loss operations | Bernt, M.; Chen, M.-C.; Merkle, D.; Wang, H.-L.; Chao, K.-M.; Middendorf, M.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |||
22 | 2007 | On the range maximum-sum segment query problem | Chen, K.-Y.; Chao, K.-M.; KUN-MA0 CHAO | Discrete Applied Mathematics | 14 | 11 | |
23 | 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 | |||
24 | 2006 | Distant HNF1 site as a master control for the human class I alcohol dehydrogenase gene expression | Su, J.-S.; Tsai, T.-F.; Chang, H.-M.; Chao, K.-M.; Su, T.-S.; Tsai, S.-F.; KUN-MA0 CHAO | Journal of Biological Chemistry | 20 | 17 | |
25 | 2006 | A greedier approach for finding tag SNPs | Chang, C.-J.; Huang, Y.-T.; Chao, K.-M.; KUN-MA0 CHAO | Bioinformatics | 25 | 22 | |
26 | 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 | |
27 | 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 | |||
28 | 2004 | Approximation algorithms for the selection of robust tag SNPs | Huang, Y.-T.; Zhang, K.; Chen, T.; Chao, K.-M.; KUN-MA0 CHAO | Lecture Notes in Computer Science | |||
29 | 2004 | Efficient combination of multiple word models for improved sequence comparison | Huang, X.; Ye, L.; Chou, H. -H.; Yang, I. -H; Chao, K.-M.; KUN-MA0 CHAO | Bioinformatics | 8 | 8 | |
30 | 2004 | On the range maximum-sum segment query problem | Chen, K.-Y.; Chao, K.-M.; KUN-MA0 CHAO | Lecture Notes in Computer Science | |||
31 | 2004 | Efficient methods for generating optimal single and multiple spaced seeds | Yang, I.-H.; Wang, S.-H.; Chen, Y.-H.; Huang, P.-H.; Ye, L.; Huang, X.; Chao, K.-M.; KUN-MA0 CHAO | Fourth IEEE Symposium on Bioinformatics and Bioengineering | |||
32 | 2003 | A generalized global alignment algorithm | Huang, X.; Chao, K.-M.; KUN-MA0 CHAO | Bioinformatics | 65 | 51 | |
33 | 2002 | Light Graphs with Small Routing Cost | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Networks | 28 | 22 | |
34 | 2000 | Approximation algorithms for the shortest total path length spanning tree problem | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Discrete Applied Mathematics | |||
35 | 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 | |||
36 | 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 | |||
37 | 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 | |
38 | 1999 | Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Journal of Combinatorial Optimization | 23 | 19 | |
39 | 1999 | Constructing light spanning trees with small routing cost | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Lecture Notes in Computer Science | |||
40 | 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 | |||
41 | 1998 | Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Lecture Notes in Computer Science | |||
42 | 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 | |||
43 | 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 | |||
44 | 1995 | Linear-space algorithms that build local alignments from fragments | Chao, K.-M.; Miller, W.; KUN-MA0 CHAO | Algorithmica | 23 | 18 | |
45 | 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 | |
46 | 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 | |
47 | 1993 | Constrained sequence alignment | Chao, K.-M.; Hardison, R.C.; Miller, W.; KUN-MA0 CHAO | Bulletin of Mathematical Biology | 18 | 15 | |
48 | 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 |