Rosetta
|
Functions | |
clean the clash | nonidcen_counts (:,:, 1:6)=0 |
Nint (ndx) | |
printf ("%.3f ", rvdw *rvdw) | |
Pvdw (rx >rvdw) | |
draw the | g (r) picture h |
text (0, Nall/100000, t) | |
set (h(1), "linewidth", 2) set(h(2) | |
end | printf ("\n") |
Variables | |
dic = [ "Nbb" | |
CAbb | |
CB | |
CObb | |
OCbb | |
CEN_ALA | |
CEN_CYS | |
CEN_ASP | |
CEN_GLU | |
CEN_PHE | |
CEN_GLY | |
CEN_HIS | |
CEN_ILE | |
CEN_LYS | |
CEN_LEU | |
CEN_MET | |
CEN_ASN | |
CEN_PRO | |
CEN_GLN | |
CEN_ARG | |
CEN_SER | |
CEN_THR | |
CEN_VAL | |
CEN_TRP | |
CEN_TYR | |
cutoff = 0.001 | |
for | aandx |
for | ii |
r = 0.25:0.5:15 | |
shell = (4.0*pi*r.*r)' | |
Nr = squeeze(nonidcen_counts(ii, aandx, :)) | |
Nint = Nr | |
Pr = Nr ./ shell / 0.2 | |
Nall = 0 | |
for | ndx |
end | Nc = Nall*cutoff |
rm = 0:0.001:10 | |
sm = 4.0*pi*rm.*rm | |
Nrm = interp1( r, Nint, rm, 'linear') | |
Prm = interp1( r, Pr, rm, 'linear') | |
p_end = Pr(50)/3 | |
rx = 0:0.1:10 | |
Px = interp1( r, Pr, rx, 'linear') | |
Pvdw = exp(-(rvdw**2-rx.*rx).**2/rvdw) | |
t = dic(ii,:) | |
linewidth | |
draw the g | ( | r | ) |
Referenced by SymRBMover::apply(), numeric::VoxelArray< _Float, _Value >::at(), utility::graph::RingEdgeAnnotationVisitor< Graph, EdgeMap, PathMap >::back_edge(), utility::graph::breadth_first_search_prune(), utility::graph::breadth_first_visit_prune(), utility::graph::delete_all_intragroup_edges(), deleteEdge(), utility::graph::depth_first_search_sort(), utility::graph::depth_first_visit(), utility::graph::depth_first_visit_sort_impl(), utility::graph::digraph_is_a_DAG(), do_two(), euler2rot(), utility::graph::find_connected_components(), utility::graph::RingSizeVisitor< Graph, DistanceMap, LabelMap >::gray_target(), numeric::fourier::SHT::idx_to_rot(), jacobi(), main(), output_interface_graphviz(), print_graph(), utility::tag::Tag::read(), numeric::rgb_to_hsv(), basic::svd::SVD_Solver::svdcmp(), numeric::linear_algebra::svdcmp(), utility::graph::topological_sort(), PathFinder::tree_edge(), utility::graph::RingSizeVisitor< Graph, DistanceMap, LabelMap >::tree_edge(), RerootRestypeVisitor::tree_edge(), utility::graph::RingEdgeAnnotationVisitor< Graph, EdgeMap, PathMap >::tree_edge(), and utility::graph::visit().
Nint | ( | ndx | ) |
|
pure virtual |
printf | ( | "%.3f " | , |
rvdw * | rvdw | ||
) |
end printf | ( | "\n" | ) |
set | ( | h(1) | , |
"linewidth" | , | ||
2 | |||
) |
for aandx |
CAbb |
CB |
CEN_ALA |
CEN_ARG |
CEN_ASN |
CEN_ASP |
CEN_CYS |
CEN_GLN |
CEN_GLU |
CEN_GLY |
CEN_HIS |
CEN_ILE |
CEN_LEU |
CEN_LYS |
CEN_MET |
CEN_PHE |
CEN_PRO |
CEN_SER |
CEN_THR |
CEN_TRP |
CEN_TYR |
CEN_VAL |
CObb |
cutoff = 0.001 |
dic = [ "Nbb" |
for ii |
linewidth |
Nall = 0 |
for ndx |
Nint = Nr |
Nr = squeeze(nonidcen_counts(ii, aandx, :)) |
OCbb |
p_end = Pr(50)/3 |
r = 0.25:0.5:15 |
rm = 0:0.001:10 |
rx = 0:0.1:10 |