| 臺大學術典藏 |
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 |
| 臺大學術典藏 |
2018-09-10T07:32:41Z |
Optimal algorithms for the average-constrained maximum-sum segment problem
|
Cheng, C.-H.;Liu, H.-F.;Chao, K.-M.; Cheng, C.-H.; Liu, H.-F.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T06:59:56Z |
Approximation algorithms for some optimum communication spanning tree problems
|
Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T06:59:55Z |
Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence
|
Liu, Hsiao-Fei; Chao, Kun-Mao; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T06:59:55Z |
A new framework for the selection of tag SNPs by multimarker haplotypes
|
Huang, Yao-Ting; Chao, Kun-Mao; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T06:59:55Z |
The NPO-completeness of the longest Hamiltonian cycle problem
|
Wu, Q.S.; Chao, K.M.; Lee, R.C.T.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T06:59:55Z |
Polynomial time approximation scheme for minimum routing cost spanning trees
|
Wu, Bang Ye; Lancia, Giuseppe; Bafna, Vineet; Chao, Kun-Mao; Ravi, R.; Tang, Chuan Yi; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T06:59:55Z |
On computing all suboptimal alignments
|
Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T06:59:55Z |
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-10T06:59:54Z |
The 2-radius and 2-radiian problems on trees
|
Wang, H.-L.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T06:59:54Z |
Minkowski sum selection and finding
|
Luo, C.-W.; Liu, H.-F.; Chen, P.-A.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T06:59:54Z |
CNVDetector: Locating copy number variations using array CGH data
|
Chen, Peng-An; Liu, Hsiao-Fei; Chao, Kun-Mao; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T06:59:53Z |
The swap edges of a multiple-sources routing tree
|
Wu, B.Y.,; Hsiao, C.Y.,; Chao, K.-M.; KUN-MA0 CHAO; Wang, Tyng-Guey |
| 臺大學術典藏 |
2018-09-10T06:26:57Z |
A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering
|
Liu, H.-F.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T06:26:57Z |
Fast algorithms for aligning sequences with restricted affine gap penalties
|
Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T06:26:56Z |
On the uniform edge-partition of a tree
|
Wu, B.Y.; Wang, H.-L.; Ta Kuan, S.T.; Chao, K.-M.; KUN-MA0 CHAO |
