| 1 |
{-# LANGUAGE RecursiveDo #-} |
| 2 |
module Model where |
| 3 |
|
| 4 |
import Probability |
| 5 |
import Tree |
| 6 |
import Tree.Newick |
| 7 |
import qualified Data.Text as Text |
| 8 |
import Control.Monad.Fix -- should be unneeded |
| 9 |
|
| 10 |
nLeaves = 3 |
| 11 |
|
| 12 |
allStrings = [ c : s | s <- "" : allStrings, c <- ['a'..'j'] ] |
| 13 |
|
| 14 |
allTexts = fmap Text.pack allStrings |
| 15 |
|
| 16 |
model = do |
| 17 |
tree <- sample $ uniformTimeTree 1 nLeaves |
| 18 |
let labels = take nLeaves $ zip [0..] allTexts |
| 19 |
ltree = addLabels labels tree |
| 20 |
let pr = uniformTimeTreePr 1 nLeaves ltree |
| 21 |
|
| 22 |
let ps = map (\n -> show (n, parentNode tree n)) [0 .. numNodes tree - 1] |
| 23 |
|
| 24 |
rec let mu node = case parentNode tree node of |
| 25 |
Nothing -> 0 |
| 26 |
Just node -> xs !! node |
| 27 |
xs <- sample $ independent [ normal (mu node) 1 | node <- nodes tree ] |
| 28 |
-- can we _observe_ from this? -- why or why not? |
| 29 |
|
| 30 |
return ["tree" %=% writeNewick ltree] --,"pr" %=% pr, "xs" %=% xs, "ps" %=% ps] |
| 31 |
|
| 32 |
main logDir = do |
| 33 |
return model |