...
首页> 外文期刊>Journal of computational biology: A journal of computational molecular cell biology >A Bayesian Model for Detecting Past Recombination Events in DNA Multiple Alignments
【24h】

A Bayesian Model for Detecting Past Recombination Events in DNA Multiple Alignments

机译:用于检测DNA多重比对中过去重组事件的贝叶斯模型

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Most phylogenetic tree estimation methods assume that there is a single set of hierarchical relationships among sequences in a data set for all sites along an alignment. Mosaic sequences produced by past recombination events will violate this assumption and may lead to misleading results from a phylogenetic analysis due to the imposition of a single tree along the entire alignment. Therefore, the detection of past recombination is an important first step in an analysis. A Bayesian model for the changes in topology caused by recombination events is described here. This model relaxes the assumption of one topology for all sites in an alignment and uses the theory of Hidden Markov models to facilitate calculations, the hidden states being the underlying topologies at each site in the data set. Changes in topology along the multiple sequence alignment are estimated by means of the maximum a posteriori (MAP) estimate. The performance of the MAP estimate is assessed by application of the model to data sets of four sequences, both simulated and real.
机译:大多数系统树估计方法都假定数据集中序列中所有位点沿序列的序列之间只有一组层次关系。过去重组事件产生的马赛克序列将违反此假设,并且由于沿整个比对设置单个树,因此可能导致系统发育分析结果产生误导。因此,检测过去的重组是分析中重要的第一步。这里描述了由重组事件引起的拓扑变化的贝叶斯模型。该模型放宽了路线中所有站点的一个拓扑的假设,并使用隐马尔可夫模型的理论来简化计算,隐藏状态是数据集中每个站点的基础拓扑。借助最大后验(MAP)估计来估计沿着多序列比对的拓扑变化。通过将模型应用于模拟和真实四个序列的数据集来评估MAP估计的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号