| Title | Author(s) | Year | View Count |
 | Deterministic polynomial-time algorithms for designing short DNA words | Kao, MY; Leung, HCM; Sun, H; Zhang, Y | 2010 | 169 |
| Linear-time haplotype inference on pedigrees without recombinations and mating loops | Chan, MY; Chan, WT; Chin, FYL; Fung, SPY; Kao, MY | 2009 | 179 |
| Linear-time haplotype inference on pedigrees without recombinations | Chan, MY; Chan, WT; Chin, FYL; Fung, SPY; Kao, MY | 2006 | 97 |
| Non-shared edges and nearest neighbor interchanges revisited | Hon, WK; Kao, MY; Lam, TW; Sung, WK; Yiu, SM | 2004 | 124 |
 | Subtree Transfer Distance for Degree-d Phylogenies | Hon, WK; Kao, MY; Lam, TW | 2004 | 151 |
| Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs | Ieong, S; Kao, MY; Lam, TW; Sung, WK; Yiu, SM | 2003 | 120 |
| An even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings | Kao, MY; Lam, TW; Sung, WK; Ting, HF | 2001 | 144 |
 | A decomposition theorem for maximum weight bipartite matchings | Kao, MY; Lam, TW; Sung, WK; Ting, HF | 2001 | 357 |
| Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison | Kao, MY; Lam, TW; Sung, WK; Ting, HF | 2000 | 126 |
| Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers | Hon, WK; Kao, MY; Lam, TW | 2000 | 109 |
| A Faster and Unifying algorithm for Comparing Trees | Kao, MY; Lam, TW; Sung, WK; Ting, HF | 2000 | 113 |
| Cavity matchings, label compressions, and unrooted evolutionary trees | Kao, MY; Lam, TW; Sung, WK; Ting, HF | 2000 | 307 |
| A Decomposition Theorem For Maximum Weight Bipartite Matchings with Applications To Evolutionary Trees | Kao, MY; Lam, TW; Ting, HF; Sung, WK | 1999 | 135 |
| Default-sensitive preprocessings for finding maxima | Kao, MY; Lam, TW; Sung, WK; Ting, HF | 1998 | 98 |
| All-cavity maximum Matchings | Kao, MY; Lam, TW; Sung, WK; Ting, HF | 1997 | 86 |
