Using Parsimony to Guide Maximum Likelihood Searches

—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 statistically similar to the unboosted searches, but in less time.

• Type: Conference
• Year: 2007
• Where: BIBE
• Authors: Kenneth Sundberg, Timothy O'Connor, Hyrum Carroll, Mark J. Clement, Quinn Snell
• Keywords: BIBE 2007, Bioinformatics, Maximum Likelihood Searches, Parsimony Search, Search Time