Sciweavers

14 search results - page 1 / 3
» On the complexity of distance-based evolutionary tree recons...
Sort
View
107
Voted
BMCBI
2008
139views more  BMCBI 2008»
15 years 11 days ago
A topological transformation in evolutionary tree search methods based on maximum likelihood combining p-ECR and neighbor joinin
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
Maozu Guo, Jian-Fu Li, Yang Liu
73
Voted
SODA
2003
ACM
102views Algorithms» more  SODA 2003»
15 years 1 months ago
On the complexity of distance-based evolutionary tree reconstruction
Valerie King, Li Zhang, Yunhong Zhou
94
Voted
STOC
2006
ACM
129views Algorithms» more  STOC 2006»
16 years 17 days ago
Optimal phylogenetic reconstruction
One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...
Constantinos Daskalakis, Elchanan Mossel, Sé...
81
Voted
BIOINFORMATICS
2002
100views more  BIOINFORMATICS 2002»
15 years 2 days ago
Optimal algorithms for local vertex quartet cleaning
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
Gianluca Della Vedova, Todd Wareham
92
Voted
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 1 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. ...
Ilan Gronau, Shlomo Moran, Sagi Snir