Efficient algorithms for reconciling gene trees and species networks via duplication and loss events
Efficient algorithms for reconciling gene trees and species networks via duplication and loss events
复制标题
通过重复和丢失事件协调基因树和物种网络的高效算法
作者：
Thu;Céline Scornavacca
协调方法通过物种形成以外的进化事件来解释物种树和基因树之间的拓扑差异。然而，并非所有系统发育都是树：杂交可以发生并创造新物种，这会导致网状系统发育。在这里，我们考虑通过复制和丢失事件协调基因树与物种网络的问题。提出了两种变体并用有效的算法解决：第一个变体找到网络中与基因树协调的最佳树，第二个变体找到基因树和整个网络之间的最佳协调。
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.