Package rosetta :: Package protocols :: Package medal :: Module _protocols_medal_
[hide private]
[frames] | no frames]

Module _protocols_medal_

Classes [hide private]
  MedalExchangeMover
protocols/medal/MedalExchangeMover.hh:37
  MedalExchangeMoverAP
  MedalExchangeMoverCAP
  MedalMover
@class Alternating rigid body and fragment insertion moves with a linearly increasing chainbreak
  MedalMoverAP
  MedalMoverCAP
  __CPP_MedalExchangeMover__
  __CPP_MedalMover__
Functions [hide private]
 
alignment_probabilities(...)
alignment_probabilities( (int)num_residues, (SequenceAlignment)alignment, (vector1_Real)p) -> None : Computes per-residue alignment probabilities.
 
as_set(...)
as_set( (Loops)loops, (object)s) -> None : Populates a hash table with the residues contained in loops
 
chunk_probabilities(...)
chunk_probabilities( (Loops)chunks, (vector1_Real)p) -> None : Computes per-residue chunk probabilities.
 
cutpoint_probabilities(...)
cutpoint_probabilities( (int)num_residues, (FoldTree)tree, (vector1_Real)p) -> None : Computes per-residue cutpoint probabilities.
 
end_bias_probabilities(...)
end_bias_probabilities( (int)num_residues, (vector1_Real)p) -> None : Biases sampling away from termini
 
invalidate_residues_spanning_cuts(...)
invalidate_residues_spanning_cuts( (FoldTree)tree, (int)fragment_len, (vector1_Real)probs) -> None : Zeroes out the probability of residues for which fragment insertion would cross cutpoint boundaries.
 
to_centroid(...)
to_centroid( (Pose)pose) -> None : protocols/medal/util.hh:62
Variables [hide private]
  __package__ = None
Function Details [hide private]

alignment_probabilities(...)

 

alignment_probabilities( (int)num_residues, (SequenceAlignment)alignment, (vector1_Real)p) -> None :
    Computes per-residue alignment probabilities. To minimize assumptions
    about the fold tree, the number of residues in the pose is an explicit input.
    

    C++ signature :
        void alignment_probabilities(unsigned int,core::sequence::SequenceAlignment,utility::vector1<double, std::allocator<double> >*)

as_set(...)

 

as_set( (Loops)loops, (object)s) -> None :
    Populates a hash table with the residues contained in loops
    

    C++ signature :
        void as_set(boost::shared_ptr<protocols::loops::Loops const>,boost::unordered::unordered_set<unsigned long, boost::hash<unsigned long>, std::equal_to<unsigned long>, std::allocator<unsigned long> >*)

chunk_probabilities(...)

 

chunk_probabilities( (Loops)chunks, (vector1_Real)p) -> None :
    Computes per-residue chunk probabilities. A linear voting scheme is
    used to bias sampling toward larger chunks.
    

    C++ signature :
        void chunk_probabilities(protocols::loops::Loops,utility::vector1<double, std::allocator<double> >*)

cutpoint_probabilities(...)

 

cutpoint_probabilities( (int)num_residues, (FoldTree)tree, (vector1_Real)p) -> None :
    Computes per-residue cutpoint probabilities. Sampling is biased
    toward residues proximal to a cutpoint.
    

    C++ signature :
        void cutpoint_probabilities(unsigned int,core::kinematics::FoldTree,utility::vector1<double, std::allocator<double> >*)

end_bias_probabilities(...)

 

end_bias_probabilities( (int)num_residues, (vector1_Real)p) -> None :
    Biases sampling away from termini
    

    C++ signature :
        void end_bias_probabilities(unsigned int,utility::vector1<double, std::allocator<double> >*)

invalidate_residues_spanning_cuts(...)

 

invalidate_residues_spanning_cuts( (FoldTree)tree, (int)fragment_len, (vector1_Real)probs) -> None :
    Zeroes out the probability of residues for which fragment insertion
    would cross cutpoint boundaries.
    

    C++ signature :
        void invalidate_residues_spanning_cuts(core::kinematics::FoldTree,unsigned long,utility::vector1<double, std::allocator<double> >*)

to_centroid(...)

 

to_centroid( (Pose)pose) -> None :
    protocols/medal/util.hh:62

    C++ signature :
        void to_centroid(core::pose::Pose*)