| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Bio.Motif.Search
Synopsis
- findTFBS :: Monad m => Bkgd -> PWM -> DNA a -> Double -> Bool -> ConduitT i (Int, Double) m ()
- findTFBSWith :: Monad m => Vector Double -> Bkgd -> PWM -> DNA a -> Double -> Bool -> ConduitT i (Int, Double) m ()
- findTFBSSlow :: Monad m => Bkgd -> PWM -> DNA a -> Double -> ConduitT i (Int, Double) m ()
- maxMatchSc :: Bkgd -> PWM -> DNA a -> Double
- optimalScoresSuffix :: Bkgd -> PWM -> Vector Double
Documentation
Arguments
| :: Monad m | |
| => Bkgd | |
| -> PWM | |
| -> DNA a | |
| -> Double | |
| -> Bool | whether to skip ambiguous sequences. Recommend: True in most cases |
| -> ConduitT i (Int, Double) m () |
given a user defined threshold, look for TF binding sites on a DNA sequence, using look ahead search. This function doesn't search for binding sites on the reverse strand
findTFBSSlow :: Monad m => Bkgd -> PWM -> DNA a -> Double -> ConduitT i (Int, Double) m () Source #
use naive search