Safe Haskell | None |
---|---|
Language | Haskell98 |
Collection of functions for the collection of fragments for the diversity calculations.
- fragmentPos :: Bool -> Int -> [(Position, Char)] -> [(Position, Fragment)]
- generatePositionMap :: Bool -> Int -> Int -> Bool -> Window -> FastaSequence -> PositionMap
Documentation
fragmentPos :: Bool -> Int -> [(Position, Char)] -> [(Position, Fragment)] Source
Generates fragment list from string of "win" length. This version differs from normal as it takes a tuple with the position as the first entry. Is in tail recursive form
generatePositionMap :: Bool -> Int -> Int -> Bool -> Window -> FastaSequence -> PositionMap Source
Generate the frequency from a FastaSequence