Sampling phylogenetic tree space with the generalized Gibbs sampler.
The generalized Gibbs sampler (GGS) is a recently developed Markov chain Monte Carlo (MCMC) technique that enables Gibbs-like sampling of state spaces that lack a convenient representation in terms of a fixed coordinate system. This paper describes a new sampler, called the tree sampler, which uses the GGS to sample from a state space consisting of phylogenetic trees. The tree sampler is useful for a wide range of phylogenetic applications, including Bayesian, maximum likelihood, and maximum parsimony methods. A fast new algorithm to search for a maximum parsimony phylogeny is presented, using the tree sampler in the context of simulated annealing. The mathematics underlying the algorithm is explained and its time complexity is analyzed. The method is tested on two large data sets consisting of 123 sequences and 500 sequences, respectively. The new algorithm is shown to compare very favorably in terms of speed and accuracy to the program DNAPARS from the PHYLIP package.
Keith
Jonathan M
JM
Department of Mathematics, University of Queensland, St. Lucia, Qld 4072, Australia. j.keith1@mailbox.uq.edu.au
Adams
Peter
P
Ragan
Mark A
MA
Bryant
Darryn
D
D000465:Algorithms; D003627:Data Interpretation, Statistical; D019143:Evolution, Molecular; D005416:Flavivirus / Q000235:genetics; D008390:Markov Chains; D010802:Phylogeny; D014759:Viral Envelope Proteins / Q000235:genetics
D014759:Viral Envelope Proteins