Skip to contents

Strict consensus tree

Source: R/wrappers.R
Strict.Rd

Strict() returns the strict consensus of a set of trees: the tree that contains exactly those splits (clades) present in every input tree (Day 1985; Sokal and Rohlf 1981) .

Usage

Strict(trees)

Arguments

trees

A list of trees, or a multiPhylo object. All entries must share the same leaf labels.

Value

Strict() returns the consensus tree, an object of class phylo, rooted as in the first entry of trees.

Details

This is an alias of TreeTools::Consensus() with p = 1.

References

Day WHE (1985). “Optimal algorithms for comparing trees with labeled leaves.” Journal of Classification, 2(1), 7–28. doi:10.1007/BF01908061 .

Sokal RR, Rohlf FJ (1981). “Taxonomic congruence in the Leptopodomorpha re-examined.” Systematic Zoology, 30(3), 309–325. doi:10.2307/2413252 .

See also

Less conservative summaries: Majority().

Other consensus methods: Adams(), Average(), Frequency(), Greedy(), Local(), Loose(), Majority(), MajorityPlus(), Quartet(), RStar(), Transfer()

Examples

trees <- ape::as.phylo(0:5, 8)
Strict(trees)
#> 
#> Phylogenetic tree with 8 tips and 5 internal nodes.
#> 
#> Tip labels:
#>   t1, t2, t3, t4, t5, t6, ...
#> 
#> Rooted; no branch length.