TreesMatchingSplit

LogTreesMatchingSplit

A, B

<p>Calculates the number of unrooted bifurcated trees that are consistent with
a bipartition split that divides taxa into groups of size <code>A</code> and <code>B</code>.</p>

Searches for phylogenetic trees that are optimal using a user-defined criterion.
Implements Profile Parsimony (Faith and Trueman, 2001) <doi:10.1080/10635150118627>, and
Successive Approximations (Farris, 1969) <doi:10.2307/2412182>.
Handles inapplicable data using the algorithm of Brazeau, Guillerme and Smith
(2019) <doi:10.1093/sysbio/syy083>.

Martin R. Smith

TreeSearch

Phylogenetic Tree Search Using Custom Optimality Criteria

Emmanuel Paradis

Klaus Schliep

Martin Brazeau

TreesMatchingSplit function

<ul>
<li><p><code>LogTreesMatchingSplit</code>: Logarithm of the number of trees matching a split.</p></li>
</ul>

Functions

Number of trees matching a bipartition split — TreesMatchingSplit

Number of trees matching a bipartition split

TreesMatchingSplit: Number of trees matching a bipartition split

Description

Usage

Arguments

Functions