sum.partitions

a martix with p rows and K column. Each row contains the number of
marqued partition in 1

a martix with p rows and K column. Each row contains the number of
partition in 1

an integer. The number of daughters of a node.

an integer. The minimum cadinal of a subset allowed.


<code>sum.partitions</code> returns the sum on all I subset of [1,p], with |I|>m.


internal


Implementation of the automatic shift detection method for
Brownian Motion (BM) or Ornstein–Uhlenbeck (OU) models of trait evolution on
phylogenies. Some tools to handle equivalent shifts configurations are also
available.

Paul Bastide

PhylogeneticEM

Automatic Shift Detection using a Phylogenetic EM

sum.partitions function

a martix with p rows and K column. Each row contains the number of
marqued partition in 1<=k<=K groups for one of the p children of a
given node.

a martix with p rows and K column. Each row contains the number of
partition in 1<=k<=K groups for one of the p children of a given node

sum.partitions: Sum on all subsets.

Description

Usage

Arguments

Value

Details