Copyright | (c) Dominik Schrempf 2018 |
---|---|
License | GPL-3.0-or-later |
Maintainer | dominik.schrempf@gmail.com |
Stability | unstable |
Portability | portable |
Safe Haskell | None |
Language | Haskell2010 |
Creation date: Tue Feb 27 17:27:16 2018.
See Gernhard, T. (2008). The conditioned reconstructed process. Journal of Theoretical Biology, 253(4), 769–778. http://doi.org/10.1016/j.jtbi.2008.04.005.
Mon Feb 4 14:26:11 CET 2019: Adding sampling probability rho. See Article (Stadler2009) Stadler, T. On incomplete sampling under birth–death models and connections to the sampling-based coalescent Journal of Theoretical Biology, Elsevier BV, 2009, 261, 58-66
Documentation
simulate :: ELynx SimulateArguments () Source #
Simulate phylogenetic trees.
nSubSamples :: Ord a => Int -> Seq a -> Int -> Tree e a -> GenIO -> IO [Maybe (Tree e a)] Source #
Extract a random subtree with N
leaves of a tree with M
leaves, where
M>N
(otherwise error). The complete list of leaves (names are assumed to be
unique) has to be provided as a Seq
, and a Set
, so that fast
sub-sampling as well as lookup are fast and so that these data structures do
not have to be recomputed when many sub-samples are requested.