Sciweavers

COMBINATORICA
2006

On The Parameterized Intractability Of Motif Search Problems

13 years 4 months ago
On The Parameterized Intractability Of Motif Search Problems
ended abstract of this paper was presented at the 19th International Symposium on Theoretical Aspects of Computer Science (STACS 2002), Springer-Verlag, LNCS 2285, pages 262
Michael R. Fellows, Jens Gramm, Rolf Niedermeier
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where COMBINATORICA
Authors Michael R. Fellows, Jens Gramm, Rolf Niedermeier
Comments (0)