## Search

Now showing items 1-4 of 4

#### Unicyclic Networks: Compatibility and Enumeration

(University of Canterbury. Mathematics and Statistics., 2006)

Graphs obtained from a binary leaf labelled (‘phylogenetic’)
tree by adding an edge so as to introduce a cycle provide a
useful representation of hybrid evolution in molecular evolutionary biology.
This class of graphs ...

#### Fast Computation of Supertrees for Compatible Phylogenies with Nested Taxa

(University of Canterbury. Mathematics and Statistics., 2006)

Typically, supertree methods combine a collection of source trees in which just the leaves are labeled by taxa. In such methods the resulting supertree is also leaf labeled. An underlying assumption in these methods is ...

#### The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees

(University of Canterbury. Mathematics and Statistics., 2000)

Given a set of trees with leaves labelled from a set L, is there a tree T with leaves labelled by L such that each of the given trees is homeomorphic to a subtree of T? This question is known to be NP-complete in general, ...

#### Tree reconstruction via a closure operation on partial splits

(Springer-VerlagUniversity of Canterbury. Mathematics and Statistics., 2001)

A fundamental problem in biological classi cation is the reconstruction of phylogenetic trees for a set X of species from a collection of either subtrees or qualitative characters. This task is equivalent to tree reconstruction ...