On The Parameterized Intractability Of Motif Search Problems.
Michael R. FellowsJens GrammRolf NiedermeierPublished in: Comb. (2006)
Keyphrases
- search problems
- orders of magnitude
- search algorithm
- heuristic search
- efficient search
- search strategies
- state space search
- np complete
- solving hard
- beam search
- parallel processors
- search space
- heuristic search algorithms
- dna sequences
- constraint satisfaction problems
- combinatorial search
- iterative deepening
- planning problems
- systematic search algorithms
- binding sites
- constraint satisfaction
- domain independent
- co occurrence