1158 search results - page 1 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
CPM
1997
Springer
13 years 9 months ago
1997
Springer
DAM
2007
13 years 5 months ago
2007
It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulat...
ISAAC
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
TCBB
2010
13 years 3 months ago
2010
— 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...
ICCS
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...