BioInf.GeneCluEDO.EdgeProb

Documentation

aMinDist :: Monad m => ScoreMatrix Double -> SigEdgeProb m Double Double (From :. To) (Int :. To)

Minimal distance algebra

TODO The two Ints are the indices of the nodes and could be replaced?

aInside :: Monad m => ScoreMatrix (Log Double) -> SigEdgeProb m (Log Double) (Log Double) (From :. To) (Int :. To)

Before using aInside the ScoreMatrix needs to be scaled appropriately! Due to performance reasons we don't want to do this within aInside.

type TF1 x = TwITbl Id Unboxed EmptyOk (BS1 First I) x

type TL1 x = TwITbl Id Unboxed EmptyOk (BS1 Last I) x

type EB x = TwITbl Id Unboxed EmptyOk (EdgeBoundary I) x

type BF1 x b = TwITblBt Unboxed EmptyOk (BS1 First I) x Id Id b

type BL1 x b = TwITblBt Unboxed EmptyOk (BS1 Last I) x Id Id b

type BEB x b = TwITblBt Unboxed EmptyOk (EdgeBoundary I) x Id Id b

edgeProbPartFun :: Double -> ScoreMatrix Double -> [(EdgeBoundary I, Log Double)]

Extract the individual partition scores.

edgeProbScoreMatrix :: Unbox t => ScoreMatrix t -> [(EdgeBoundary I, Log Double)] -> ScoreMatrix (Log Double)

Turn the edge probabilities into a score matrix.