A Collapsing Method for Efficient Recovery of Optimal Edges

dc.contributor.author	Hu, Mike	en
dc.date.accessioned	2006-08-22 14:26:59 (GMT)
dc.date.available	2006-08-22 14:26:59 (GMT)
dc.date.issued	2002	en
dc.date.submitted	2002	en
dc.identifier.uri	http://hdl.handle.net/10012/1144
dc.description.abstract	In this thesis we present a novel algorithm, <I>HyperCleaning</I>, for effectively inferring phylogenetic trees. The method is based on the quartet method paradigm and is guaranteed to recover the best supported edges of the underlying phylogeny based on the witness quartet set. This is performed efficiently using a collapsing mechanism that employs memory/time tradeoff to ensure no loss of information. This enables <I>HyperCleaning</I> to solve the relaxed version of the Maximum-Quartet-Consistency problem feasibly, thus providing a valuable tool for inferring phylogenies using quartet based analysis.	en
dc.format	application/pdf	en
dc.format.extent	557342 bytes
dc.format.mimetype	application/pdf
dc.language.iso	en	en
dc.publisher	University of Waterloo	en
dc.rights	Copyright: 2002, Hu, Mike. All rights reserved.	en
dc.subject	Computer Science	en
dc.subject	Phylogenetics	en
dc.subject	Evolution	en
dc.subject	Quartet Method	en
dc.subject	Combinatorial Algorithm	en
dc.subject	Maximum Likelihood	en
dc.title	A Collapsing Method for Efficient Recovery of Optimal Edges	en
dc.type	Master Thesis	en
dc.pending	false	en
uws-etd.degree.department	School of Computer Science	en
uws-etd.degree	Master of Mathematics	en
uws.typeOfResource	Text	en
uws.peerReviewStatus	Unreviewed	en
uws.scholarLevel	Graduate	en