Disk-covering, a fast-converging method for phylogenetic tree reconstruction.

摘要: The evolutionary history of a set species is represented by phylogenetic tree, which rooted, leaf-labeled where internal nodes represent ancestral and the leaves modern day species. Accurate (or even boundedly inaccurate) topology reconstructions large divergent trees from realistic length sequences have long been considered one major challenges in systematic biology. In this paper, we present simple method, Disk-Covering Method (DCM), boosts performance base methods under various Markov models evolution. We analyze DCM-boosted distance Jukes-Cantor model biomolecular sequence evolution, prove that for almost all trees, polylogarithmic suffice complete accuracy with high probability, while polynomial always suffice. also provide an experimental study based upon simulating evolution on trees. This confirms substan...