1158 search results - page 11 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
BIBE
2006
IEEE
14 years 1 months ago
2006
IEEE
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...
TCBB
2008
13 years 7 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
ISBRA
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Many of the steps in phylogenetic reconstruction can be confounded by “rogue” taxa, taxa that cannot be placed with assurance anywhere within the tree—whose locatio...
WG
2005
Springer
14 years 27 days ago
2005
Springer
In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...