Convert a sequence into a representation of ambiguous motifs (schemas).
This takes a sequence, and returns the number of times specified
motifs are found in the sequence. This lets you represent a sequence
as just a count of (possibly ambiguous) motifs.
Methods
|
|
__init__
representation
|
|
__init__
|
__init__ (
self,
schemas,
ambiguous_converter,
)
Initialize the coder to convert sequences
Arguments:
|
|
representation
|
representation ( self, sequence )
Represent the given input sequence as a bunch of motif counts.
Arguments:
This takes the sequence, searches for the motifs within it, and then
returns counts specifying the relative number of times each motifs
was found. The frequencies are in the order the original motifs were
passed into the initializer.
|
|