Phylogenetic trees represent theoretical evolutionary relationships among various species. Mathematically they can be described as weighted binary trees and the leaves represent the taxa being compared. One major problem in mathematical biology is the reconstruction of these trees. We already know that trees on the leaf set X can be uniquely constructed from splits, which are bipartitions of X. The question I explore in this thesis is whether reconstruction of a tree is possible from subsplits, or partial split information. The major result of this work is a constructive algorithm which allows us to determine whether a given set of subsplits will realize a tree and, if so, what the tree looks like.
| Identifer | oai:union.ndltd.org:CLAREMONT/oai:scholarship.claremont.edu:hmc_theses-1174 |
| Date | 01 May 2005 |
| Creators | Kashiwada, Akemi |
| Publisher | Scholarship @ Claremont |
| Source Sets | Claremont Colleges |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | HMC Senior Theses |
Page generated in 0.0051 seconds