1158 search results - page 8 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
ALENEX
2009
13 years 8 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
AI
2007
Springer
13 years 7 months ago
2007
Springer
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
SC
1995
ACM
13 years 11 months ago
1995
ACM
The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. We present a parallelization of the character c...
APPROX
2000
Springer
13 years 11 months ago
2000
Springer
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...