| Copyright | (c) Dominik Schrempf 2021 |
|---|---|
| License | GPL-3.0-or-later |
| Maintainer | dominik.schrempf@gmail.com |
| Stability | unstable |
| Portability | portable |
| Safe Haskell | None |
| Language | Haskell2010 |
ELynx.Data.Alphabet.DistributionDiversity
Contents
Description
Creation date: Mon Feb 25 13:32:56 2019.
Synopsis
- entropy :: Vector v Double => v Double -> Double
- kEffEntropy :: Vector v Double => v Double -> Double
- homoplasy :: Vector v Double => v Double -> Double
- kEffHomoplasy :: Vector v Double => v Double -> Double
- frequencyCharacters :: (Vector v Character, Vector v Int, Vector v Double) => AlphabetSpec -> v Character -> v Double
Entropy
kEffEntropy :: Vector v Double => v Double -> Double Source #
Effective number of used characters measured using entropy. The result
only makes sense when the sum of the array is 1.0.
Homoplasy
homoplasy :: Vector v Double => v Double -> Double Source #
Probability of homoplasy of vector. The result is the probability of binomially sampling the same character twice and only makes sense when the sum of the array is 1.0.
kEffHomoplasy :: Vector v Double => v Double -> Double Source #
Effective number of used characters measured using homoplasy. The result
only makes sense when the sum of the array is 1.0.
Count characters
frequencyCharacters :: (Vector v Character, Vector v Int, Vector v Double) => AlphabetSpec -> v Character -> v Double Source #
For a given code vector of characters, calculate frequency of characters. The input vector has arbitrary length (most often the number of sequences in an alignment), the length of the output vector is the number of characters in the alphabet.