Despite being found in all presently sequenced genomes, the evolution of tandemly repeated sequences has only just begun to be understood. We can represent the duplication history of tandemly repeated sequences with duplication trees. Most phylogenetic techniques need to be modified to be used on duplication trees.
Due to gene loss, it is not always possible to reconstruct the duplication history of a tandemly repeated sequence. This thesis addresses this problem by providing a polynomial-time locally optimal algorithm to reconstruct the duplication history of a tandemly repeated sequence in the presence of gene loss.
Supertree methods cannot be directly applied to duplication trees. A polynomial-time algorithm that takes a forest of ordered phylogenies and looks for a super duplication tree is presented. If such a super duplication tree is found then the algorithm constructs the super duplication tree. However, the algorithm does not always find a super duplication tree when one exists.
The SPR topological rearrangement in its current form cannot be used on duplication trees. The necessary modifications are made to an agreement forest so that the SPR operation can be used on duplication trees. This operation is called the duplication rooted subtree prune and regraft operation (DrSPR). The size of the DrSPR neighbourhood is calculated for simple duplication trees and the tree shapes that maximize and minimize this are given.
| Identifer | oai:union.ndltd.org:canterbury.ac.nz/oai:ir.canterbury.ac.nz:10092/2661 |
| Date | January 2009 |
| Creators | Snook, Michael James |
| Publisher | University of Canterbury. Mathematics & Statistics |
| Source Sets | University of Canterbury |
| Language | English |
| Detected Language | English |
| Type | Electronic thesis or dissertation, Text |
| Rights | Copyright Michael James Snook, http://library.canterbury.ac.nz/thesis/etheses_copyright.shtml |
| Relation | NZCU |
Page generated in 0.0021 seconds