|
|
Taiwan Academic Institutional Repository >
Browse by Author
|
"kun ma0 chao"
Showing items 56-65 of 144 (15 Page(s) Totally)
<< < 1 2 3 4 5 6 7 8 9 10 > >>
View [10|25|50] records per page
| 臺大學術典藏 |
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 |
Showing items 56-65 of 144 (15 Page(s) Totally)
<< < 1 2 3 4 5 6 7 8 9 10 > >>
View [10|25|50] records per page
|
