Safe Haskell | None |
---|---|
Language | Haskell2010 |
- rankList :: Ord a => Sort -> [a] -> [Double]
- rankProduct :: Sort -> [Entity] -> [RankProductEntity]
- prerankProduct :: [RankEntity] -> [RankProductEntity]
- rankProductPermutation :: Permutations -> Sort -> [Entity] -> IO [(RankProductEntity, PValue)]
Documentation
rankProduct :: Sort -> [Entity] -> [RankProductEntity] Source #
Get the rank product of a list of Entity. Ascending ranks the lowest value as 1 while Descending ranks the highest value as 1.
prerankProduct :: [RankEntity] -> [RankProductEntity] Source #
Get the rank product of a pre-ranked data set [[ranked values for a gene in different data sets]].
rankProductPermutation :: Permutations -> Sort -> [Entity] -> IO [(RankProductEntity, PValue)] Source #
Get the rank product of a list of Entity as well as the permutation p-value. Ascending ranks the lowest value as 1 while Descending ranks the highest value as 1.