### Abstract

Inferring evolutionary trees is an interesting and important problem in biology, but one that is computationally difficult as most associated optimization problems are NP-hard. Although many methods are provably statistically consistent (i.e. the probability of recovering the correct tree converges to 1 as the sequence length increases), the actual rate of convergence for different methods has not been well understood. In a recent paper we introduced a new method for reconstructing evolutionary trees called the dyadic closure method (DCM), and we showed that DCM has a very fast convergence rate. DCM runs in O(n^{5}log n) time, where n is the number of sequences, and so, although polynomial, the computational requirements are potentially too large to be of use in practice. In this paper we present another tree reconstruction method, the witness-antiwitness method (WAM). WAM is faster than DCM, especially on random trees, and converges to the true tree topology at the same rate as DCM. We also compare WAM to other methods used to reconstruct trees, including Neighbor Joining (possibly the most popular method among molecular biologists), and new methods introduced in the computer science literature.

Original language | English (US) |
---|---|

Pages (from-to) | 77-118 |

Number of pages | 42 |

Journal | Theoretical Computer Science |

Volume | 221 |

Issue number | 1-2 |

DOIs | |

State | Published - Jun 28 1999 |

### Keywords

- Distance-based methods
- Dyadic closure method
- Evolutionary tree reconstruction
- Phylogeny
- Quartet methods
- Short quartet methods
- Witness-antiwitness method

### ASJC Scopus subject areas

- Computational Theory and Mathematics

## Fingerprint Dive into the research topics of 'A few logs suffice to build (almost) all trees: Part II'. Together they form a unique fingerprint.

## Cite this

*Theoretical Computer Science*,

*221*(1-2), 77-118. https://doi.org/10.1016/S0304-3975(99)00028-6