FlipCut Supertrees: Große und akkurate Phylogenien schneller bestimmen

FlipCut Supertrees：更快地确定大型且准确的系统发育

• 批准号: 211926079
• 负责人: Professor Dr. Sebastian Böcker
• 金额: --
• 依托单位: Institut für Informatik
• 依托单位国家: 德国
• 项目类别: Research Grants
• 财政年份: 2012
• 资助国家: 德国
• 起止时间: 2011-12-31 至 2015-12-31
• 项目状态: 已结题
• 来源: https://gepris.dfg.de/gepris/projekt/211926079?language=en
• 关键词: FlipCut; Supertrees; Gro; und; akkurate

Supertree approaches combine input trees with overlapping taxa sets into one large and more comprehensive tree. Here, the problem is dealing with incompatible data in a reasonable way. Supertree methods can be used as part of a divide-and-conquer approach for phylogenetic tree inference: (1) we compute, say, maximum likelihood (ML) trees for several subsets of taxa; (2) we merge the resulting trees into one supertree; (3) finally, we use this supertree as a seed for an ML analysis on the complete set of taxa. Current supertree methods suffer from being too slow or too inaccurate when analyzing large datasets. We have recently developed a novel supertree called FLIPCUT supertrees, which is very swift and computes supertrees of good quality. In this project, we will further advance this methods so that supertree quality is on a par with the current supertree “gold standard” Matrix Representation with Parsimony (MRP). At the same time, we want to preserve the extraordinary swiftness of the method. We will then integrate the resulting method into a divide-and-conquer approach for phylogenetic reconstruction, and evaluate it against “pure” ML programs.

超树方法将联合收割机输入树与重叠分类群集合组合成一个大的且更全面的树。这里，问题是以合理的方式处理不兼容的数据。超树方法可以用作系统发育树推断的分而治之方法的一部分：（1）我们计算，比如说，几个分类单元子集的最大似然（ML）树;（2）我们将得到的树合并成一个超树;（3）最后，我们使用这个超树作为种子，对完整的分类单元进行ML分析。当前的超树方法在分析大型数据集时太慢或太不准确。我们最近开发了一种称为FLIPCUT超树的新型超树，它非常迅速，计算质量很好的超树。在这个项目中，我们将进一步推进这种方法，使超树质量与当前的超树“黄金标准”简约矩阵表示（MRP）相当。与此同时，我们希望保持这种方法的非凡的灵活性。然后，我们将把得到的方法集成到一个分而治之的方法中，用于系统发育重建，并对“纯”ML程序进行评估。