|
English
|
正體中文
|
简体中文
|
总笔数 :0
|
|
造访人次 :
52835550
在线人数 :
757
教育部委托研究计画 计画执行:国立台湾大学图书馆
|
|
|
"kun ma0 chao"的相关文件
显示项目 61-70 / 144 (共15页)
<< < 2 3 4 5 6 7 8 9 10 11 > >>
每页显示[10|25|50]项目
| 臺大學術典藏 |
2018-09-10T08:11:52Z |
A fully compressed algorithm for computing the edit distance of run-length encoded strings
|
Chen, K.-Y.;Chao, K.-M.; Chen, K.-Y.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T08:11:51Z |
Identifying approximate palindromes in run-length encoded strings
|
Chen, K.-Y.;Hsu, P.-H.;Chao, K.-M.; Chen, K.-Y.; Hsu, P.-H.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T07:33:32Z |
Sequence Comparison: Theory and Methods
|
KUN-MA0 CHAO; KUN-MA0 CHAO; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T07:33:32Z |
Sequence Comparison: Theory and Methods
|
KUN-MA0 CHAO; KUN-MA0 CHAO; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T07:33:32Z |
Sequence Comparison: Theory and Methods
|
KUN-MA0 CHAO; KUN-MA0 CHAO; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T07:32:42Z |
Approximate matching for run-length encoded strings is 3sum-hard
|
Chen, K.-Y.;Hsu, P.-H.;Chao, K.-M.; Chen, K.-Y.; Hsu, P.-H.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T07:32:42Z |
Constructing light spanning trees with small routing cost
|
Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T07:32:42Z |
Calign: Aligning sequences with restricted affine gap penalties
|
Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T07:32:42Z |
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices
|
Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T07:32:42Z |
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 |
显示项目 61-70 / 144 (共15页)
<< < 2 3 4 5 6 7 8 9 10 11 > >>
每页显示[10|25|50]项目
|
