A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract)
Vincent Berry, David Bryant, Tao Jiang, Paul Kearney, Ming Li, Todd Wareham, Haoyong Zhang · 2000
) Vincent Berry David Bryant y Tao Jiang z Paul Kearney x Ming Li -- Todd Wareham k Haoyong Zhang Abstract It is now routine for biologists to conduct evolutionary analyses of large DNA and protein sequence datasets. A computational bottleneck in these analyses is the recovery of the topology of the evolutionary tree for a set of sequences. This paper presents a practical solution to this challenging problem. More specifically, an algorithm called hypercleaning is presented that efficiently reconstructs from the sequence data the best supported edges of the evolutionary tree. This algorithm is a substantial improvement over previous algorithms in its ability to recover edges of the evolutionary tree. Hypercleaning also incorporates a detailed error model that relates errors in Address: D'epartement d'Informatique Fondamentale et Applications, LIRMM, Universit'e de Montpellier II, France. Part of this work was done at the D'epartement de Math'ematiques,EURISE, Universit'e ...