| Trees | Indices | Help |
|
|---|
|
|
object --+
|
Pharm2DSig
**Notes on Use**
- After any changes, the Init() method should be called
**Important Attributes**
- patterns: a list of SmartsPatterns used to determine the features
patterns can be initialized directly from the list or from a list of SMARTS
strings
- bins: the list of distance bins to be used.
- minCount/maxCount: the minimum/maximum number of points to be included
in a pharmacophore
- shortestPathsOnly: toggles limiting the path-discovery algorithms to
only find the shortest paths between 2 features.
- includeBondOrder: toggles inclusion of bond order in consideration of
shortest paths.
**Limitations of Current Implementation**
- All distances have the same numbers of bins
- Only shortest-path matches are implemented
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
Inherited from |
|||
|
|||
|
Inherited from |
|||
|
|||
x.__init__(...) initializes x; see x.__class__.__doc__ for signature
|
Internal use only
|
used by the pickling machinery
|
used by the pickling machinery
|
Initializes internal parameters. This **must** be called after
making any changes to the signature
**Arguments**
- createBitVect: (optional) if this is nonzero, the bit vector
used to store the on bits will be allocated. Otherwise the
existing bit vect will be reused (it better be big enough)
|
returns the index for a pharmacophore described using a set of
patterns and distances
**Arguments***
- patts: a sequence of pattern indices
- dists: a sequence of distance between the patterns, only the
unique distances should be included, and they should be in the
order defined in Utils.
- checkPatts: (optional) if nonzero, the pattern vector is
checked to ensure it is sorted
**Returns**
the integer bit index
|
sets the bit defined by a collection of patterns and distances
**Arguments***
- patts: a sequence of pattern indices
- dists: a sequence of distance between the patterns, only the
unique distances should be included, and they should be in the
order defined in Utils.
- checkPatts: (optional) if nonzero, the pattern vector is
checked to ensure it is sorted
**Returns**
the original status of the bit (whether or not it was set)
|
returns the value of a
**Arguments***
- patts: a sequence of pattern indices
- dists: a sequence of distance between the patterns, only the
unique distances should be included, and they should be in the
order defined in Utils.
- checkPatts: (optional) if nonzero, the pattern vector is
checked to ensure it is sorted
**Returns**
whether or not the bit is set
|
returns our on bits
|
returns information about the given bit
**Arguments**
- idx: the bit index to be considered
**Returns**
a 3-tuple:
1) the number of points in the pharmacophore
2) the proto-pharmacophore (tuple of pattern indices)
3) the scaffold (tuple of distance indices)
|
returns HTML with a description of the bit
**Arguments**
- bitIdx: an integer bit index
- includeBins: (optional) if nonzero, information about the bins will be
included as well
- fullPage: (optional) if nonzero, html headers and footers will
be included (so as to make the output a complete page)
**Returns**
a string with the HTML
|
OBSOLETE: this has been rewritten in C++ Internal use only Returns the index of a bin defined by a set of distances. **Arguments** - dists: a sequence of distances (not binned) - bins: a sorted sequence of distance bins (2-tuples) - scaffolds: a list of possible scaffolds (bin combinations) **Returns** an integer bin index **Note** the value returned here is not an index in the overall signature. It is, rather, an offset of a scaffold in the possible combinations of distance bins for a given proto-pharmacophore. |
| Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0beta1 on Sat May 24 08:37:05 2008 | http://epydoc.sourceforge.net |