公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
---|---|---|---|---|---|---|
2008 | 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; KUN-MAO CHAO | Theoretical Computer Science | 9 | 6 | |
2008 | CNVDetector: Locating copy number variations using array CGH data | Chen, Peng-An; Liu, Hsiao-Fei; KUN-MAO CHAO | Bioinformatics | 11 | 10 | |
2009 | On locating disjoint segments with maximum sum of densities | Liu, Hsiao-Fei; KUN-MAO CHAO | Algorithmica (New York) | 0 | 0 | |
2004 | An optimal algorithm for querying tree structures and its applications in bioinformatics | Liu, Hsiao-Fei; Chang, Ya-Hui; KUN-MAO CHAO | SIGMOD Record | 1 | 0 | |
2007 | A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering | Liu, Hsiao-Fei; KUN-MAO CHAO | Theoretical Computer Science | 9 | 6 | |
2008 | 條件限制下的序列搜尋與排序 | 劉效飛; Liu, Hsiao-Fei |