...
首页> 外文期刊>BMC Genomics >Efficient algorithms for reconciling gene trees and species networks via duplication and loss events
【24h】

Efficient algorithms for reconciling gene trees and species networks via duplication and loss events

机译:通过复制和丢失事件协调基因树和物种网络的高效算法

获取原文
   

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

       

摘要

Reconciliation methods explain topology differences between a species tree and a gene tree by evolutionary events other than speciations. However, not all phylogenies are trees: hybridization can occur and create new species and this results into reticulate phylogenies. Here, we consider the problem of reconciling a gene tree with a species network via duplication and loss events. Two variants are proposed and solved with effcient algorithms: the first one finds the best tree in the network with which to reconcile the gene tree, and the second one finds the best reconciliation between the gene tree and the whole network.
机译:和解方法通过物种形成以外的进化事件解释物种树和基因树之间的拓扑差异。但是,并非所有的系统发育都是树:杂交可以发生并产生新的物种,从而导致网状系统发育。在这里,我们考虑了通过重复和丢失事件使基因树与物种网络相协调的问题。提出了两种变体并使用有效的算法对其进行了求解:第一个变体在网络中找到与树协调的最佳树,第二个变体在基因树与整个网络之间找到了最佳的协调。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号