Safe Haskell | Safe-Inferred |
---|
- data HashF k = HF {}
- genkeys :: HashF k -> HashF k
- contigous :: (Integral k, Show k, Eq k) => Int -> HashF k
- rcontig :: (Integral k, Show k, Eq k) => Int -> HashF k
- compact :: SeqData -> [SeqData]
- rcpacked :: (Integral k, Show k, Eq k) => Int -> HashF k
- type Shape = String
- gapped :: Integral k => Shape -> HashF k
- isN :: Char -> Bool
- n2k :: (Integral k, Show k, Eq k) => Int -> SeqData -> k
- n2i' :: (Num a, Show a, Eq a) => a -> SeqData -> a
- k2n :: (Integral k, Show k, Eq k) => Int -> k -> SeqData
- k2n' :: (Integral a, Integral a1, Show a, Show a1) => a -> a1 -> String
- val :: (Num t, Show t, Eq t) => Char -> t
- unval :: (Num a, Show a, Eq a) => a -> Char
- complement :: Char -> Char
Documentation
This is a struct for containing a set of hashing functions
contigous :: (Integral k, Show k, Eq k) => Int -> HashF kSource
Contigous constructs an int/eger from a contigous k-word.
rcontig :: (Integral k, Show k, Eq k) => Int -> HashF kSource
Like contigous
, but returns the same hash for a word and its reverse complement.
rcpacked :: (Integral k, Show k, Eq k) => Int -> HashF kSource
Like rcontig
, but ignoring monomers (i.e. arbitrarily long runs of a single nucelotide
are treated the same a single nucleotide.
complement :: Char -> CharSource