powered by
Reports whether splits are present or contradicted in a set of reference splits.
CompareSplits(splits, splits2)CompareBipartitions(splits, splits2)
CompareBipartitions(splits, splits2)
A named vector of eight integers, listing the number of unique splits that:
N exist in total; i.e. the number of splits in splits1 plus the number in splits2, equivalent to 2 s + d1 + d2 + r1 + r2;
splits1
splits2
P1 occur in splits1
P2 occur in splits2
s occur in both splits1 and splits2;
d1 occur in splits1 but are contradicted by splits2;
d2 occur in splits2 but are contradicted by splits1;
r1 occur in splits1 only, being neither present in nor contradicted by splits2;
r2 occur in splits2 only, being neither present in nor contradicted by splits1;
RF occur in one tree only; i.e. d1 + d2 + r1 + r2, the Robinson-Foulds distance.
An object that can be coerced into class Splits using as.Splits.
Splits
as.Splits
Splits against which to compare splits.
splits
Martin R. Smith (martin.smith@durham.ac.uk)
Estabrook1985Quartet
Robinson1981Quartet
Equivalent function for quartets: CompareQuartets()
CompareQuartets()
Other element-by-element comparisons: CompareQuartetsMulti(), CompareQuartets(), PairSharedQuartetStatus(), QuartetState(), SharedQuartetStatus(), SplitStatus()
CompareQuartetsMulti()
PairSharedQuartetStatus()
QuartetState()
SharedQuartetStatus()
SplitStatus()
splits1 <- TreeTools::BalancedTree(8) splits2 <- TreeTools::PectinateTree(8) CompareSplits(splits1, splits2)
Run the code above in your browser using DataLab