Home | Trees | Indices | Help |
|
---|
|
object --+ | core.AbstractContainer --+ | core.AbstractNIContainer --+ | object --+ | | | AbstractEntity --+ | Chain
Represents a polymeric chain. Provides list-like and rank-based access to the residues in the chain:
>>> chain[0] <ProteinResidue [1]: SER None> >>> chain.residues[1] <ProteinResidue [1]: SER None>
You can also access residues by their PDB sequence number:
>>> chain.find(sequence_number=5, insertion_code='A') <ProteinResidue [1]: SER 5A>
Nested Classes | |
Inherited from |
Instance Methods | |||
|
|||
|
|||
|
|||
SuperimposeInfo |
|
||
Chain |
|
||
|
|||
Residue |
|
||
float |
|
||
Chain |
|
||
SuperimposeInfo |
|
||
float |
|
||
SuperimposeInfo |
|
||
Inherited from Inherited from Inherited from Inherited from |
Static Methods | |||
Chain |
|
Class Variables | |
__abstractmethods__ =
|
Properties | |
str |
accession Accession number |
csb.core.enum |
alphabet Sequence alphabet corresponding to the current chain type |
str |
entry_id Accession number + chain ID |
bool |
has_torsion True if Chain.compute_torsion had been invoked
|
str |
header FASTA header in PDB format |
str |
id Chain's ID |
iterator of AbstractEntity |
items Iterator over all immediate children of the entity |
int |
length Number of residues |
int |
molecule_id PDB MOL ID of this chain |
str |
name Chain name |
ChainResiduesCollection |
residues Rank-based access to Chain's Residues |
SecondaryStructure |
secondary_structure Secondary structure (if available) |
str |
sequence Chain sequence |
TorsionAnglesCollection |
torsion Torsion angles |
enum item |
type Chain type - any member of SequenceTypes |
Inherited from |
Method Details |
x.__init__(...) initializes x; see help(type(x)) for signature
|
|
repr(x)
|
Align R, t = self.superimpose(other, what=['CA']) other.transform(R, t)
|
Make a deep copy of the chain. If this chain is part of a structure, detach from it.
|
Iterate over all residues in the chain, compute and set their torsion property.
|
Get a residue by its original Residue Sequence Number and Insertion Code.
|
Create a new chain from an existing sequence.
|
Compute the C-alpha RMSD against another chain (assuming equal length). Chains are superimposed with Least Squares Fit / Singular Value Decomposition.
|
Extract a subchain defined by [start, end]. If clone is True, this is a deep copy of the chain. Otherwise same as:
>>> chain.residues[start : end + 1]
but coordinates are checked and a Chain instance is returned.
|
Find the optimal fit between
>>> other.transform(rotation_matrix, translation_vector)
will result in
|
Compute the C-alpha TM-Score against another chain (assuming equal chain length and optimal configuration - no fitting is done).
|
Find the optimal fit between
>>> other.transform(rotation_matrix, translation_vector)
will result in
|
Property Details |
accessionAccession number
|
alphabetSequence alphabet corresponding to the current chain type
|
entry_idAccession number + chain ID
|
has_torsionTrue if
|
headerFASTA header in PDB format
|
idChain's ID
|
itemsIterator over all immediate children of the entity
|
lengthNumber of residues
|
molecule_idPDB MOL ID of this chain
|
nameChain name
|
residuesRank-based access to Chain's Residues
|
secondary_structureSecondary structure (if available)
|
sequenceChain sequence
|
torsionTorsion angles
|
typeChain type - any member of SequenceTypes
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Tue Jul 4 20:19:05 2017 | http://epydoc.sourceforge.net |