## Disk-covering, a fast-converging method for phylogenetic tree reconstruction (1999)

Venue: | JOURNAL OF COMPUTATIONAL BIOLOGY |

Citations: | 78 - 6 self |

### BibTeX

@ARTICLE{Huson99disk-covering,a,

author = {Daniel H. Huson and Scott M. Nettles and Tandy J. Warnow},

title = {Disk-covering, a fast-converging method for phylogenetic tree reconstruction},

journal = {JOURNAL OF COMPUTATIONAL BIOLOGY},

year = {1999},

volume = {6},

number = {3},

pages = {369--386}

}

### Years of Citing Articles

### OpenURL

### Abstract

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