An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery.
Paul HortonWataru FujibuchiPublished in: CPM (2005)
Keyphrases
- upper bound
- motif discovery
- worst case
- dna sequences
- lower bound
- recurring patterns
- motif finding
- biological sequences
- pattern discovery
- data mining tasks
- binding sites
- multiobjective optimization
- computational biology
- computational complexity
- sample size
- branch and bound algorithm
- preprocessing
- databases
- data mining algorithms
- similarity search
- high dimensional
- objective function
- genetic algorithm
- machine learning