rankDiscriminatoryStats: Ranking of the summary statistics of two lists of trees...

In Leonardini/treeCentrality: Computation of Network Science Statistics on Trees in Linear Time

Description

rankDiscriminatoryStats ranks different summary stats of rooted binary phylo trees by discriminatory power.

Usage

rankDiscriminatoryStats(tList1, tList2, basic = TRUE, network = TRUE,
  spectral = TRUE, unitMean = TRUE)

Arguments

tList1	A list of trees of class phylo. The trees should be binary and rooted; else they are coerced
tList2	A list of trees of class phylo. The trees should be binary and rooted; else they are coerced
basic	A logical scalar; if TRUE, computes the basic tree statistics for the lists (lengths must be equal).
network	A logical scalar; if TRUE, computes the network statistics for the lists (lengths must be equal).
spectral	A logical scalar; if TRUE, computes the spectral statistics for the lists (lengths must be equal).
unitMean	A logical scalar; if TRUE, the tree's branch lengths are scaled to unit mean beforehand.

Value

A named list containing the statistics for the first set of trees, the second set of trees, and p-values.

See Also

Other drivers for computing summary statistics: computeBasicStats, computeLMStats, computeNetworkStats, computeSpectralStats

Leonardini/treeCentrality documentation built on April 7, 2020, 3:18 p.m.