Sciweavers

25 search results - page 1 / 5
» Maximum Likelihood of Evolutionary Trees Is Hard
Sort
View
RECOMB
2005
Springer
14 years 11 months ago
Maximum Likelihood of Evolutionary Trees Is Hard
Benny Chor, Tamir Tuller
JACM
2006
99views more  JACM 2006»
13 years 10 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
JCB
2006
107views more  JCB 2006»
13 years 10 months ago
Maximum Likelihood Molecular Clock Comb: Analytic Solutions
Maximum likelihood (ML) is increasingly used as an optimality criterion for selecting evolutionary trees, but finding the global optimum is a hard computational task. Because no g...
Benny Chor, Amit Khetan, Sagi Snir
TCBB
2010
166views more  TCBB 2010»
13 years 9 months ago
Approximate Maximum Parsimony and Ancestral Maximum Likelihood
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...
Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport
BMCBI
2008
139views more  BMCBI 2008»
13 years 11 months 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