Greedy Heuristics is a computational strategy that belongs to the class of algorithmic problem-solving methods characterized by making locally optimal choices at each step with the aim of achieving a globally near-optimal solution, distinguishing itself by its myopic decision-making process that commits irreversibly to choices without backtracking.
4.7K
Publications
291K
Citations
11.7K
Authors
2.4K
Institutions
Publications per year
2017–2026
1.5K
Parents
Publications
4.7K
A Greedy Algorithm for Aligning DNA Sequences
Zheng Zhang, Scott Schwartz, Lukas Wagner et al. · Journal of Computational Biology · 2000 · 5.6K citations
1–5 of 4.7K
Authors
11.7K
- QP
17
h-index
- VT
16
h-index
- GC
15
h-index
- WW
14
h-index
- AK
12
h-index
1–5 of 11.7K
Institutions
2.4K
Tsinghua University
Beijing, China
42 h-index
229 publications
12.8K citations
Massachusetts Institute of Technology
Cambridge, United States
38 h-index
132 publications
12.3K citations
Carnegie Mellon University
Pittsburgh, United States
35 h-index
143 publications
9K citations
Stanford University
Stanford, United States
35 h-index
93 publications
21.4K citations
University of California, Berkeley
Berkeley, United States
33 h-index
91 publications
8.3K citations
Hong Kong University of Science and Technology
Hong Kong, Hong Kong
30 h-index
110 publications
7.4K citations
University of Toronto
Toronto, Canada
29 h-index
78 publications
3.7K citations
The University of Texas at Austin
Austin, United States
29 h-index
100 publications
11.8K citations
1–8 of 2.4K
Venues
- arXiv (Cornell University)
Repository · 140 publications · 6.6K citations
38
h-index
- IEEE Transactions on Vehicular Technology
50 publications · 2.5K citations
31
h-index
- IEEE Access
79 publications · 3.8K citations
30
h-index
- IEEE Transactions on Signal Processing
47 publications · 3.3K citations
30
h-index
- IEEE Transactions on Wireless Communications
40 publications · 3.7K citations
28
h-index
1–5