A Practical Algorithm for Recovering the Best Supported Edges of an Evolutionary Tree (Extended Abstract) (2000)
Cached
Download Links
- [www.cs.ucsb.edu]
- [www.math.uwaterloo.ca]
- DBLP
Other Repositories/Bibliography
| Citations: | 41 - 6 self |
BibTeX
@INPROCEEDINGS{Berry00apractical,
author = {Vincent Berry and David Bryant and Tao Jiang and Paul Kearney and Ming Li and Todd Wareham and Haoyong Zhang},
title = {A Practical Algorithm for Recovering the Best Supported Edges of an Evolutionary Tree (Extended Abstract)},
booktitle = {},
year = {2000},
pages = {287--296},
publisher = {Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
) 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. In particular, a new technique, called hypercleaning, is presented that can be combined with various tree-building algorithms to efficiently reconstruct from sequence data the best supported edges of the evolutionary tree. More precisely, the hypercleaning technique computes from sequence data a small subset of edges that is likely to contain most edges of the correct 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 de S...
