| MEGAHIT v1. 0: a fast and scalable metagenome assembler driven by advanced methodologies and community practices D Li, R Luo, CM Liu, CM Leung, HF Ting, K Sadakane, H Yamashita, ... Methods 102, 3-11, 2016 | 1226 | 2016 |
| SOAP3-dp: fast, accurate and sensitive GPU-based short read aligner R Luo, T Wong, J Zhu, CM Liu, X Zhu, E Wu, LK Lee, H Lin, W Zhu, ... PloS one 8 (5), e65632, 2013 | 163 | 2013 |
| A simpler and more efficient deterministic scheme for finding frequent items over sliding windows LK Lee, HF Ting Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on …, 2006 | 134 | 2006 |
| Renet: A deep learning approach for extracting gene-disease associations from literature Y Wu, R Luo, HCM Leung, HF Ting, TW Lam Research in Computational Molecular Biology: 23rd Annual International …, 2019 | 108 | 2019 |
| An almost linear time and O (nlogn+ e) messages distributed algorithm for minimum-weight spanning trees F Chin, HF Ting 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 257-266, 1985 | 98 | 1985 |
| An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings MY Kao, TW Lam, WK Sung, HF Ting Journal of Algorithms 40 (2), 212-233, 2001 | 69 | 2001 |
| A decomposition theorem for maximum weight bipartite matchings MY Kao, TW Lam, WK Sung, HF Ting SIAM Journal on Computing 31 (1), 18-26, 2001 | 69 | 2001 |
| Near optimal algorithms for online maximum edge-weighted b-matching and two-sided vertex-weighted b-matching HF Ting, X Xiang Theoretical Computer Science 607, 247-256, 2015 | 55 | 2015 |
| A decomposition theorem for maximumweight bipartite matchings with applications to evolutionary trees MY Kao, TW Lam, WK Sung, HF Ting European Symposium on Algorithms, 438-449, 1999 | 49 | 1999 |
| Continuous monitoring of distributed data streams over a time-based sliding window HL Chan, TW Lam, LK Lee, HF Ting Algorithmica 62 (3), 1088-1111, 2012 | 47 | 2012 |
| A new upper bound 2.5545 on 2d online bin packing X Han, FYL Chin, HF Ting, G Zhang, Y Zhang ACM Transactions on Algorithms (TALG) 7 (4), 1-18, 2011 | 47 | 2011 |
| New results on on-demand broadcasting with deadline via job scheduling with cancellation WT Chan, TW Lam, HF Ting, PWH Wong Computing and Combinatorics: 10th Annual International Conference, COCOON …, 2004 | 42 | 2004 |
| Maintaining significant stream statistics over sliding windows LK Lee, HF Ting Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 39 | 2006 |
| GLProbs: Aligning multiple sequences adaptively Y Ye, DW Cheung, Y Wang, SM Yiu, Q Zhan, TW Lam, HF Ting Proceedings of the International Conference on Bioinformatics, Computational …, 2013 | 37 | 2013 |
| A note on a selfish bin packing problem R Ma, G Dósa, X Han, HF Ting, D Ye, Y Zhang Journal of Global Optimization 56 (4), 1457-1462, 2013 | 36 | 2013 |
| Finding frequent items over sliding windows with constant update time RYS Hung, LK Lee, HF Ting Information Processing Letters 110 (7), 257-260, 2010 | 30 | 2010 |
| Sleep with guilt and work faster to minimize flow plus energy TW Lam, LK Lee, HF Ting, IKK To, PWH Wong Automata, Languages and Programming: 36th International Colloquium, ICALP …, 2009 | 29 | 2009 |
| Competitive algorithms for unbounded one-way trading FYL Chin, B Fu, J Guo, S Han, J Hu, M Jiang, G Lin, HF Ting, L Zhang, ... Theoretical Computer Science 607, 35-48, 2015 | 27 | 2015 |
| Escaping a grid by edge-disjoint paths WT Chan, FYL Chin, HF Ting Algorithmica 36, 343-359, 2003 | 27 | 2003 |
| Requirement-based data cube schema design DW Cheung, B Zhou, B Kao, H Lu, TW Lam, HF Ting Proceedings of the eighth international conference on Information and …, 1999 | 26 | 1999 |
