Safe Haskell | None |
---|---|
Language | Haskell2010 |
Bit scores as used by different algorithms in bioinformatics, linguistics, and probably elsewhere.
Basically, the base-2 logarithm of the probability of the input given the model vs the probability of the input given the null model.
S = log_2 (P(seq|model) / P(seq|null))
Synopsis
- newtype Bitscore = Bitscore {}
- prob2Score :: Double -> Double -> Bitscore
- score2Prob :: Double -> Bitscore -> Double
Documentation
Bit score; behaves like a double (deriving Num). In particular, the
algebraic operations behave as expected Bitscore a + Bitscore b ==
Bitscore (a+b)
.
Currently geared towards use as in Infernal
and HMMER
.
Infernal users guide, p.42: log-odds score in log_2 (aka bits).