Rosetta  2021.16
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
Namespaces | Functions
PackRotamersMoverPartGreedy.cc File Reference

Partly greedy pack rotamers mover. given a set of target residues, choose their neighbors greedily and then. More...

#include <protocols/enzdes/PackRotamersMoverPartGreedy.hh>
#include <protocols/minimization_packing/PackRotamersMover.hh>
#include <protocols/enzdes/PackRotamersMoverPartGreedyCreator.hh>
#include <basic/datacache/DataMap.hh>
#include <protocols/rosetta_scripts/util.hh>
#include <core/pose/selection.hh>
#include <core/pack/task/PackerTask.hh>
#include <core/pack/task/TaskFactory.hh>
#include <core/pack/task/operation/TaskOperations.hh>
#include <core/kinematics/MoveMap.hh>
#include <core/pose/Pose.hh>
#include <core/scoring/ScoreFunction.hh>
#include <core/scoring/ScoreFunctionFactory.hh>
#include <core/pack/task/IGEdgeReweightContainer.hh>
#include <core/select/residue_selector/ResidueSelector.hh>
#include <core/select/util.hh>
#include <protocols/toolbox/IGEdgeReweighters.hh>
#include <protocols/toolbox/pose_manipulation/pose_manipulation.hh>
#include <protocols/minimization_packing/MinMover.hh>
#include <core/scoring/Energies.hh>
#include <core/conformation/Residue.hh>
#include <basic/Tracer.hh>
#include <protocols/enzdes/enzdes_util.hh>
#include <utility>
#include <utility/exit.hh>
#include <utility/tag/Tag.hh>
#include <core/scoring/EnergyGraph.hh>
#include <utility/vector1.hh>
#include <numeric/random/random.hh>
#include <numeric/random/random_permutation.hh>
#include <utility/sort_predicates.hh>
#include <utility/tag/XMLSchemaGeneration.hh>
#include <protocols/moves/mover_schemas.hh>

Namespaces

 protocols
 The instance of Loops contained by AbrelaxApplication should be replaced by a LoopsOP.
 
 protocols::enzdes
 

Functions

static basic::Tracer protocols::enzdes::TR ("protocols.enzdes.PackRotamersMoverPartGreedy")
 

Detailed Description

Partly greedy pack rotamers mover. given a set of target residues, choose their neighbors greedily and then.

pack with usual simulated annealing maintaining these neighbor choices

Author
Sagar Khare (khare.nosp@m.s@uw.nosp@m..edu)