| 臺大學術典藏 |
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 |
| 臺大學術典藏 |
2018-09-10T04:50:59Z |
Approximation algorithms for the selection of robust tag SNPs
|
Huang, Y.-T.; Zhang, K.; Chen, T.; Chao, K.-M.; Huang, Y.-T.; Zhang, K.; Chen, T.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T04:50:59Z |
An optimal algorithm for querying tree structures and its applications in bioinformatics
|
Liu, H.-F.; Chang, Y.-H.; Chao, K.-M.; Liu, H.-F.; Chang, Y.-H.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T04:50:59Z |
Recent developments in linear-space alignment methods: a survey.
|
Chao, K.M.;Hardison, R.C.;Miller, W.; Chao, K.M.; Hardison, R.C.; Miller, W.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T04:50:59Z |
Globin Gene Server: A Prototype E-Mail Database Server Featuring Extensive Multiple Alignments and Data Compilation for Electronic Genetic Analysis
|
Hardison, R.; Chao, K.-M.; Schwartz, S.; Stojanovic, N.; Ganetsky, M.; Miller, W.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T04:50:58Z |
On the range maximum-sum segment query problem
|
Chen, K.-Y.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T04:50:58Z |
Efficient methods for generating optimal single and multiple spaced seeds
|
Yang, I.-H.; Wang, S.-H.; Chen, Y.-H.; Huang, P.-H.; Ye, L.; Huang, X.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T04:30:44Z |
Positive and negative regulatory elements of the rabbit embryonic εglobin gene revealed by an improved multiple alignment program and functional analysis
|
Hardison, R.; Chao, K.-M.; Adamkiewicz, M.; Price, D.; Jackson, J.; Zeigler, T.; Stojanovic, N.; Miller, W.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T04:30:44Z |
Locating well-conserved regions within a pairwise alignment
|
Chao, K.M.; Hardison, R.C.; Miller, W.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T04:30:44Z |
Constrained sequence alignment
|
Chao, K.-M.;Hardison, R.C.;Miller, W.; Chao, K.-M.; Hardison, R.C.; Miller, W.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T04:30:43Z |
MAVG: Locating non-overlaping maximum average segments in a given sequence
|
Lin, Y.-L.; Huang, X.; Jiang, T.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T04:30:43Z |
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
|
Lin, Y.-L.; Jiang, T.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T04:30:43Z |
A generalized global alignment algorithm
|
Huang, X.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T04:30:43Z |
Finding a length-constrained maximum-density path in a tree
|
Lin, R.-R.; Kuo, W.-H.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T04:10:46Z |
Light Graphs with Small Routing Cost
|
Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T04:10:46Z |
Efficient algorithms for locating the length-constrained heaviest segments, with applications to biomolecular sequence analysis
|
Lin, Y.-L.; Jiang, T.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T04:10:46Z |
Aligning two sequences within a specified diagonal band
|
Chao, K.-M.; Pearson, W.R.; Miller, W.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T03:28:00Z |
A polynomial-time approximation scheme for minimum routing cost spanning trees
|
Wu, B.Y.; Lancia, G.; Bafna, V.; Chao, K.-M.; Ravi, R.; Tang, C.Y.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T03:28:00Z |
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
|
Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T03:28:00Z |
A linear time algorithm for the Hamiltonian path problem on a series-parallel graph
|
Wu, Q.S.; Lee, R.C.T.; Chao, K.M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T03:27:59Z |
Approximation algorithms for the shortest total path length spanning tree problem
|
KUN-MA0 CHAO; Tang, C.Y.; Chao, K.-M.; Wu, B.Y. |
