Trees | Indices | Help |
|
---|
|
Clusters actives and hypotheses into possible binding modes. Actives are represented by bit strings encoding the hypotheses they match, and hypotheses are represented by bit strings encoding the actives they match. Tanimoto similarities between bit strings are computed, and hierarchical, agglomerative clustering is performed on both actives and hypotheses. The presence of consistent groupings of actives and hypotheses may indicate the existence of multiple binding modes. For example, if there are 10 hypotheses and 8 actives, an idealized clustered bit matrix for 2 clusters might look like this: Actives Order H 1 1 1 1 0 0 0 0 7 y 1 1 1 1 0 0 0 0 1 p 1 1 1 1 0 0 0 0 4 o 1 1 1 1 0 0 0 0 0 t 1 1 1 1 0 0 0 0 9 h 1 1 1 1 0 0 0 0 Cut 0 --- 2 e 0 0 0 0 1 1 1 1 6 s 0 0 0 0 1 1 1 1 5 e 0 0 0 0 1 1 1 1 8 s 0 0 0 0 1 1 1 1 Cut 1 --- 3 Order 3 5 0 2 7 1 5 4 | | | | Cut 0 Cut 1 Example Usage: hypos = hypothesis.extract_hypotheses(phypo_path) results = hbm.calculate_binding_modes(hypos, 2) cluster_matrix, active_IDs, hypo_IDs, actives_cut, hypo_cut = results Copyright Schrodinger LLC, All Rights Reserved.
|
|||
|
|||
list of str |
|
||
dict |
|
||
bool, str |
|
||
float |
|
||
numpy.array
|
|
||
list, list |
|
|
|||
__package__ =
|
|
Clusters actives and hypotheses into possible binding modes. Returns: - clutered bit matrix for actives (columns) and hypotheses (rows) - active IDs in column order - hypothesis IDs in row order - 0-based cluster cutoff indices for actives clusters - 0-based cluster cutoff indices for hypotheses clusters @param hypotheses: list of Phase hypotheses @type hypotheses: list of L{hypothesis.PhaseHypothesis} @param num_modes: proposed number of binding modes (i.e. clusters) @type num_modes: int @return: cluster bit matrix (number of hypos x number of actives), active IDs, hypotheis IDs, active cut indices, hypo cut indices @type: tuple, tuple, tuple, tuple, tuple |
Extracts all PHASE_LIGAND_NAME properties from the reference ligand or any actives in the current hypothesis.PhaseHypothesis object.
|
Creates bit matrix dictionary from set of hypotheses, where each key is an active ID, and corresponding values are numpy arrays indicating if that hypothesis (array index) includes the given active (1 it true, 0 otherwise).
|
Validates the size and composition of the bit matrix based on the number of proposed binding modes.
|
Computes Tanimoto coefficient between two bit arrays.
|
Computes distance matrix to use for clustering, where values are given as (1 - Tanimoto coefficient_ij) between rows i and j of the matrix.
|
Performs clustering using the PhpHiCluster class on a given bit matrix for an expected number of clustering modes.
|
Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Tue May 2 06:32:48 2017 | http://epydoc.sourceforge.net |