Department of Statistics, University of California-Berkeley, Berkeley, CA 94720-3860, USA.
IEEE/ACM Trans Comput Biol Bioinform. 2010 Jan-Mar;7(1):166-71. doi: 10.1109/TCBB.2008.66.
We introduce a simple computationally efficient algorithm for reconstructing phylogenies from multiple gene trees in the presence of incomplete lineage sorting, that is, when the topology of the gene trees may differ from that of the species tree. We show that our technique is statistically consistent under standard stochastic assumptions, that is, it returns the correct tree given sufficiently many unlinked loci. We also show that it can tolerate moderate estimation errors.
我们介绍了一种简单的、计算效率高的算法,用于在不完全谱系分选(即基因树的拓扑结构可能与物种树不同)的情况下,从多个基因树重建系统发育关系。我们表明,在标准随机假设下,我们的技术具有统计一致性,也就是说,在足够多的非连锁基因座的情况下,它会返回正确的树。我们还表明,它可以容忍适度的估计误差。