 | 2009 |
|---|
| 12 |       | Hsiao-Fei Liu,
Kun-Mao Chao:
On Locating Disjoint Segments with Maximum Sum of Densities.
Algorithmica 54(1): 107-117 (2009) |
| 11 | | Chih-Huai Cheng,
Hsiao-Fei Liu,
Kun-Mao Chao:
Optimal algorithms for the average-constrained maximum-sum segment problem.
Inf. Process. Lett. 109(3): 171-174 (2009) |
| 2008 |
|---|
| 10 | | Cheng-Wei Luo,
Hsiao-Fei Liu,
Peng-An Chen,
Kun-Mao Chao:
Minkowski Sum Selection and Finding.
ISAAC 2008: 460-471 |
| 9 | | Peng-An Chen,
Hsiao-Fei Liu,
Kun-Mao Chao:
CNVDetector: locating copy number variations using array CGH data.
Bioinformatics 24(23): 2773-2775 (2008) |
| 8 | | Hsiao-Fei Liu,
Kun-Mao Chao:
An Õ(n2.5)-Time Algorithm for Online Topological Ordering
CoRR abs/0804.3860: (2008) |
| 7 | | Cheng-Wei Luo,
Hsiao-Fei Liu,
Peng-An Chen,
Kun-Mao Chao:
Minkowski Sum Selection and Finding
CoRR abs/0809.1171: (2008) |
| 6 | | Hsiao-Fei Liu,
Peng-An Chen,
Kun-Mao Chao:
Algorithms for Locating Constrained Optimal Intervals
CoRR abs/0809.2097: (2008) |
| 5 | | Hsiao-Fei Liu,
Kun-Mao Chao:
Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence.
Theor. Comput. Sci. 407(1-3): 349-358 (2008) |
| 2007 |
|---|
| 4 | | Hsiao-Fei Liu,
Peng-An Chen,
Kun-Mao Chao:
Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis.
ISAAC 2007: 834-845 |
| 3 | | Hsiao-Fei Liu,
Kun-Mao Chao:
A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering.
Theor. Comput. Sci. 389(1-2): 182-189 (2007) |
| 2006 |
|---|
| 2 | | Hsiao-Fei Liu,
Kun-Mao Chao:
On Locating Disjoint Segments with Maximum Sum of Densities.
ISAAC 2006: 300-307 |
| 2004 |
|---|
| 1 | | Hsiao-Fei Liu,
Ya-Hui Chang,
Kun-Mao Chao:
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics.
SIGMOD Record 33(2): 21-26 (2004) |
