sum.partitions

<code>sum.partitions</code> returns the sum on all I subset of [1,p], with |I|&gt;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. See Bastide et al. (2017) <doi:10.1111/rssb.12206> and
Bastide et al. (2018) <doi:10.1093/sysbio/syy005>.

Paul Bastide

PhylogeneticEM

Automatic Shift Detection using a Phylogenetic EM

Mahendra Mariadassou

sum.partitions function

<dl><dt>A</dt>
<dd>a matrix with p rows and K column. Each row contains the number of
marked partition in 1&lt;=k&lt;=K groups for one of the p children of a
given node.</dd>
<dt>N</dt>
<dd>a matrix with p rows and K column. Each row contains the number of
partition in 1&lt;=k&lt;=K groups for one of the p children of a given node</dd>
<dt>K</dt>
<dd>an integer. The number of groups wanted.</dd>
<dt>p</dt>
<dd>an integer. The number of daughters of a node.</dd>
<dt>m</dt>
<dd>an integer. The minimum cardinal of a subset allowed.</dd></dl>

Arguments

Sum on all subsets. — sum.partitions

<dl>

<dt>A</dt>
<dd>a matrix with p rows and K column. Each row contains the number of
marked partition in 1&lt;=k&lt;=K groups for one of the p children of a
given node.</dd>


<dt>N</dt>
<dd>a matrix with p rows and K column. Each row contains the number of
partition in 1&lt;=k&lt;=K groups for one of the p children of a given node</dd>


<dt>K</dt>
<dd>an integer. The number of groups wanted.</dd>


<dt>p</dt>
<dd>an integer. The number of daughters of a node.</dd>


<dt>m</dt>
<dd>an integer. The minimum cardinal of a subset allowed.</dd>

</dl>

sum.partitions: Sum on all subsets.

Description

Usage

Value

Arguments

Details