Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Gramm, Jens"'
We show that Closest Substring, one of the most important problems in the field of biological sequence analysis, is W[1]-hard when parameterized by the number k of input strings (and remains so, even over a binary alphabet). This problem is therefore
Externí odkaz:
http://arxiv.org/abs/cs/0205056
Publikováno v:
In Discrete Mathematics 2009 309(18):5610-5617
Autor:
Gramm, Jens, Guo, Jiong, Hüffner, Falk, Niedermeier, Rolf, Piepho, Hans-Peter, Schmid, Ramona
Publikováno v:
In Computational Statistics and Data Analysis 2007 52(2):725-736
Publikováno v:
In Discrete Applied Mathematics 2007 155(6):788-805
Publikováno v:
In Journal of Computer and System Sciences 2006 72(8):1386-1396
Publikováno v:
In Theoretical Computer Science 2004 312(2):337-358
Publikováno v:
In Discrete Applied Mathematics 2003 130(2):139-155
Autor:
Gramm, Jens *, Niedermeier, Rolf
Publikováno v:
In Journal of Computer and System Sciences 2003 67(4):723-741
Publikováno v:
In Discrete Mathematics 2001 229(1):3-27