1158 search results - page 16 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
SIAMCOMP
2008
13 years 10 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
ISMB
2007
14 years 1 months ago
2007
Autopolyploidization and allopolyploidization events multiply the number of chromosomes and genomic content. Genome rearrangement phylogenetics requires that all genomes analyzed ...
SODA
2008
ACM
14 years 8 days ago
2008
ACM
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
COMBINATORICA
2010
13 years 5 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
RECOMB
2006
Springer
14 years 11 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...