Can I read Inferring Evolutionary Trees with Strong Combinatorial Evidence on EtoBox?

Inferring Evolutionary Trees with Strong Combinatorial Evidence by Vincent Berry; Olivier Gascuel is a Computer Science article available to read on EtoBox.

What is Inferring Evolutionary Trees with Strong Combinatorial Evidence about?

We consider the problem of inferring the evolutionary tree of a set of n species. We propose a quartet reconstruction method which speciÿcally produces trees whose edges have strong combinatorial evidence. Let Q be a set of resolved quartets deÿned on the studied species, the method computes the unique maximum subset Q \* of Q which is equivalent to a tree and outputs the corresponding tree as an estimate of the species' phylogeny. We use a characterization of the subset Q \* due to Bandelt and Dress (Adv. Appl. Math. 7 (1986) to provide an O(n 4 ) incremental algorithm for this variant of the NP-hard quartet consistency problem. Moreover, when chosing the resolution of the quartets by the four-point method (FPM) and considering the Cavender-Farris model of evolution, we show that the convergence rate of the Q \* method is at worst polynomial when the maximum evolutive distance between two species is bounded. We complete these theoretical results by an experimental study on real and simulated data sets. The results show that (i) as expected, the strong combinatorial constraints it imposes on each edge leads the Q \* method to propose very few incorrect edges; (ii) more surprisingly

Who reads Inferring Evolutionary Trees with Strong Combinatorial Evidence?

Author

Vincent Berry; Olivier Gascuel

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0304-3975)

Published

2000

Language

EN

Field

Computer Science (Physical Sciences)