3 search results - page 1 / 1 » On The Parameterized Intractability Of Motif Search Problems |
COMBINATORICA
2006
13 years 5 months ago
2006
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
ACSC
2005
IEEE
13 years 10 months ago
2005
IEEE
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
GECCO
2007
Springer
13 years 8 months ago
2007
Springer
Identification of Transcription Factor Binding Site (TFBS) motifs in multiple DNA upstream sequences is important in understanding the mechanism of gene regulation. This identific...