首页> 外文会议>Annual International Conference on Computing and Combinatorics(COCOON 2007); 20070716-19; Banff(CA) >A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method
【24h】

A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method

机译:重建系统发育树的新四方方法:四方连接方法

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

摘要

In this paper we introduce a new quartet-based method for phylogenetic inference. This method concentrates on reconstructing reliable phylogenetic trees while tolerating as many quartet errors as possible. This is achieved by carefully selecting two possible neighbor leaves to merge and assigning weights intelligently to the quartets that contain newly merged leaves. Theoretically we prove that this method will always reconstruct the correct tree when a completely consistent quartet set is given. Intensive computer simulations show that our approach outperforms widely used quartet-based program TREE-PUZZLE in most of cases. Under the circumstance of low quartet accuracy, our method still can outperform distance-based method such as Neighbor-joining. Experiments on the real data set also shows the potential of this method. We also propose a simple technique to improve the quality of quartet set. Using this technique we can improve the results of our method.
机译:在本文中,我们介绍了一种新的基于四重奏的系统发育推断方法。这种方法着重于重建可靠的系统发育树,同时尽可能地容忍四方错误。这是通过仔细选择两个可能的相邻叶子合并并为包含新合并叶子的四重奏智能分配权重来实现的。从理论上讲,我们证明当给出完全一致的四重奏集时,该方法将始终重建正确的树。密集的计算机仿真表明,在大多数情况下,我们的方法要优于广泛使用的基于四重程序的TREE-PUZZLE。在四重奏精度较低的情况下,我们的方法仍然可以胜过基于距离的方法,例如邻域连接。在真实数据集上的实验也显示了这种方法的潜力。我们还提出了一种简单的技术来提高四重奏组的质量。使用这种技术,我们可以改善我们方法的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号