Sciweavers

Share
SODA
2008
ACM

Fast and reliable reconstruction of phylogenetic trees with very short edges

8 years 11 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. A central goal in phylogenetic reconstruction is to be able to reconstruct the tree as accurately as possible from as short as possible input sequences. The sequence length required for correct topological reconstruction depends on certain properties of the tree, such as its depth and minimal edge-weight. Fast converging reconstruction algorithms are considered state-of the-art in this sense, as they require asymptotically minimal sequence length in order to guarantee (with high probability) correct topological reconstruction of the entire tree. However, when the original phylogenetic tree contains very short edges, this minimal sequence-length is still too long for practical purposes. Short edges are not only very hard to reconstruct; their presence may also prevent the correct reconstruction of long edges. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2008
Where SODA
Authors Ilan Gronau, Shlomo Moran, Sagi Snir
Comments (0)
books