1158 search results - page 32 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
146
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
119
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
Consider a rational matrix, particularly one whose entries have large numerators and denominators, but which is presented as a product of very sparse matrices with relatively smal...
140
click to vote
DAM
2010
15 years 4 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
176
click to vote
ALGORITHMICA
2011
14 years 11 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
108
click to vote
JGAA
2006
15 years 4 months ago
2006
Two-dimensional phase unwrapping is the problem of deducing unambiguous "phase" from values known only modulo 2. Many authors agree that the objective of phase unwrappin...