|
English
|
正體中文
|
简体中文
|
总笔数 :0
|
|
造访人次 :
52905807
在线人数 :
1007
教育部委托研究计画 计画执行:国立台湾大学图书馆
|
|
|
"kun ma0 chao"的相关文件
显示项目 96-105 / 144 (共15页)
<< < 5 6 7 8 9 10 11 12 13 14 > >>
每页显示[10|25|50]项目
| 臺大學術典藏 |
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 |
| 臺大學術典藏 |
2018-09-10T05:20:01Z |
An approximation algorithm for haplotype interence by maximum parsimony
|
Huang, Y.-T.; Chao, K.-M.; Chen, T.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T05:20:01Z |
An approximation algorithm for haplotype inference by maximum parsimony
|
Huang, Y.-T.; Chao, K.-M.; Chen, T.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T05:20:01Z |
A fast algorithm for computing a longest common increasing subsequence
|
Yang, I.-H.; Huang, C.-P.; Chao, K.-M; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T05:20:01Z |
Linear-space algorithms that build local alignments from fragments
|
Chao, K.-M.;Miller, W.; Chao, K.-M.; Miller, W.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T05:20:00Z |
Selecting additional tag SNPs for tolerating missing data in genotyping
|
Huang, Y.-T.;Zhang, K.;Chen, T.;Chao, K.-M.; Huang, Y.-T.; Zhang, K.; Chen, T.; Chao, K.-M.; KUN-MA0 CHAO |
显示项目 96-105 / 144 (共15页)
<< < 5 6 7 8 9 10 11 12 13 14 > >>
每页显示[10|25|50]项目
|
