Dead-end elimination

Known as: Dead end elimination, Dee 
The dead-end elimination algorithm (DEE) is a method for minimizing a function over a discrete set of independent variables. The basic idea is to… (More)
Wikipedia

Related topics

Related topics

7 relations
Benchmark (computing)Dynamic programmingGenetic algorithmGlobal optimization
(More)

Broader (1)

Mathematical optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Dead-End Elimination for Weighted CSP
Soft neighborhood substitutability (SNS) is a powerful technique to automatically detect and prune dominated solutions in… (More)
Is this relevant?
2012
2012
Efficient a Priori Identification of Drug Resistant Mutations Using Dead-End Elimination and MM-PBSA
Active site mutations that disrupt drug binding are an important mechanism of drug resistance. Computational methods capable of… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2008
2008
Designing a Peptide Ligand with Dead End Elimination Kyle Roberts
In protein redesign one of the main challenges is the ability to evaluate many different conformations of the redesigned protein… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Dead-End Elimination with Backbone Flexibility
MOTIVATION Dead-End Elimination (DEE) is a powerful algorithm capable of reducing the search space for structure-based protein… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
Is this relevant?
2007
2007
Dead-end elimination for multistate protein design
Multistate protein design is the task of predicting the amino acid sequence that is best suited to selectively and stably fold to… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2007
2007
An extended dead-end elimination algorithm to determine gap-free lists of low energy states
Proteins are flexible systems and commonly populate several functionally important states. To understand protein function, these… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation
We apply the dead-end elimination (DEE) strategy from protein design as a heuristic for the max-flow/min-cut formulation of the… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
Is this relevant?
2006
2006
Improved Pruning algorithms and Divide-and-Conquer strategies for Dead-End Elimination, with application to protein design
MOTIVATION Structure-based protein redesign can help engineer proteins with desired novel function. Improving computational… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Conformational splitting: A more powerful criterion for dead-end elimination
Dead-end elimination (DEE) is a powerful theorem for selecting optimal protein side-chain orientations from a large set of… (More)
  • figure 1
  • figure 2
  • table I
  • table II
  • figure 5
Is this relevant?
1999
1999
Local multiple sequence alignment using dead-end elimination
MOTIVATION Local multiple sequence alignment is a basic tool for extracting functionally important regions shared by a family of… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?