...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE/ACM transactions on computational biology and bioinformatics >Fast Construction of Near Parsimonious Hybridization Networks for Multiple Phylogenetic Trees
【24h】

Fast Construction of Near Parsimonious Hybridization Networks for Multiple Phylogenetic Trees

机译：多系统进化树的近简约杂交网络的快速构建

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Hybridization networks represent plausible evolutionary histories of species that are affected by reticulate evolutionary processes. An established computational problem on hybridization networks is constructing the most parsimonious hybridization network such that each of the given phylogenetic trees (called gene trees) is “displayed” in the network. There have been several previous approaches, including an exact method and several heuristics, for this NP-hard problem. However, the exact method is only applicable to a limited range of data, and heuristic methods can be less accurate and also slow sometimes. In this paper, we develop a new algorithm for constructing near parsimonious networks for multiple binary gene trees. This method is more efficient for large numbers of gene trees than previous heuristics. This new method also produces more parsimonious results on many simulated datasets as well as a real biological dataset than a previous method. We also show that our method produces topologically more accurate networks for many datasets.
机译：杂交网络代表了受网状进化过程影响的物种可能的进化历史。杂交网络上的一个已建立的计算问题是构建最简约的杂交网络，以使每个给定的系统发育树（称为基因树）“显示”在网络中。对于此NP难题，以前有几种方法，包括精确方法和启发式方法。但是，精确方法仅适用于有限范围的数据，启发式方法的准确性可能较低，有时还会很慢。在本文中，我们开发了一种用于为多个二叉基因树构建近简约网络的新算法。该方法对于大量基因树比以前的启发式方法更有效。与以前的方法相比，该新方法还可以在许多模拟数据集和真实生物学数据集上产生更简约的结果。我们还表明，我们的方法为许多数据集生成了拓扑更精确的网络。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号