Sciweavers

29 search results - page 3 / 6
» Finding a maximum likelihood tree is hard
Sort
View
CCECE
2006
IEEE
13 years 11 months ago
Dynamic and Parallel Approaches to Optimal Evolutionary Tree Construction
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...
Anupam Bhattacharjee, Kazi Zakia Sultana, Zalia Sh...
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
13 years 6 months ago
On contract-and-refine transformations between phylogenetic trees
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy ...
CSB
2004
IEEE
109views Bioinformatics» more  CSB 2004»
13 years 9 months ago
Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
Usman Roshan, Bernard M. E. Moret, Tandy Warnow, T...
DAM
2008
135views more  DAM 2008»
13 years 5 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski
ICPADS
2005
IEEE
13 years 10 months ago
PRec-I-DCM3: A Parallel Framework for Fast and Accurate Large Scale Phylogeny Reconstruction
: Accurate reconstruction of phylogenetic trees very often involves solving hard optimization problems, particularly the maximum parsimony (MP) and maximum likelihood (ML) problems...
Cristian Coarfa, Yuri Dotsenko, John M. Mellor-Cru...