|
"kun ma0 chao"的相关文件
显示项目 111-135 / 144 (共6页) << < 1 2 3 4 5 6 > >> 每页显示[10|25|50]项目
臺大學術典藏 |
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. |
臺大學術典藏 |
2018-09-10T03:27:59Z |
Approximation algorithms for some optimum communication spanning tree problems
|
Wu, B.Y.; Chao, K.-M.; Tang, C.Y.; KUN-MA0 CHAO |
臺大學術典藏 |
2016 |
SMART: Statistical Metabolomics Analysis - An R Tool
|
Liang, Y.-J.; Lin, Y.-T.; Chen, C.-W.; Lin, C.-W.; Chao, K.-M.; Pan, W.-H.; Yang, H.-C.; KUN-MA0 CHAO |
臺大學術典藏 |
2016 |
Computing the line-constrained k-center in the plane for small k
|
KUN-MA0 CHAO; Huang, A.J.-H.; Wang, H.-L.; Chao, K.-M. |
臺大學術典藏 |
2014 |
The generalized popular condensation problem
|
KUN-MA0 CHAO; Chao, K.-M.; Wu, Y.-W.;Lin, W.-Y.;Wang, H.-L.;Chao, K.-M.; Wu, Y.-W.; Lin, W.-Y.; Wang, H.-L. |
臺大學術典藏 |
2013 |
A compact and efficient labeling scheme for XML documents
|
KUN-MA0 CHAO; Chao, K.-M.; Chang, Y.-H.; Lin, R.-R.; Lin, R.-R.;Chang, Y.-H.;Chao, K.-M. |
臺大學術典藏 |
2013 |
An optimal algorithm for the popular condensation problem
|
Wu, Y.-W.;Lin, W.-Y.;Wang, H.-L.;Chao, K.-M.; Wu, Y.-W.; Lin, W.-Y.; Wang, H.-L.; Chao, K.-M.; KUN-MA0 CHAO |
臺大學術典藏 |
2012 |
Preserving inversion phylogeny reconstruction
|
Tannier, E.; KUN-MA0 CHAO; Middendorf, M.; Kao, J.-W.; Bernt, M.; Chao, K.-M. |
臺大學術典藏 |
2011 |
Improving the performance of identifying contributors for XML keyword search
|
KUN-MA0 CHAO; Chao, K.-M.; Lin, R.-R.;Chang, Y.-H.;Chao, K.-M.; Lin, R.-R.; Chang, Y.-H. |
臺大學術典藏 |
2010 |
Finding all approximate gapped palindromes
|
KUN-MA0 CHAO; Hsu, P.-H.;Chen, K.-Y.;Chao, K.-M.; Hsu, P.-H.; Chen, K.-Y.; Chao, K.-M. |
臺大學術典藏 |
2010 |
Faster algorithms for searching relevant matches in XML databases
|
Chao, K.-M.; Chang, Y.-H.; Lin, R.-R.;Chang, Y.-H.;Chao, K.-M.; Lin, R.-R.; KUN-MA0 CHAO |
显示项目 111-135 / 144 (共6页) << < 1 2 3 4 5 6 > >> 每页显示[10|25|50]项目
|