April 03, 2006
M.S. ThesSyllabus for all sect
Daniel Sneddon will be proposing his thesis topic, "Recursive Tree-Bisection Recombination," on Monday, April 10 at 9:00a.m. in the CS Conference Room. His adviser is Dr. Quinn Snell. All are invited to attend!
Due to the exponential search space and the computational complexity involved in calculating the most parsimonious phylogeny, search heuristics must be used. These heuristics involve different ways of breaking and recombining the tree to create a new tree. This new tree is scored and the best tree found during the search is kept. We introduce a new method for optimizing trees by recursively optimizing subtrees. We introduce RTBR as means of finding better phylogenetic trees in fewer search iterations. We examine the effectiveness of RTBR by comparing the effect of combining optimized subtrees to that of combining sub-optimal subtrees. The score at each search iteration is also compared between RTBR and TBR to show that RTBR will find better phylogenetic trees in fewer iterations than TBR.
Posted by ringger at April 3, 2006 08:32 AM
Post a comment
Thanks for signing in, . Now you can comment. (sign out)(If you haven't left a comment here before, you may need to be approved by the site owner before your comment will appear. Until then, it won't appear on the entry. Thanks for waiting.)