Accessibility navigation


Detecting recombination in 4-taxa DNA sequence alignments with Bayesian hidden Markov models and Markov chain Monte Carlo

Husmeier, D. and McGuire, G. (2003) Detecting recombination in 4-taxa DNA sequence alignments with Bayesian hidden Markov models and Markov chain Monte Carlo. Molecular Biology and Evolution, 20 (3). pp. 315-337. ISSN 0737-4038

Full text not archived in this repository.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1093/molbev/msg039

Abstract/Summary

This article presents a statistical method for detecting recombination in DNA sequence alignments, which is based on combining two probabilistic graphical models: (1) a taxon graph (phylogenetic tree) representing the relationship between the taxa, and (2) a site graph (hidden Markov model) representing interactions between different sites in the DNA sequence alignments. We adopt a Bayesian approach and sample the parameters of the model from the posterior distribution with Markov chain Monte Carlo, using a Metropolis-Hastings and Gibbs-within-Gibbs scheme. The proposed method is tested on various synthetic and real-world DNA sequence alignments, and we compare its performance with the established detection methods RECPARS, PLATO, and TOPAL, as well as with two alternative parameter estimation schemes.

Item Type:Article
Refereed:Yes
Divisions:Faculty of Life Sciences > School of Biological Sciences
ID Code:10792
Uncontrolled Keywords:phylogeny, DNA sequence alignment, recombination, hidden Markov models, Markov chain Monte Carlo, MULTIPLE ALIGNMENTS, MAXIMUM-LIKELIHOOD, PHYLOGENETIC INFERENCE, NUCLEOTIDE-SEQUENCES, RELIABILITY, ALGORITHM, RATES, GENES, TREES

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation