English  |  正體中文  |  简体中文  |  Total items :0  
Visitors :  52777075    Online Users :  592
Project Commissioned by the Ministry of Education
Project Executed by National Taiwan University Library
 
臺灣學術機構典藏系統 (Taiwan Academic Institutional Repository, TAIR)
About TAIR

Browse By

News

Copyright

Related Links

"kun ma0 chao"

Return to Browse by Author
Sorting by Title Sort by Date

Showing items 81-90 of 144  (15 Page(s) Totally)
<< < 4 5 6 7 8 9 10 11 12 13 > >>
View [10|25|50] records per page

Institution Date Title Author
臺大學術典藏 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

Showing items 81-90 of 144  (15 Page(s) Totally)
<< < 4 5 6 7 8 9 10 11 12 13 > >>
View [10|25|50] records per page