Hing‐Fung Ting

4.1k total citations · 1 hit paper
74 papers, 2.2k citations indexed

About

Hing‐Fung Ting is a scholar working on Computer Networks and Communications, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Hing‐Fung Ting has authored 74 papers receiving a total of 2.2k indexed citations (citations by other indexed papers that have themselves been cited), including 40 papers in Computer Networks and Communications, 24 papers in Artificial Intelligence and 19 papers in Molecular Biology. Recurrent topics in Hing‐Fung Ting's work include Optimization and Search Problems (27 papers), Genomics and Phylogenetic Studies (14 papers) and Algorithms and Data Compression (14 papers). Hing‐Fung Ting is often cited by papers focused on Optimization and Search Problems (27 papers), Genomics and Phylogenetic Studies (14 papers) and Algorithms and Data Compression (14 papers). Hing‐Fung Ting collaborates with scholars based in Hong Kong, China and United States. Hing‐Fung Ting's co-authors include Tak‐Wah Lam, Ruibang Luo, Chi-Man Liu, Dinghua Li, Hiroshi Yamashita, Kunihiko Sadakane, Lap–Kei Lee, Siu‐Ming Yiu, Francis Y. L. Chin and Francis Y. L. Chin and has published in prestigious journals such as Bioinformatics, PLoS ONE and BMC Bioinformatics.

In The Last Decade

Hing‐Fung Ting

71 papers receiving 2.2k citations

Hit Papers

MEGAHIT v1.0: A fast and scalable metagenome assembler dr... 2016 2026 2019 2022 2016 400 800 1.2k

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Hing‐Fung Ting Hong Kong 14 878 621 333 273 238 74 2.2k
Sakti Pramanik United States 17 648 0.7× 427 0.7× 436 1.3× 410 1.5× 215 0.9× 84 2.3k
Zhenglu Yang China 19 1.2k 1.3× 530 0.9× 172 0.5× 665 2.4× 535 2.2× 82 3.1k
Francis Y. L. Chin Hong Kong 26 2.4k 2.7× 1.4k 2.2× 483 1.5× 528 1.9× 413 1.7× 89 4.5k
Christian L. Müller Germany 20 1.4k 1.6× 479 0.8× 107 0.3× 224 0.8× 358 1.5× 90 2.7k
Patrik D’haeseleer United States 30 2.4k 2.8× 333 0.5× 142 0.4× 424 1.6× 230 1.0× 43 3.5k
Stephen R. Lindemann United States 29 1.4k 1.6× 874 1.4× 56 0.2× 147 0.5× 273 1.1× 90 3.2k
Seán Turner United States 22 2.0k 2.3× 1.2k 2.0× 141 0.4× 126 0.5× 558 2.3× 47 4.5k
Antonia J. Jones United Kingdom 13 605 0.7× 727 1.2× 66 0.2× 179 0.7× 104 0.4× 25 1.9k
Vahid Jalili Iran 15 1.9k 2.2× 415 0.7× 69 0.2× 123 0.5× 436 1.8× 31 3.9k
Hong An China 13 1.2k 1.4× 1.1k 1.7× 129 0.4× 118 0.4× 172 0.7× 115 2.6k

Countries citing papers authored by Hing‐Fung Ting

Since Specialization
Citations

This map shows the geographic impact of Hing‐Fung Ting's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Hing‐Fung Ting with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hing‐Fung Ting more than expected).

Fields of papers citing papers by Hing‐Fung Ting

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Hing‐Fung Ting. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Hing‐Fung Ting. The network helps show where Hing‐Fung Ting may publish in the future.

Co-authorship network of co-authors of Hing‐Fung Ting

