| Title | Author(s) | Year | View Count |  | Compressed Indexes for Approximate String Matching | Chan, HL; Lam, TW; Sung, WK; Tam, SL; Wong, SS | 2006 | 100 |
 | Compressed indexes for approximate string matching | Chan, HL; Lam, TW; Sung, WK; Tam, SL; Wong, SS | 2006 | 173 |
| Approximate string matching using compressed suffix arrays | Huynh, TND; Hon, WK; Lam, TW; Sung, WK | 2006 | 75 |
| Improved approximate string matching using compressed suffix data structures | Lam, TW; Sung, WK; Wong, SS | 2005 | 333 |
 | The mutated subsequence problem and locating conserved genes | Chan, HL; Lam, TW; Sung, WK; Wong, PWH; Yiu, SM; Fan, X | 2005 | 262 |
| Allowing mismatches in anchors for wholw genome alignment: Generation and effectiveness | Yiu, SM; Chan, PY; Lam, TW; Sung, WK; Ting, HF; Wong, WH | 2005 | 104 |
| Improved Approximate String Matching Using Compressed Suffix Data Structures | Lam, TW; Sung, WK; Wong, SS | 2005 | 96 |
| Allowing mismatches in anchors forwhole genome alignment: Generation and effectiveness | Yiu, SM; Chan, PY; Lam, TW; Sung, WK; Ting, HF; Wong, PWH | 2005 | 68 |
| Non-shared edges and nearest neighbor interchanges revisited | Hon, WK; Kao, MY; Lam, TW; Sung, WK; Yiu, SM | 2004 | 133 |
| 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 | 156 |
| Approximate string matching using compressed suffix arrays | Huynh, TND; Hon, WK; Lam, TW; Sung, WK | 2004 | 166 |
| Approximate String Matching Using Compressed Suffix Arrays | Hon, WK; Lam, TW; Sung, WK | 2004 | 96 |
| Improving the Efficiency and Accuracy of aligning Erroneous mRNAS | Lam, TW; Sung, WK; Yim, TCH; Yiu, SM | 2004 | 90 |
| A mutation-sensitive approach for locating conserved gene pairs between related species | Chan, HL; Lam, TW; Sung, WK; Wong, PWH; Yiu, SM | 2004 | 58 |
| Compressed index for dynamic text | Hon, WK; Lam, TW; Sadakane, K; Sung, WK; Yiu, SM | 2004 | 90 |
| 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 | 129 |
| Constructing compressed suffix arrays with large alphabets | Hon, WK; Lam, TW; Sadakane, K; Sung, WK | 2003 | 158 |
| Automatic construction of online catalog topologies | Sung, WK; Yang, D; Yiu, SM; Cheung, DW; Ho, WS; Lam, TW | 2002 | 372 |
| A space adn time efficient algorithm for constructing compressed suffix arragys | Lam, TW; Sadakane, K; Sung, WK; Yiu, SM | 2002 | 115 |
| Comparison of two approaches to building a vertical search tool: A case study in the nanotechnology domain | Chau, M; Chen, H; Qin, J; Zhou, Y; Qin, Y; Sung, WK; Mcdonald, D | 2002 | 43 |
|
