An upper bound on the hardness of exact matrix based motif discovery.
Paul HortonWataru FujibuchiPublished in: J. Discrete Algorithms (2007)
Keyphrases
- upper bound
- motif discovery
- worst case
- recurring patterns
- lower bound
- dna sequences
- motif finding
- binding sites
- data mining tasks
- biological sequences
- pattern discovery
- multiobjective optimization
- data mining algorithms
- computational biology
- branch and bound algorithm
- sample size
- np hard
- computational complexity
- sequence data
- data streams
- genetic algorithm
- swarm intelligence
- similarity search