Detection of recombination in DNA multiple alignments with hidden Markov models.
Conventional phylogenetic tree estimation methods assume that all sites in a DNA multiple alignment have the same evolutionary history. This assumption is violated in data sets from certain bacteria and viruses due to recombination, a process that leads to the creation of mosaic sequences from different strains and, if undetected, causes systematic errors in phylogenetic tree estimation. In the current work, a hidden Markov model (HMM) is employed to detect recombination events in multiple alignments of DNA sequences. The emission probabilities in a given state are determined by the branching order (topology) and the branch lengths of the respective phylogenetic tree, while the transition probabilities depend on the global recombination probability. The present study improves on an earlier heuristic parameter optimization scheme and shows how the branch lengths and the recombination probability can be optimized in a maximum likelihood sense by applying the expectation maximization (EM) algorithm. The novel algorithm is tested on a synthetic benchmark problem and is found to clearly outperform the earlier heuristic approach. The paper concludes with an application of this scheme to a DNA sequence alignment of the argF gene from four Neisseria strains, where a likely recombination event is clearly detected.
Husmeier
D
D
Biomathematics and Statistics Scotland, SCRI, Invergowrie, Dundee, United Kingdom. dirk@bioss.sari.ac.uk
Wright
F
F
D000465:Algorithms; D019295:Computational Biology; D004247:DNA / Q000235:genetics*; D004269:DNA, Bacterial / Q000235:genetics; D005798:Genes, Bacterial; D014644:Genetic Variation; D016013:Likelihood Functions; D008390:Markov Chains; D008957:Models, Genetic; D009343:Neisseria / Q000235:genetics; D010802:Phylogeny; D011995:Recombination, Genetic; D016415:Sequence Alignment / Q000706:statistics & numerical data*
D004269:DNA, Bacterial; D004247:DNA