|
|
|
|
| Synopsis |
|
|
|
| Documentation |
|
|
| This is a struct for containing a set of hashing functions
| | Constructors | | HF | | | hash :: SeqData -> Offset -> Maybe k | calculates the hash at a given offset in the sequence
| | hashes :: SeqData -> [(k, Offset)] | calculate all hashes from a sequence, and their indices
| | ksort :: [k] -> [k] | for sorting hashes
|
|
|
|
|
|
| Adds a default hashes function to a HashF, when hash is defined.
|
|
|
| Contigous constructs an int/eger from a contigous k-word.
|
|
|
| Like contigous, but returns the same hash for a word and its reverse complement.
|
|
|
|
|
| Like rcontig, but ignoring monomers (i.e. arbitrarily long runs of a single nucelotide
are treated the same a single nucleotide.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| Produced by Haddock version 2.6.1 |