Hu, Mike2006-08-222006-08-2220022002http://hdl.handle.net/10012/1144In 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.application/pdf557342 bytesapplication/pdfenCopyright: 2002, Hu, Mike. All rights reserved.Computer SciencePhylogeneticsEvolutionQuartet MethodCombinatorial AlgorithmMaximum LikelihoodMaster Thesis