Sciweavers

29 search results - page 2 / 6
» Finding a maximum likelihood tree is hard
Sort
View
BIBE
2006
IEEE
135views Bioinformatics» more  BIBE 2006»
13 years 10 months ago
Evidence of Multiple Maximum Likelihood Points for a Phylogenetic Tree
An interesting and important, but largely ignored question associated with the ML method is whether there exists only a single maximum likelihood point for a given phylogenetic tr...
Bing Bing Zhou, Monther Tarawneh, Pinghao Wang, Da...
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 4 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
BMCBI
2008
139views more  BMCBI 2008»
13 years 4 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
IJCBDD
2008
113views more  IJCBDD 2008»
13 years 4 months ago
Parsimony accelerated Maximum Likelihood searches
: Phylogenetic search is a key tool used in a variety of biological research endeavors. However, this search problem is known to be computationally difficult, due to the astronomic...
Kenneth Sundberg, Timothy O'Connor, Hyrum Carroll,...
BMCBI
2005
134views more  BMCBI 2005»
13 years 4 months ago
Ancestral sequence alignment under optimal conditions
Background: Multiple genome alignment is an important problem in bioinformatics. An important subproblem used by many multiple alignment approaches is that of aligning two multipl...
Alexander K. Hudek, Daniel G. Brown 0001