Parsimony accelerated Maximum Likelihood searches. (16th June 2008)

• Record Type: Journal Article
• Authors: Sundberg, Kenneth; O'Connor, Timothy; Carroll, Hyrum; Clement, Mark; , Quinn Snell
• Is Part Of: International journal of computational biology and drug design. Volume 1:Number 1(2008)
• Page Start: 74
• Page End: 87
• Publication Date: 2008-06-16
• Subjects: parsimony -- maximum likelihood -- ML trees -- ML searches -- phylogenetic search -- biological research; Computational biology -- Periodicals; Drugs -- Design -- Periodicals; 570.285
• Languages: English
• ISSNs: 1756-0756

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.