Sciweavers

330 search results - page 54 / 66
» Phylogenetic trees in ACL2
Sort
View
JACM
2006
99views more  JACM 2006»
14 years 11 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
STACS
2007
Springer
15 years 6 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom
COCOON
2008
Springer
15 years 1 months ago
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete
The problem of determining haplotypes from genotypes has gained considerable prominence in the research community since the beginning of the HapMap project. Here the focus is on de...
Arvind Gupta, Ján Manuch, Ladislav Stacho, ...
BMCBI
2007
165views more  BMCBI 2007»
14 years 12 months ago
Direct maximum parsimony phylogeny reconstruction from genotype data
Background: Maximum parsimony phylogenetic tree reconstruction from genetic variation data is a fundamental problem in computational genetics with many practical applications in p...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
ICPADS
2005
IEEE
15 years 5 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...