This figure shows the co-authorship network connecting the top 25 collaborators of Hing‐Fung Ting. A scholar is included among the top collaborators of Hing‐Fung Ting based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Hing‐Fung Ting. Hing‐Fung Ting is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Zhang, Xu, Tak‐Wah Lam, & Hing‐Fung Ting. (2023). Genome instability-derived genes as a novel prognostic signature for lung adenocarcinoma. Frontiers in Cell and Developmental Biology. 11. 1224069–1224069. 2 indexed citations
2.
Su, Junhao, Ye Wu, Hing‐Fung Ting, Tak‐Wah Lam, & Ruibang Luo. (2021). RENET2: high-performance full-text gene–disease relation extraction with iterative training data expansion. NAR Genomics and Bioinformatics. 3(3). 8 indexed citations
3.
Li, Dinghua, Xin Yan, Yifan Zhang, et al.. (2020). MegaPath: sensitive and rapid pathogen detection using metagenomic NGS data. BMC Genomics. 21(S6). 500–500. 9 indexed citations
4.
Ting, Hing‐Fung, et al.. (2020). Approximation algorithms for the partial assignment problem. Theoretical Computer Science. 838. 231–237. 2 indexed citations
5.
Chin, Francis Y. L., et al.. (2018). Constant competitive algorithms for unbounded one-Way trading under monotone hazard rate. Mathematical Foundations of Computing. 1(4). 383–392. 3 indexed citations
6.
Zhang, Yifan, et al.. (2018). AC-DIAMOND v1: accelerating large-scale DNA–protein alignment. Bioinformatics. 34(21). 3744–3746. 11 indexed citations
7.
Lam, Tak‐Wah, et al.. (2017). A simple and economical method for improving whole genome alignment. BMC Genomics. 18(S4). 362–362. 3 indexed citations
8.
Li, Dinghua, et al.. (2017). MegaGTA: a sensitive and accurate metagenomic gene-targeted assembler using iterative de Bruijn graphs. BMC Bioinformatics. 18(S12). 408–408. 13 indexed citations
9.
Liu, Binghang, Chi-Man Liu, Dinghua Li, et al.. (2016). BASE: a practical de novo assembler for large genomes using long NGS reads. BMC Genomics. 17(S5). 499–499. 7 indexed citations
10.
Li, Dinghua, Ruibang Luo, Chi-Man Liu, et al.. (2016). MEGAHIT v1.0: A fast and scalable metagenome assembler driven by advanced methodologies and community practices. Methods. 102. 3–11. 1235 indexed citations breakdown →
11.
Lam, Tak‐Wah, et al.. (2016). PnpProbs: a better multiple sequence alignment tool by better handling of guide trees. BMC Bioinformatics. 17(S8). 285–285. 1 indexed citations
12.
Chin, Francis Y. L., Bin Fu, Shuguang Han, et al.. (2015). Competitive algorithms for unbounded one-way trading. Theoretical Computer Science. 607. 35–48. 16 indexed citations
13.
Zhang, Minghui, et al.. (2015). Online bin packing problem with buffer and bounded size revisited. Journal of Combinatorial Optimization. 33(2). 530–542. 2 indexed citations
14.
Luo, Ruibang, Thomas K. F. Wong, Jian-Qiao Zhu, et al.. (2013). SOAP3-dp: Fast, Accurate and Sensitive GPU-Based Short Read Aligner. PLoS ONE. 8(5). e65632–e65632. 342 indexed citations
15.
Lam, Tak‐Wah, et al.. (2011). Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors.. 2011. 3 indexed citations
16.
Lee, Lap–Kei & Hing‐Fung Ting. (2006). Maintaining significant stream statistics over sliding windows. Symposium on Discrete Algorithms. 724–732. 12 indexed citations
17.
Chan, Wun-Tat, Tak‐Wah Lam, Hing‐Fung Ting, & Prudence W. H. Wong. (2003). On-line stream merging in a general setting. Theoretical Computer Science. 296(1). 27–46. 4 indexed citations
18.
Chan, Wun-Tat, Francis Y. L. Chin, & Hing‐Fung Ting. (2003). Escaping a Grid by Edge-Disjoint Paths. Algorithmica. 36(4). 343–359. 9 indexed citations
19.
Chan, Wun-Tat, Francis Y. L. Chin, & Hing‐Fung Ting. (2000). Escaping a grid by edge-disjoint paths. Symposium on Discrete Algorithms. 726–734. 10 indexed citations
20.
Chin, Francis Y. L. & Hing‐Fung Ting. (1985). A Near-optimal Algorithm for Finding the Median Distributively.. International Conference on Distributed Computing Systems. 459–465. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026