| 臺大學術典藏 |
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 |
| 臺大學術典藏 |
2018-09-10T06:26:56Z |
On the range maximum-sum segment query problem
|
Chen, K.-Y.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T06:26:56Z |
Algorithms for computing the length-constrained max-score segments with applications to DNA copy number data analysis
|
Liu, H.-F.; Chen, P.-A.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T05:55:01Z |
Improved algorithms for the k maximum-sums problems
|
KUN-MA0 CHAO; Chao, K.-M.; Tien, W.-C.; Chen, K.-Y.; Cheng, C.-H. |
| 臺大學術典藏 |
2018-09-10T05:55:01Z |
Distant HNF1 site as a master control for the human class I alcohol dehydrogenase gene expression
|
Su, J.-S.; Tsai, T.-F.; Chang, H.-M.; Chao, K.-M.; Su, T.-S.; Tsai, S.-F.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T05:55:01Z |
A greedier approach for finding tag SNPs
|
Chang, C.-J.; Huang, Y.-T.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
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 |
