elynx-markov-0.7.1.0: Simulate molecular sequences along trees
Copyright2021 Dominik Schrempf
LicenseGPLv3
Maintainerdominik.schrempf@gmail.com
Stabilityunstable
Portabilitynon-portable (not tested)
Safe HaskellSafe-Inferred
LanguageHaskell2010

ELynx.Simulate.MarkovProcessAlongTree

Description

Calculate transition probability matrices, map rate matrices on trees, populate a tree with states according to a stationary distribution, etc.

The implementation of the Markov process is more than basic and can be improved in a lot of ways.

Synopsis

Single rate matrix.

simulate :: StatefulGen g m => Int -> StationaryDistribution -> ExchangeabilityMatrix -> Tree Double -> g -> m (Tree [State]) Source #

Simulate a number of sites for a given substitution model. Keep states at internal nodes. The result is a tree with the list of simulated states as node labels.

simulateAndFlatten :: StatefulGen g m => Int -> StationaryDistribution -> ExchangeabilityMatrix -> Tree Double -> g -> m [[State]] Source #

Simulate a number of sites for a given substitution model. Only the states at the leafs are retained. The states at internal nodes are removed. This has a lower memory footprint.

Mixture models.

simulateMixtureModel :: StatefulGen g m => Int -> Vector Double -> Vector StationaryDistribution -> Vector ExchangeabilityMatrix -> Tree Double -> g -> m (Tree [State]) Source #

Simulate a number of sites for a given set of substitution models with corresponding weights. Keep states at internal nodes. See also simulate.

simulateAndFlattenMixtureModel Source #

Arguments

:: StatefulGen g m 
=> Int 
-> Vector Double 
-> Vector StationaryDistribution 
-> Vector ExchangeabilityMatrix 
-> Tree Double 
-> g 
-> m ([Int], [[State]])

(IndicesOfComponents, [SimulatedSequenceForEachTip])

Simulate a number of sites for a given set of substitution models with corresponding weights. Forget states at internal nodes. See also simulateAndFlatten.