第 1 到 11 筆結果,共 11 筆。
公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 | |
---|---|---|---|---|---|---|---|
1 | 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 | |||
2 | 2009 | Sequence Comparison: Theory and Methods | KUN-MA0 CHAO | ||||
3 | 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 | |||
4 | 2004, 2005, 2006, 2008 | 計算機概論 | 趙坤茂 ; 張雅惠; 黃寶萱 | 全華科技圖書公司 | |||
5 | 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 | |||
6 | 2004 | Spanning Trees and Optimization Problems | KUN-MA0 CHAO | ||||
7 | 2004 | On the range maximum-sum segment query problem | Chen, K.-Y.; Chao, K.-M.; KUN-MA0 CHAO | Lecture Notes in Computer Science | |||
8 | 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 | |||
9 | 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 | |||
10 | 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 | |||
11 | 1997 | Fast algorithms for aligning sequences with restricted affine gap penalties | Chao, K.-M.; KUN-MA0 CHAO | Lecture Notes in Computer Science |