|
English
|
正體中文
|
简体中文
|
总笔数 :0
|
|
造访人次 :
52836445
在线人数 :
774
教育部委托研究计画 计画执行:国立台湾大学图书馆
|
|
|
"kun ma0 chao"的相关文件
显示项目 91-100 / 144 (共15页)
<< < 5 6 7 8 9 10 11 12 13 14 > >>
每页显示[10|25|50]项目
| 臺大學術典藏 |
2018-09-10T06:26:56Z |
On the range maximum-sum segment query problem
|
Chen, K.-Y.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T06:26:56Z |
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 |
| 臺大學術典藏 |
2018-09-10T05:55:01Z |
Improved algorithms for the k maximum-sums problems
|
KUN-MA0 CHAO; Chao, K.-M.; Tien, W.-C.; Chen, K.-Y.; Cheng, C.-H. |
| 臺大學術典藏 |
2018-09-10T05:55:01Z |
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 |
| 臺大學術典藏 |
2018-09-10T05:55:01Z |
A greedier approach for finding tag SNPs
|
Chang, C.-J.; Huang, Y.-T.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T05:55:00Z |
On locating disjoint segments with maximum sum of densities
|
Liu, H.-F.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T05:20:02Z |
A local alignment tool for very long DNA sequences
|
Chao, K.-M.; Zhang, J.; Ostell, J.; Miller, W.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T05:20:01Z |
Finding a length-constrained maximum-density path in a tree
|
Lin, R.-R.; Kuo, W.-H.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T05:20:01Z |
Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint
|
Chen, K.-Y.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T05:20:01Z |
Approximation algorithms for the optimization problems of SNPs and haplotypes
|
Huang, Yao-Ting; Chao, Kun-Mao; KUN-MA0 CHAO |
显示项目 91-100 / 144 (共15页)
<< < 5 6 7 8 9 10 11 12 13 14 > >>
每页显示[10|25|50]项目
|
