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

Authors

131

  1. IL
    Ignace Lasters

    KU Leuven, Belgium

    7 publications · 1.2K citations

    7

    h-index

  2. BR
    Bruce R. Donald

    Duke University, United States

    6 publications · 469 citations

    6

    h-index

  3. JD
    Johan Desmet

    KU Leuven, Belgium

    6 publications · 1.2K citations

    6

    h-index

  4. SL
    Stephen L. Mayo

    California Institute of Technology, United States

    5 publications · 464 citations

    5

    h-index

  5. MD
    Marc De Maeyer

    KU Leuven, Belgium

    5 publications · 1K citations

    5

    h-index

1–5 of 131

Venues

  1. Journal of Computational Chemistry

    10 publications · 699 citations

    10

    h-index

  2. Bioinformatics

    6 publications · 261 citations

    6

    h-index

  3. Protein Engineering Design and Selection

    PEDS · 4 publications · 255 citations

    4

    h-index

  4. Proteins Structure Function and Bioinformatics

    4 publications · 506 citations

    4

    h-index

  5. ACM SIGPLAN Notices

    3 publications · 70 citations

    3

    h-index

1–5