第 1 到 129 筆結果,共 129 筆。
公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 | |
---|---|---|---|---|---|---|---|
1 | 2022 | Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection | Chen, Min Jen; KUN-MAO CHAO | Discrete Applied Mathematics | 1 | 1 | |
2 | 2021 | Strontium ranelate-laden near-infrared photothermal-inspired methylcellulose hydrogel for arthritis treatment | Chiang C.-W; Hsiao Y.-C; Jheng P.-R; Chen C.-H; Manga Y.B; Lekha R; KUN-MAO CHAO ; Ho Y.-C; Chuang E.-Y. | Materials Science and Engineering C | 25 | 23 | |
3 | 2021 | Facilitated and controlled strontium ranelate delivery using gcs-ha nanocarriers embedded into pegda coupled with decortication driven spinal regeneration | Chiang C.-W; Chen C.-H; Manga Y.B; Huang S.-C; Chao K.-M; Jheng P.-R; Wong P.-C; Nyambat B; Satapathy M.K; Chuang E.-Y.; KUN-MA0 CHAO | International Journal of Nanomedicine | 10 | ||
4 | 2020 | On the influenza vaccination policy through mathematical modeling | Ho, B.-S.; KUN-MAO CHAO | International Journal of Infectious Diseases | 4 | 3 | |
5 | 2017 | Data-driven interdisciplinary mathematical modelling quantitatively unveils competition dynamics of co-circulating influenza strains | Ho, B.-S.; KUN-MA0 CHAO | Journal of Translational Medicine | |||
6 | 2016 | Computing the line-constrained k-center in the plane for small k | Huang, A.J.-H.; Wang, H.-L.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |||
7 | 2016 | A Takagi-Sugeno fuzzy neural network-based algorithm with single-channel EEG signal for the discrimination between light and deep sleep stages | Tsai, T.-H.; Kau, L.-J.; KUN-MA0 CHAO | Proceedings - 2016 IEEE Biomedical Circuits and Systems Conference, BioCAS 2016 | |||
8 | 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 | |||
9 | 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 | |||
10 | 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 | |
11 | 2014 | Preface Algorithms and Computation (ISAAC 2012) | KUN-MA0 CHAO ; Hsu, T.-S.; DT Lee | Algorithmica | 0 | 0 | |
12 | 2014 | A fault-tolerant method for HLA typing with PacBio data | Chang, Chia-Jung; PEI-LUNG CHEN ; WEI-SHIUNG YANG ; KUN-MAO CHAO | BMC Bioinformatics | 12 | 12 | |
13 | 2014 | Algorithms and Computation (ISAAC 2012) | Chao, K.-M.; Hsu, T.-S.; KUN-MA0 CHAO | Theoretical Computer Science | 0 | 0 | |
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 | |||
15 | 2014 | The Generalized Popular Condensation Problem | Wu, Y.-W.; Lin, W.-Y.; Wang, H.-L.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |||
16 | 2014 | The generalized popular condensation problem | Wu, Y.-W.; Lin, W.-Y.; Wang, H.-L.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |||
17 | 2013 | Guest editors' foreword | Chao, K.-M.; Hsu, T.-S.; KUN-MA0 CHAO | International Journal of Computational Geometry and Applications | 0 | 0 | |
18 | 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 | |
19 | 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 | |
20 | 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 | |
21 | 2013 | An optimal algorithm for the popular condensation problem | Wu, Y.-W.; Lin, W.-Y.; Wang, H.-L.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |||
22 | 2013 | A compact and efficient labeling scheme for XML documents | Lin, R.-R.; Chang, Y.-H.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |||
23 | 2013 | Computing plurality points and condorcet points in Euclidean space | Wu, Y.-W.; Lin, W.-Y.; Wang, H.-L.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |||
24 | 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 | |
25 | 2012 | Efficient algorithms for local ranking | Chang, C.-J.; Chao, K.-M.; KUN-MA0 CHAO | Information Processing Letters | 1 | 1 | |
26 | 2012 | Asymptotic limits of a new type of maximization recurrence with an application to bioinformatics | KUN-MAO CHAO ; Chu, A.-C.; Jansson, J.; Lemence, R.S.; Mancheron, A. | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 0 | 0 | |
27 | 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) | |||
28 | 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) | |||
29 | 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 | |
30 | 2011 | On the generalized constrained longest common subsequence problems | Chen, Y.-C.; Chao, K.-M.; KUN-MA0 CHAO | Journal of Combinatorial Optimization | 56 | 43 | |
31 | 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 | |
32 | 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 | |
33 | 2011 | Improving the performance of identifying contributors for XML keyword search | Lin, R.-R.; Chang, Y.-H.; KUN-MA0 CHAO | SIGMOD Record | 7 | 9 | |
34 | 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 | |
35 | 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 | |
36 | 2011 | Identifying relevant matches with NOT semantics over XML documents | Lin, R.-R.; Chang, Y.-H.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |||
37 | 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 | |
38 | 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 | |
39 | 2010 | Finding all approximate gapped palindromes | Hsu, P.-H.; Chen, K.-Y.; KUN-MA0 CHAO | International Journal of Foundations of Computer Science | 10 | 9 | |
40 | 2010 | Faster algorithms for searching relevant matches in XML databases | Lin, R.-R.; Chang, Y.-H.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |||
41 | 2010 | Identifying approximate palindromes in run-length encoded strings | Chen, K.-Y.; Hsu, P.-H.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |||
42 | 2010 | A fully compressed algorithm for computing the edit distance of run-length encoded strings | Chen, K.-Y.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |||
43 | 2009 | Sequence Comparison: Theory and Methods | KUN-MA0 CHAO | ||||
44 | 2009 | Optimal algorithms for the average-constrained maximum-sum segment problem | Cheng, C.-H.; Liu, H.-F.; KUN-MAO CHAO | Information Processing Letters | 3 | 3 | |
45 | 2009 | Securing information display for multiple secrets | Shyu, S.J.; Chen, M.-C.; Chao, K.-M.; KUN-MA0 CHAO | Optical Engineering | 3 | 2 | |
46 | 2009 | The backup 2-center and backup 2-median problems on trees | Wang, Hung-Lung; Wu, Bang Ye; Chao, Kun-Mao; KUN-MA0 CHAO | Networks | 10 | 10 | |
47 | 2009 | On locating disjoint segments with maximum sum of densities | Liu, Hsiao-Fei; KUN-MAO CHAO | Algorithmica (New York) | 0 | 0 | |
48 | 2009 | Approximate matching for run-length encoded strings is 3sum-hard | Chen, K.-Y.; Hsu, P.-H.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |||
49 | 2009 | Finding all approximate gapped palindromes | Hsu, P.-H.; Chen, K.-Y.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |||
50 | 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) | |||
51 | 2008 | 數列分析演算法及其在基因組序列分析上的應用 (新制多年期第2年) | 趙坤茂 | ||||
52 | 2008 | 單一核甘酸多型資訊運用的演算法設計(3/3) | 趙坤茂 | ||||
53 | 2008 | 數列分析演算法及其在基因組序列分析上的應用 (新制多年期第1年) | 趙坤茂 | ||||
54 | 2008 | The swap edges of a multiple-sources routing tree | Wu, B.Y.; Hsiao, C.Y.; KUN-MAO CHAO | Algorithmica (New York) | 19 | 13 | |
55 | 2008 | PhosphoPOINT: A comprehensive human kinase interactome and phospho-protein database | Yang, C.-Y. et al.; Chang, C.-H.; Yu, Y.-L.; Lin, T.-C.E.; Lee, S.-A.; Yen, C.-C.; Yang, J.-M.; Lai, J.-M.; Hong, Y.-R.; Tseng, T.-L.; KUN-MA0 CHAO ; Huang, Chi-Ying F. | Bioinformatics | 77 | 74 | |
56 | 2008 | Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence | Liu, Hsiao-Fei; KUN-MAO CHAO | Theoretical Computer Science | 9 | 6 | |
57 | 2008 | The 2-radius and 2-radiian problems on trees | Wang, Hung-Lung; KUN-MAO CHAO | Theoretical Computer Science | 0 | ||
58 | 2008 | CNVDetector: Locating copy number variations using array CGH data | Chen, Peng-An; Liu, Hsiao-Fei; KUN-MAO CHAO | Bioinformatics | 11 | 10 | |
59 | 2008 | A new framework for the selection of tag SNPs by multimarker haplotypes | Huang, Yao-Ting; KUN-MAO CHAO | Journal of Biomedical Informatics | 5 | 6 | |
60 | 2008 | Minkowski sum selection and finding | Luo, C.-W.; Liu, H.-F.; Chen, P.-A.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |||
61 | 2007 | 單一核?酸多型資訊運用的演算法設計(2/3) | 趙坤茂 | ||||
62 | 2007 | On the range maximum-sum segment query problem | Chen, K.-Y.; Chao, K.-M.; KUN-MA0 CHAO | Discrete Applied Mathematics | 14 | 11 | |
63 | 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 | |||
64 | 2007 | A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering | Liu, Hsiao-Fei; KUN-MAO CHAO | Theoretical Computer Science | 9 | 6 | |
65 | 2007 | On the uniform edge-partition of a tree | Wu, Bang Ye; Wang, Hung-Lung; Ta Kuan, Shih; KUN-MAO CHAO | Discrete Applied Mathematics | 9 | ||
66 | 2007 | Optimum communication spanning trees | Wu, B.Y.; Tang, C.Y.; KUN-MA0 CHAO | Handbook of Approximation Algorithms and Metaheuristics | |||
67 | 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 | |
68 | 2006 | On Locating Disjoint Segments with Maximum Sum of Densities | Hsiao-Fei Liu; KUN-MAO CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 0 | ||
69 | 2006 | A greedier approach for finding tag SNPs | Chang, C.-J.; Huang, Y.-T.; Chao, K.-M.; KUN-MA0 CHAO | Bioinformatics | 25 | 22 | |
70 | 2006 | Heaviest Segments in a Number Sequence | Chao, Kun-Mao; 趙坤茂 | ||||
71 | 2006 | Counting Spanning Trees | Chao, Kun-Mao; 趙坤茂 | ||||
72 | 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 | |
73 | 2005 | A fast algorithm for computing a longest common increasing subsequence | Yang, I.-H.; Huang, C.-P.; KUN-MAO CHAO | Information Processing Letters | 43 | 35 | |
74 | 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 | |||
75 | 2005 | Dynamic Programming | Chao, Kun-Mao; 趙坤茂 | ||||
76 | 2005 | Minimum Routing Cost Spanning Trees | Chao, Kun-Mao; 趙坤茂 | ||||
77 | 2005 | Fast Local Alignment Methods | Chao, Kun-Mao; 趙坤茂 | ||||
78 | 2005 | Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint | Chen, K.-Y.; KUN-MAO CHAO | Information Processing Letters | 16 | 15 | |
79 | 2005 | Finding a length-constrained maximum-density path in a tree | Lin, Rung-Ren; Kuo, Wen-Hsiung; KUN-MAO CHAO | Journal of Combinatorial Optimization | 11 | ||
80 | 2005 | Approximation algorithms for the optimization problems of SNPs and haplotypes | Huang, Yao-Ting; KUN-MAO CHAO | Emerging Information Technology Conference 2005 | 0 | 0 | |
81 | 2005 | An approximation algorithm for haplotype inference by maximum parsimony | Huang, Y.-T.; KUN-MAO CHAO ; Chen, T. | Journal of Computational Biology | 33 | 32 | |
82 | 2005 | 比較相似度間間斷斷序列的動態規劃演算法(2/3) | 趙坤茂 | ||||
83 | 2005 | Selecting additional tag SNPs for tolerating missing data in genotyping | Huang, Yao-Ting; Zhang, Kui; Chen, Ting; KUN-MAO CHAO | BMC Bioinformatics | 18 | 17 | |
84 | 2005 | Improved algorithms for the k maximum-sums problems | Cheng, C.-H.; Chen, K.-Y.; Tien, W.-C.; KUN-MA0 CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |||
85 | 2004, 2005, 2006, 2008 | 計算機概論 | 趙坤茂 ; 張雅惠; 黃寶萱 | 全華科技圖書公司 | |||
86 | 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 | |||
87 | 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 | |
88 | 2004 | An optimal algorithm for querying tree structures and its applications in bioinformatics | Liu, Hsiao-Fei; Chang, Ya-Hui; KUN-MAO CHAO | SIGMOD Record | 1 | 0 | |
89 | 2004 | On the range maximum-sum segment query problem | Chen, K.-Y.; Chao, K.-M.; KUN-MA0 CHAO | Lecture Notes in Computer Science | |||
90 | 2004 | Spanning Trees and Optimization Problems | KUN-MA0 CHAO | ||||
91 | 2004 | 比較相似度間間斷斷序列的動態規劃演算法(1/3) | 趙坤茂 | ||||
92 | 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 | |||
93 | 2004 | 在序列、樹狀結構及更高維物件中找尋最高密度區域的快速演算法 | 趙坤茂 | ||||
94 | 2003 | Constrained multiple sequence alignment tool development and its application to RNase family alignment | Tang, Chuan Yi; Lu, Chin Lung; Chang, Margaret Dah-Tsyr; Tsai, Yin-Te; Sun, Yuh-Ju; KUN-MAO CHAO ; Chang, Jia-Ming; Chiou, Yu-Han; Wu, Chia-Mao; Chang, Hao-Teng; Chou, Wei-I | Journal of bioinformatics and computational biology | 41 | 0 | |
95 | 2003 | Finding a length-constrained maximum-density path in a tree | Lin, Rung-Ren; Kuo, Wen-Hsiung; KUN-MAO CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 0 | 0 | |
96 | 2003 | 多重基因組序列的快速排比方法(3/3) | 趙坤茂 | ||||
97 | 2003 | A generalized global alignment algorithm | Huang, X.; Chao, K.-M.; KUN-MA0 CHAO | Bioinformatics | 65 | 51 | |
98 | 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 | |
99 | 2002 | Efficient algorithms for locating the length-constrained heaviest segments, with applications to biomolecular sequence analysis | Lin, Yaw-Ling; Jiang, Tao; KUN-MAO CHAO | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 9 | ||
100 | 2002 | Dynamic-Programming Strategies for Analyzing Biomolecular Sequences | Chao, Kun-Mao; 趙坤茂 | ||||
101 | 2002 | Light Graphs with Small Routing Cost | Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO | Networks | 28 | 22 | |
102 | 2002 | Constrained multiple sequence alignment tool development and its application to RNase family alignment. | Tang, Chuan Yi; Lu, Chin Lung; Chang M.D.-T.; Tsai, Yin-Te; Sun, Yuh-Ju; KUN-MAO CHAO ; Chang, Jia-Ming; Chiou, Yu-Han; Wu, Chia-Mao; Chang, Hao-Teng; Chou, Wei-I. | Proceedings - IEEE Computer Society Bioinformatics Conference, CSB 2002 | 16 | 0 | |
103 | 2002 | Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis | Lin, Yaw-Ling; Jiang, Tao; KUN-MAO CHAO | Journal of Computer and System Sciences | 69 | 58 | |
104 | 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 | |||
105 | 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 | |||
106 | 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 | |||
107 | 2000 | A linear time algorithm for the Hamiltonian path problem on a series-parallel graph | Wu, Q.S.; Lee, R.C.T.; Chao, K.M.; KUN-MA0 CHAO | Joint Conference on Information Sciences | |||
108 | 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 | |
109 | 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 | |
110 | 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 | |||
111 | 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 | |||
112 | 1999 | Calign: Aligning sequences with restricted affine gap penalties | KUN-MA0 CHAO | Bioinformatics | |||
113 | 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 | |||
114 | 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 | |||
115 | 1998 | The NPO-completeness of the longest Hamiltonian cycle problem | Wu, Q.S.; Chao, K.M.; Lee, R.C.T.; KUN-MA0 CHAO | Information Processing Letters | 1 | 1 | |
116 | 1998 | Polynomial time approximation scheme for minimum routing cost spanning trees | Wu, Bang Ye; Lancia, Giuseppe; Bafna, Vineet; Chao, Kun-Mao; Ravi, R.; Tang, Chuan Yi; KUN-MA0 CHAO | Annual ACM-SIAM Symposium on Discrete Algorithms | |||
117 | 1998 | On computing all suboptimal alignments | KUN-MA0 CHAO | Information Sciences | |||
118 | 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 | |||
119 | 1997 | Fast algorithms for aligning sequences with restricted affine gap penalties | KUN-MA0 CHAO | Lecture Notes in Computer Science | |||
120 | 1995 | Linear-space algorithms that build local alignments from fragments | Chao, K.-M.; Miller, W.; KUN-MA0 CHAO | Algorithmica | 23 | 18 | |
121 | 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 | |
122 | 1994 | Recent developments in linear-space alignment methods: a survey. | Chao, K.M.; Hardison, R.C.; Miller, W.; KUN-MA0 CHAO | Journal of computational biology : a journal of computational molecular cell biology | 43 | 0 | |
123 | 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 | |
124 | 1993 | Constrained sequence alignment | Chao, K.-M.; Hardison, R.C.; Miller, W.; KUN-MA0 CHAO | Bulletin of Mathematical Biology | 18 | 15 | |
125 | 1993 | Positive and negative regulatory elements of the rabbit embryonic εglobin gene revealed by an improved multiple alignment program and functional analysis | Hardison, R.; KUN-MAO CHAO ; Adamkiewicz, M.; Price, D.; Jackson, J.; Zeigler, T.; Stojanovic, N.; Miller, W. | Mitochondrial DNA | 24 | 19 | |
126 | 1993 | Locating well-conserved regions within a pairwise alignment | KUN-MAO CHAO ; Hardison, R.C.; Miller, W. | Bioinformatics | 32 | 23 | |
127 | 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 | |
128 | - | Minimum Spanning Trees | Chao, Kun-Mao; 趙坤茂 | ||||
129 | - | Sequence Alignment | Chao, Kun-Mao; 趙坤茂 |