An Approximation Algorithm for Character Compatibility and Fast Quartet-based Phylogenetic Tree Comparison
| dc.contributor.author | Tsang, John | en |
| dc.date.accessioned | 2006-08-22T14:22:56Z | |
| dc.date.available | 2006-08-22T14:22:56Z | |
| dc.date.issued | 2000 | en |
| dc.date.submitted | 2000 | en |
| dc.description.abstract | Phylogenetic analysis, or the inference of evolutionary history is done routinely by biologists and is one of the most important problems in systematic biology. In this thesis, we study two computational problems in the area. First, we study the evolutionary tree reconstruction problem under the character compatibility (CC) paradigm and give a polynomial time approximation scheme (PTAS) for a variation of the formulation called fractional character compatibility (FCC), which has been proven to be NP-hard. We also present a very simple algorithm called the Ordinal Split Method (OSM) to generate bipartitions given sequence data, which can be served as a front-end to the PTAS. The performance of the OSM and the validity of the FCC formulation are studied through simulation experiments. The second part of this thesis presents an efficient algorithm to compare evolutionary trees using the quartet metric. Different evolutionary hypothesis arises when different data sets are used or when different tree inference methods are applied to the same data set. Tree comparisons are routinely done by biologists to evaluate the quality of their tree inference experiments. The quartet metric has many desirable properties but its use has been hindered by its relatively heavy computational requirements. We address this problem by giving the first O(n^2) time algorithm to compute the quartet distance between two evolutionary trees. | en |
| dc.format | application/pdf | en |
| dc.format.extent | 520818 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/10012/1110 | |
| dc.language.iso | en | en |
| dc.pending | false | en |
| dc.publisher | University of Waterloo | en |
| dc.rights | Copyright: 2000, Tsang, John. All rights reserved. | en |
| dc.subject | Computer Science | en |
| dc.subject | phylogenetic analysis | en |
| dc.subject | phylogeny reconstruction | en |
| dc.subject | combinatorial algorithms | en |
| dc.subject | algorithm analysis | en |
| dc.subject | bioinformatics | en |
| dc.title | An Approximation Algorithm for Character Compatibility and Fast Quartet-based Phylogenetic Tree Comparison | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | School of Computer Science | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |
Files
Original bundle
1 - 1 of 1