7 search results - page 1 / 2 » Fixed-Parameter Tractability of the Maximum Agreement Supert... |
CPM
2007
Springer
13 years 11 months ago
2007
Springer
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
ESA
2009
Springer
14 years 1 days ago
2009
Springer
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
FSTTCS
2010
Springer
13 years 3 months ago
2010
Springer
We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism which has running time 2O(b) NO(1) , where the parameter b is the maximum size of the col...
IWPEC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Haplotyping via perfect phylogeny is a method for retrieving haplotypes from genotypes. Fast algorithms are known for computing perfect phylogenies from complete and erro...