Supplementary material for: Building alternative consensus trees and supertrees using k-means and Robinson and Foulds distance
收藏DataONE2021-03-28 更新2025-05-31 收录
下载链接:
https://search.dataone.org/view/sha256:b3882d7f103fd26fc74db01395d2022f1caab91e026df9b59feac69d20223021
下载链接
链接失效反馈官方服务:
资源简介:
Each gene has its own evolutionary history which can substantially differ from the evolutionary histories of other genes. For example, some individual genes or operons can be affected by specific horizontal gene transfer and recombination events. Thus, the evolutionary history of each gene should be represented by its own phylogenetic tree which may display different evolutionary patterns from the species tree that accounts for the main patterns of vertical descent. The output of traditional consensus tree or supertree inference methods is a unique consensus tree or supertree. Here, we describe a new efficient method for inferring multiple alternative consensus trees and supertrees to best represent the most important evolutionary patterns of a given set of phylogenetic trees (i.e. additive trees or X-trees). We show how a specific version of the popular k-means clustering algorithm, based on some interesting properties of the Robinson and Foulds topological distance, can be used to par...
创建时间:
2025-05-08



