|
"kun ma0 chao"的相关文件
显示项目 51-75 / 144 (共6页)
<< < 1 2 3 4 5 6 > >>
每页显示[10|25|50]项目
| 臺大學術典藏 |
2018-09-10T08:38:42Z |
Influence of pressure control levels on the pulse pressure variations: An animal study using healthy piglets
|
Lee, C.-H.;Wu, Y.-K.;Wang, J.-Y.;Lan, C.-C.;Lee, C.-Y.;Hsu, K.-Y.;Chao, K.-M.;Chang, H.; Lee, C.-H.; Wu, Y.-K.; Wang, J.-Y.; Lan, C.-C.; Lee, C.-Y.; Hsu, K.-Y.; Chao, K.-M.; Chang, H.; JANN-YUAN WANG; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T08:38:42Z |
Improving the performance of identifying contributors for XML keyword search
|
Lin, R.-R.; Chang, Y.-H.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T08:38:42Z |
Identifying relevant matches with NOT semantics over XML documents
|
Lin, R.-R.;Chang, Y.-H.;Chao, K.-M.; Lin, R.-R.; Chang, Y.-H.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T08:38:42Z |
Minkowski sum selection and finding
|
Luo, C.-W.;Liu, H.-F.;Chen, P.-A.;Chao, K.-M.; Luo, C.-W.; Liu, H.-F.; Chen, P.-A.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T08:38:41Z |
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.; Huang, Y.-T.; Chang, C.-J.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T08:38:41Z |
On the generalized constrained longest common subsequence problems
|
Chen, Y.-C.;Chao, K.-M.; Chen, Y.-C.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T08:11:52Z |
Hardness of comparing two 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-10T08:11:52Z |
Finding all approximate gapped palindromes
|
Hsu, P.-H.; Chen, K.-Y.; Chao, K.-M.; Hsu, P.-H.; Chen, K.-Y.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T08:11:52Z |
Faster algorithms for searching relevant matches in XML databases
|
Lin, R.-R.;Chang, Y.-H.;Chao, K.-M.; Lin, R.-R.; Chang, Y.-H.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T08:11:52Z |
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.; Chu, A.-C.; Wu, B.Y.; Wang, H.-L.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
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 |
| 臺大學術典藏 |
2018-09-10T07:32:41Z |
The backup 2-center and backup 2-median problems on trees
|
Wang, Hung-Lung;Wu, Bang Ye;Chao, Kun-Mao; Wang, Hung-Lung; Wu, Bang Ye; Chao, Kun-Mao; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T07:32:41Z |
Securing information display for multiple secrets
|
Shyu, S.J.;Chen, M.-C.;Chao, K.-M.; Shyu, S.J.; Chen, M.-C.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T07:32:41Z |
On locating disjoint segments with maximum sum of densities
|
Liu, H.-F.;Chao, K.-M.; Liu, H.-F.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T07:32:41Z |
Finding All sorting tandem duplication random loss operations
|
Bernt, M.;Chen, M.-C.;Merkle, D.;Wang, H.-L.;Chao, K.-M.;Middendorf, M.; Bernt, M.; Chen, M.-C.; Merkle, D.; Wang, H.-L.; Chao, K.-M.; Middendorf, M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T07:32:41Z |
Finding all approximate gapped palindromes
|
Hsu, P.-H.;Chen, K.-Y.;Chao, K.-M.; Hsu, P.-H.; Chen, K.-Y.; Chao, K.-M.; KUN-MA0 CHAO |
显示项目 51-75 / 144 (共6页)
<< < 1 2 3 4 5 6 > >>
每页显示[10|25|50]项目
|
