293 search results - page 3 / 59 » Fixed-Parameter Algorithms in Phylogenetics |
SWAT
2010
Springer
14 years 13 days ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
WG
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a give...
KR
2010
Springer
14 years 5 days ago
2010
Springer
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have be...
GD
2003
Springer
14 years 18 days ago
2003
Springer
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
IWPEC
2009
Springer
14 years 1 months ago
2009
Springer