Copyright | 2021 Dominik Schrempf |
---|---|
License | GPL-3.0-or-later |
Maintainer | dominik.schrempf@gmail.com |
Stability | unstable |
Portability | portable |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Creation date: Thu Jan 24 09:02:25 2019.
Synopsis
- type ProbMatrix = Matrix R
- type State = Int
- probMatrix :: RateMatrix -> Double -> ProbMatrix
- jump :: StatefulGen g m => State -> ProbMatrix -> g -> m State
Documentation
type ProbMatrix = Matrix R Source #
A probability matrix, P_ij(t) = Pr (X_t = j | X_0 = i).
probMatrix :: RateMatrix -> Double -> ProbMatrix Source #
The important matrix that gives the probabilities to move from one state to another in a specific time (branch length).
jump :: StatefulGen g m => State -> ProbMatrix -> g -> m State Source #
Move from a given state to a new one according to a transition probability matrix .
This function is the bottleneck of the simulator and takes up most of the computation time.