Dead-end Elimination
Dead-End Elimination is a computational optimization algorithm in the field of protein side-chain prediction that prunes rotamer conformations incompatible with the global energy minimum by systematically eliminating assignments that cannot contribute to the optimal solution.
59
Publications
4.3K
Citations
131
Authors
62
Institutions
Publications per year
2017–2026
5
Variants
Dee
Parents
59
The dead-end elimination theorem and its use in protein side-chain positioning
Johan Desmet, Marc De Maeyer, Bart Hazes et al. · Nature · 1992 · 696 citations
Loren L. Looger, Homme W. Hellinga · Journal of Molecular Biology · 2001 · 202 citations
Jens Knoop, Oliver Rüthing, Bernhard Steffen · 1994 · 191 citations
1–5 of 59
131
7
h-index
6
h-index
6
h-index
5
h-index
5
h-index
1–5 of 131
62
KU Leuven
Leuven, Belgium
7 h-index
13 publications
1.7K citations
Duke Medical Center
Durham, United States
6 h-index
17 publications
1.5K citations
Duke University Hospital
Durham, United States
6 h-index
17 publications
1.5K citations
Duke University
Durham, United States
5 h-index
13 publications
1.1K citations

Howard Hughes Medical Institute
Chevy Chase, United States
5 h-index
5 publications
464 citations
California Institute of Technology
Pasadena, United States
5 h-index
12 publications
1.1K citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
8 publications
358 citations
Vlaams Instituut voor Biotechnologie
Ghent, Belgium
3 h-index
4 publications
438 citations
1–8 of 62
10 publications · 699 citations
10
h-index
6 publications · 261 citations
6
h-index
PEDS · 4 publications · 255 citations
4
h-index
4 publications · 506 citations
4
h-index
3 publications · 70 citations
3
h-index
1–5