| Title | Author(s) | Year | View Count |
 | Cache-oblivious index for approximate string matching | Hon, WK; Lam, TW; Shah, R; Tam, SL; Vitter, JS | 2011 | 620 |
 | RNASAlign: RNA structural alignment system | Wong, TKF; Wan, KL; Hsu, BY; Cheung, BWY; Hon, WK; Lam, TW; Yiu, SM | 2011 | 267 |
 | Identifying Static and Dynamic Volatile Memory Data from Multiple Dumps for Live Forensics | Law, YW; Chan, PF; Yiu, SM; Tang, B; Lai, KY; Chow, KP; Ieong, SCR; Kwan, YK; Hon, WK; Hui, CK | 2010 | 186 |
| Identifying volatile data from multiple memory dumps in live forensics | Law, F; Chan, P; Yiu, SM; Tang, B; Lai, P; Chow, KP; Ieong, R; Kwan, M; Hon, WK; Hui, L | 2010 | 82 |
| Succinct index for dynamic dictionary matching | Hon, WK; Lam, TW; Shah, R; Tam, SL; Vitter, JS | 2009 | 175 |
| Compressed index for dictionary matching | Hon, WK; Shah, R; Lam, TW; Tam, SL; Vitter, JS | 2008 | 187 |
| A space and time efficient algorithm for constructing compressed suffix arrays | Hon, WK; Lam, TW; Sadakane, K; Sung, WK; Yiu, SM | 2007 | 196 |
| Compressed indexes for dynamic text collections | Chan, HL; Hon, WK; Lam, TW; Sadakane, K | 2007 | 180 |
| Cache-oblivious index for approximate string matching | Hon, WK; Lam, TW; Shah, R; Tam, SL; Vitter, JS | 2007 | 128 |
| Approximate string matching using compressed suffix arrays | Huynh, TND; Hon, WK; Lam, TW; Sung, WK | 2006 | 68 |
| Dynamic dictionary matching and compressed suffix trees | Chan, HL; Hon, WK; Lam, TW; Sadakane, K | 2005 | 314 |
| Non-shared edges and nearest neighbor interchanges revisited | Hon, WK; Kao, MY; Lam, TW; Sung, WK; Yiu, SM | 2004 | 126 |
| Approximate string matching using compressed suffix arrays | Huynh, TND; Hon, WK; Lam, TW; Sung, WK | 2004 | 159 |
| Practical aspects of compressed suffix arrays and FM-index in searching DNA sequences | Hon, WK; Lam, TW; Sung, WK; Tse, WL; Wong, CK; Yiu, SM | 2004 | 144 |
| Compressed index for a dynamic collection of texts | Chan, HL; Hon, WK; Lam, TW | 2004 | 106 |
| Subtree Transfer Distance for Degree-d Phylogenies | Hon, WK; Kao, MY; Lam, TW | 2004 | 154 |
| Approximate String Matching Using Compressed Suffix Arrays | Hon, WK; Lam, TW; Sung, WK | 2004 | 91 |
| Compressed index for dynamic text | Hon, WK; Lam, TW; Sadakane, K; Sung, WK; Yiu, SM | 2004 | 82 |
| Constructing compressed suffix arrays with large alphabets | Hon, WK; Lam, TW; Sadakane, K; Sung, WK | 2003 | 148 |
| Approximating the Nearest Neighbor Interchange Distance for Non-Uniform-Degree Evolutionary Trees | Hon, WK; Lam, TW | 2001 | 132 |
|
