Title: Parsimony accelerated Maximum Likelihood searches

Authors: Kenneth Sundberg, Timothy O'Connor, Hyrum Carroll, Mark Clement, Quinn Snell

Addresses: Computer Science Department, Brigham Young University, USA. ' University of Cambridge, UK. ' Computer Science Department, Brigham Young University, USA. ' Computer Science Department, Brigham Young University, USA. ' Computer Science Department, Brigham Young University, USA

Abstract: Phylogenetic search is a key tool used in a variety of biological research endeavours. However, this search problem is known to be computationally difficult, due to the astronomically large search space, making the use of heuristic methods necessary. The performance of heuristic methods for finding Maximum Likelihood (ML) trees can be improved by using parsimony as an initial estimator for ML. The time spent in performing the parsimony search to boost performance is insignificant compared to the time spent in the ML search, leading to an overall gain in search time. These parsimony boosted ML searches lead to topologies with scores statistically similar to the unboosted searches, but in less time.

Keywords: parsimony; maximum likelihood; ML trees; ML searches; phylogenetic search; biological research.

DOI: 10.1504/IJCBDD.2008.018711

International Journal of Computational Biology and Drug Design, 2008 Vol.1 No.1, pp.74 - 87

Published online: 14 Jun 2008 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article