Fast recovery of evolutionary trees with thousands of nodes

We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working space. In the general Markov model of evolution, the algorithm recovers the topology successfully with (1 o(1)) probability from sequences with polynomial length in n. Moreover, for almost all trees, our algorithm achieves the same success probability on polylogarithmic sample sizes. The theoretical results are supported by simulation experiments involving trees with 500, 1895, and 3135 leaves. The topologies of the trees are recovered with high success from 2000 bp DNA sequences.

• Type: Conference
• Year: 2001
• Where: RECOMB
• Authors: Miklós Csürös
• Keywords: Computational Biology, Evolutionary Tree Reconstruction, General Markov Model, Polylogarithmic Sample Sizes, RECOMB 2001