Now showing items 1-2 of 2
Fast computation of compatibility for phylogenies with nested taxa
(University of Canterbury, 2005)
Typically, supertree methods combine a collection of source trees in which just the leaves are labelled by taxa. In such methods the resulting supertree is also leaf-labelled. An underlying assumption in these methods is ...
Quartet compatibility and the quartet graph
(University of Canterbury. Dept. of Mathematics and Statistics, 2005)
A collection P of leaf-labelled trees is compatible if there exists a single leaf-labelled tree that displays each of the trees in P. Despite its difficulty, determining the compatibility of P is a fundamental task in ...