![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Wing-Kai Hon Ankur Gupta , Wing-Kai Hon, Rahul Shah , Jeffrey Scott Vitter : Compressed Data Structures: Dictionaries and Data-Aware Measures. DCC 2006 : 213-222 Ankur Gupta , Wing-Kai Hon, Rahul Shah , Jeffrey Scott Vitter : Compressed Dictionaries: Space Measures, Data Sets, and Experiments. WEA 2006 : 158-169 Trinh N. D. Huynh , Wing-Kai Hon, Tak Wah Lam , Wing-Kin Sung : Approximate string matching using compressed suffix arrays. Theor. Comput. Sci. 352 (1-3): 240-249 (2006) Ho-Leung Chan , Wing-Kai Hon, Tak Wah Lam , Kunihiko Sadakane : Dynamic dictionary matching and compressed suffix trees. SODA 2005 : 13-22 Mourad Ouzzani , Walid G. Aref , Elisa Bertino , Ann Christine Catlin , Christopher W. Clifton , Wing-Kai Hon, Ahmed K. Elmagarmid , Arif Ghafoor , Susanne E. Hambrusch , Sunil Prabhakar , Jeffrey Scott Vitter , Xiang Zhang : The Indiana Center for Database Systems at Purdue University. SIGMOD Record 34 (2): 53-58 (2005) Wing-Kai Hon, Tak Wah Lam , Wing-Kin Sung , Wai-Leuk Tse , Chi-Kwong Wong , Siu-Ming Yiu : Practical aspects of Compressed Suffix Arrays and FM-Index in Searching DNA Sequences. ALENEX/ANALC 2004 : 31-38 Trinh N. D. Huynh , Wing-Kai Hon, Tak Wah Lam , Wing-Kin Sung : Approximate String Matching Using Compressed Suffix Arrays. CPM 2004 : 434-444 Ho-Leung Chan , Wing-Kai Hon, Tak Wah Lam : Compressed Index for a Dynamic Collection of Texts. CPM 2004 : 445-456 Wing-Kai Hon, Tak Wah Lam , Kunihiko Sadakane , Wing-Kin Sung , Siu-Ming Yiu : Compressed Index for Dynamic Text. Data Compression Conference 2004 : 102-111 Wing-Kai Hon, Ming-Yang Kao , Tak Wah Lam , Wing-Kin Sung , Siu-Ming Yiu : Non-shared edges and nearest neighbor interchanges revisited. Inf. Process. Lett. 91 (3): 129-134 (2004) Wing-Kai Hon, Tak Wah Lam , Siu-Ming Yiu , Ming-Yang Kao , Wing-Kin Sung : Subtree Transfer Distance For Degree-D Phylogenies. Int. J. Found. Comput. Sci. 15 (6): 893-909 (2004) Wei Fu , Wing-Kai Hon, Wing-Kin Sung : On All-Substrings Alignment Problems. COCOON 2003 : 80-89 Wing-Kai Hon, Kunihiko Sadakane , Wing-Kin Sung : Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. FOCS 2003 : 251-260 Wing-Kai Hon, Tak Wah Lam , Kunihiko Sadakane , Wing-Kin Sung : Constructing Compressed Suffix Arrays with Large Alphabets. ISAAC 2003 : 240-249 Wing-Kai Hon, Kunihiko Sadakane , Wing-Kin Sung : Succinct Data Structures for Searchable Partial Sums. ISAAC 2003 : 505-516 Wing-Kai Hon, Kunihiko Sadakane : Space-Economical Algorithms for Finding Maximal Unique Matches. CPM 2002 : 144-152 Wing-Kai Hon, Ming-Yang Kao , Tak Wah Lam , Wing-Kin Sung , Siu-Ming Yiu : Improved Phylogeny Comparisons: Non-Shared Edges Nearest Neighbor Interchanges, and Subtree Transfers CoRR cs.DS/0211009 : (2002) Wing-Kai Hon, Tak Wah Lam : Approximating the Nearest Neighbor Intercharge Distance for Non-Uniform-Degree Evolutionary Trees. Int. J. Found. Comput. Sci. 12 (4): 533-550 (2001) Wing-Kai Hon, Ming-Yang Kao , Tak Wah Lam : Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers. ISAAC 2000 : 527-538 Wing-Kai Hon, Tak Wah Lam : Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees. COCOON 1999 : 61-70 1 [ 16 ] 2 [ 16 ] 3 [ 16 ] 4 [ 13 ] [ 17 ] 5 [ 16 ] 6 [ 16 ] 7 [ 9 ] 8 [ 16 ] 9 [ 19 ] [ 20 ] 10 [ 16 ] 11 [ 14 ] [ 18 ] 12 [ 2 ] [ 4 ] [ 10 ] [ 11 ] 13 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 7 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 14 ] [ 15 ] [ 17 ] [ 18 ] 14 [ 16 ] 15 [ 16 ] 16 [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 12 ] [ 17 ] 17 [ 19 ] [ 20 ] 18 [ 4 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 14 ] [ 15 ] [ 18 ] 19 [ 15 ] 20 [ 16 ] [ 19 ] [ 20 ] 21 [ 15 ] 22 [ 4 ] [ 10 ] [ 11 ] [ 12 ] [ 15 ] 23 [ 16 ] ![]() ©2006 Association for Computing Machinery |