276 search results - page 27 / 56 » The Complexity of Computing Maximal Word Functions |
277
click to vote
CIBCB
2007
IEEE
15 years 7 months ago
2007
IEEE
—In metabolic engineering it is difficult to identify which set of genetic manipulations will result in a microbial strain that achieves a desired production goal, due to the co...
162
click to vote
ICALP
2007
Springer
16 years 22 hour ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
147
click to vote
ECCC
2006
15 years 5 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
142
click to vote
APPINF
2003
15 years 7 months ago
2003
This paper describes eight requirement indicators derived from a mobile work characterisation framework (MWCF). The MWCF is a framework for analysing mobile scenarios (mobile task...
259
click to vote
ICDE
2009
IEEE
16 years 7 months ago
2009
IEEE
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...