| http://dbpedia.org/ontology/abstract
|
The dead-end elimination algorithm (DEE) i … 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 identify "dead ends", i.e., combinations of variables that are not necessary to define a global minimum because there is always a way of replacing such combination by a better or equivalent one. Then we can refrain from searching such combinations further. Hence, dead-end elimination is a mirror image of dynamic programming, in which "good" combinations are identified and explored further. Although the method itself is general, it has been developed and applied mainly to the problems of predicting and designing the structures of proteins. It closely related to the notion of dominance in optimization also known as substitutability in a Constraint Satisfaction Problem. The original description and proof of the dead-end elimination theorem can be found in .-end elimination theorem can be found in .
|
| http://dbpedia.org/ontology/wikiPageID
|
5310739
|
| http://dbpedia.org/ontology/wikiPageLength
|
10549
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1108404907
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Function_%28mathematics%29 +
, http://dbpedia.org/resource/Benchmark_%28computing%29 +
, http://dbpedia.org/resource/Constraint_Satisfaction_Problem +
, http://dbpedia.org/resource/Mean_field_theory +
, http://dbpedia.org/resource/Tertiary_structure +
, http://dbpedia.org/resource/Monte_Carlo_method +
, http://dbpedia.org/resource/Potential +
, http://dbpedia.org/resource/Optimization_%28mathematics%29 +
, http://dbpedia.org/resource/Rotamer +
, http://dbpedia.org/resource/Category:Mathematical_optimization +
, http://dbpedia.org/resource/Global_minimum +
, http://dbpedia.org/resource/Global_optimization +
, http://dbpedia.org/resource/Amino_acid +
, http://dbpedia.org/resource/Dynamic_programming +
, http://dbpedia.org/resource/Objective_function +
, http://dbpedia.org/resource/Protein_structure_prediction +
, http://dbpedia.org/resource/Independent_variable +
, http://dbpedia.org/resource/Zinc_finger +
, http://dbpedia.org/resource/Quadratic_growth +
, http://dbpedia.org/resource/Protein_design +
, http://dbpedia.org/resource/Genetic_algorithm +
, http://dbpedia.org/resource/Category:Protein_methods +
, http://dbpedia.org/resource/Protein +
, http://dbpedia.org/resource/Dihedral_angle +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Main +
, http://dbpedia.org/resource/Template:Note +
, http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:PMID +
, http://dbpedia.org/resource/Template:Ref +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Mathematical_optimization +
, http://dbpedia.org/resource/Category:Protein_methods +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Method +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Dead-end_elimination?oldid=1108404907&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Dead-end_elimination +
|
| owl:sameAs |
http://rdf.freebase.com/ns/m.0ddw4r +
, https://global.dbpedia.org/id/4iuY3 +
, http://yago-knowledge.org/resource/Dead-end_elimination +
, http://he.dbpedia.org/resource/Dead-end_elimination +
, http://www.wikidata.org/entity/Q5245065 +
, http://dbpedia.org/resource/Dead-end_elimination +
|
| rdf:type |
http://dbpedia.org/class/yago/Cognition100023271 +
, http://dbpedia.org/class/yago/WikicatProteinMethods +
, http://dbpedia.org/class/yago/Method105660268 +
, http://dbpedia.org/class/yago/PsychologicalFeature100023100 +
, http://dbpedia.org/class/yago/Ability105616246 +
, http://dbpedia.org/class/yago/Know-how105616786 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/ontology/Software +
|
| rdfs:comment |
The dead-end elimination algorithm (DEE) i … 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 identify "dead ends", i.e., combinations of variables that are not necessary to define a global minimum because there is always a way of replacing such combination by a better or equivalent one. Then we can refrain from searching such combinations further. Hence, dead-end elimination is a mirror image of dynamic programming, in which "good" combinations are identified and explored further.tions are identified and explored further.
|
| rdfs:label |
Dead-end elimination
|
