parsimony, maximum likelihood search, trees
The performance of maximum likelihood searches can be boosted by using the most parsimonious tree as a starting point for the search. The time spent in performing the parsimony search to find this starting tree is insignificant compared to the time spent in the maximum likelihood search, leading to an overall gain in search time. These parsimony boosted maximum likelihood searches lead to topologies with scores statisitically similar to the unboosted searches, but in less time.
Original Publication Citation
Using Parsimony to Guide Maximum Likelihood Searches, Kenneth Sundberg, Timothy O'Connor, Hyrum Carroll, Mark Clement, and Quinn Snell, IEEE Symposium on BioInformatics and BioEngineering (BIBE), Washington, D.C., October 27, pp 774-779.
BYU ScholarsArchive Citation
Carroll, Hyrum; Clement, Mark J.; O'Connor, Timothy; Snell, Quinn O.; and Sundberg, Kenneth, "Using Parsimony to Guide Maximum Likelihood Searches" (2007). All Faculty Publications. 230.
Physical and Mathematical Sciences
© 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Copyright Use Information