Home | Trees | Indices | Help |
|
---|
|
object --+ | FragmentCluster
Provides clustering/filtering of the fragments, covering a common
residue in the target. Clustering is done via iterative shrinking of the
cluster. At each iteration, node rejection (deletion) is attempted for
each node. The node rejection, causing the most significant drop in the
average pairwise distance (RMSD) in the cluster, is retained. This
procedure is repeated until: 1) the average pairwise RMSD drops below the
threshold
(converged), 2) the cluster gets exhausted or 3)
node rejection no longer causes a drop in the average distance (not
converging).
Instance Methods | |||
|
|||
ClusterRep |
|
||
float |
|
||
|
|||
ClusterRep |
|
||
bool |
|
||
Inherited from |
Class Variables | |
MIN_LENGTH = 6
|
Properties | |
connectedness | |
count | |
fragments | |
items | |
threshold | |
Inherited from |
Method Details |
x.__init__(...) initializes x; see help(type(x)) for signature
|
Note: the cluster rep is the node with the lowest average distance to all other nodes. If a fixed fragment exists, structurally similar to the rep, but longer, this fragment may be suggested as an alternative (see also ClusterRep). |
|
Remove
|
Start automatic shrinking.
|
Shrink the cluster by a single node.
|
Property Details |
connectedness
|
count
|
fragments
|
items
|
threshold
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Tue Jul 4 20:19:04 2017 | http://epydoc.sourceforge.net |