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

Molecular Biology and Evolution

Volumn 20, Issue 3, 2003, Pages 315-337

  Husmeier, Dirk ^a   McGuire, Gráinne ^b  

^a JCMB   (United Kingdom)

^b UNIVERSITY OF READING   (United Kingdom)

Author keywords

DNA sequence alignment; Hidden Markov models; Markov chain Monte Carlo; Phylogeny; Recombination

Indexed keywords

ARTICLE; BAYES THEOREM; CONTROLLED STUDY; DNA DETERMINATION; DNA RECOMBINATION; DNA SEQUENCE; INTERMETHOD COMPARISON; MONTE CARLO METHOD; NONHUMAN; NUCLEOTIDE SEQUENCE; PHYLOGENETIC TREE; PROBABILITY; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS; SPECIES DIFFERENCE; STATISTICAL ANALYSIS; STATISTICAL MODEL; TAXONOMIC IDENTIFICATION;

BASE SEQUENCE; BAYES THEOREM; DNA; LIKELIHOOD FUNCTIONS; MARKOV CHAINS; MODELS, GENETIC; MONTE CARLO METHOD; PHYLOGENY; RECOMBINATION, GENETIC; REPRODUCIBILITY OF RESULTS;

EID: 0037358827     PISSN: 07374038     EISSN: None     Source Type: Journal    
DOI: 10.1093/molbev/msg039     Document Type: Article

References (31)

1. Bollyky, P. L., A. Rambaut, P. H. Harvey, and E. C. Holmes. 1996. Recombination between sequences of hepatitis B virus from different genotypes, J. Mol. Evol. 42:97-102.
2. Casella, G., and E. I. George. 1992. Explaining the Gibbs sampler. Am. Statist. 46:167-174.
3. Chib, S., and E. Greenberg. 1995. Understanding the Metropolis-Hastings Algorithm. Am. Statist. 49:327-335.
4. Dempster, A. P., N. M. Laird, and D. B. Rubin. 1977. Maximum likelihood from incomplete data via the EM algorithm. J. R. Statist. Soc. B39:1-38.
5. Felsenstein, J. 1981. Evolution trees from DNA sequences: a maximum likelihood approach. J. Mol. Evol. 17:368-376.
6. -. 1988. Phylogenies from molecular sequences: inference and reliability, Annu. Rev. Genet. 22:521-565.
7. Felsenstein, J., and G. A. Churchill. 1996. A hidden Markov model approach to variation among sites in rate of evolution. Mol. Biol. Evol. 13:93-104.
8. Ghahramani, Z., and M. I. Jordan. 1997. Factorial hidden Markov models, Machine Learn. 29:245-273.
9. Grassly, N. C., and E. C. Holmes. 1997. A likelihood method for the detection of selection and recombination using nucleotide sequences. Mol. Biol. Evol. 14:239-247.
10. Hastings, W. K. 1970. Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57:97-109.
11. Heckermann, D. 1999. A tutorial on learning with Bayesian networks. Pp. 301-354 in M. I. Jordan, ed. Learning in Graphical Models, Adaptive computation and machine learning. MIT Press, Cambridge, Massas.
12. Hein, J. 1993. A heuristic method to reconstruct the history of sequences subject to recombination. J. Mol. Evol. 36:396-405.
13. Husmeier, D., and F. Wright. 2001. Detection of recombination in DNA multiple alignments with hidden Markov models. J. Comput. Biol. 8:401-427.
14. Kimura, M. 1980. A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences. J. Mol. Evol. 16:111-120.
15. Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi. 1983. Optimization by simulated annealing. Science 220:671-680.
16. Larget, B., and D. L. Simon. 1999. Markov chain Monte Carlo algorithms for the Bayesian analysis of phylogenetic trees. Mol. Biol. Evol. 16:750-759.
17. Mau, B., M. A. Newton, and B. Larget. 1999. Bayesian phylogenetic inference via Markov chain Monte Carlo methods. Biometrics 55:1-12.
18. Maynard Smith, J. 1992. Analyzing the mosaic structure of genes. J. Mol. Evol. 34:126-129.
19. McGuire, G., and F. Wright. 2000. TOPAL 2.0: improved detection of mosaic sequences within multiple alignments. Bioinformatics 16:130-134.
20. McGuire, G., F. Wright, and M. J. Prentice. 1997. A graphical method for detecting recombination in phylogenetic data sets. Mol. Biol. Evol. 14:1125-1131.
21. -. 2000. A Bayesian method for detecting recombination in DNA multiple alignments. J. Comput. Biol. 7:159-170.
22. Moniz de Sa, M., and G. Drouin. 1996. Phylogeny and substitution rates of angiosperm actin genes. Mol. Biol. Evol. 13:1198-1212.
23. Neal, R. M. 1996. Bayesian learning for neural networks, vol. 118, Lecture notes in statistics. Springer-Verlag, New York.
24. Rabiner, L. R. 1989. A tutorial on hidden Markov models and selected applications in speech recognition. Proc. IEEE 77:257-286.
25. Robert, C. P., G. Celeux, and J. Diebolt. 1993. Bayesian estimation of hidden Markov chains: A stochastic implementation. Statist. Prob. Lett. 16:77-83.
26. Rubinstein, R. Y. 1981. Simulation and the Monte Carlo method. John Wiley & Sons, New York.
27. Strimmer, K., and A. von Haeseler. 1996. Quartet puzzling: a quartet maximum likelihood method for reconstructing tree topologies. Mol. Biol. Evol. 13:964-969.
28. Thompson, J. D., D. G. Higgins, and T. J. Gibson. 1994. CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position specific gap penalties and weight matrix choice. Nucleic Acids Res. 22:4673-4680.
29. Wiuf, C., T. Christensen, and J. J. Hein. 2001. A simulation study of the reliability of recombination detection methods. Mol. Biol. Evol. 18:1929-1939.
30. Yang, Z., and B. Rannala. 1997. Bayesian phylogenetic inference using DNA sequences: a Markov chain Monte Carlo method, Mol. Biol. Evol. 14:717-724.
31. Zhou, J., and B. G. Spratt. 1992. Sequence diversity within the argF, fbp and recA genes of natural isolates of Neisseria meningitidis: interspecies recombination within the argF gene, Mol. Microbiol. 6:2135-2146.