De Bruijn Superwalk with Multiplicities Problem is NP-hard.
Evgeny KapunFedor TsarevPublished in: BMC Bioinform. (2013)
Keyphrases
- np hard
- approximation algorithms
- optimal solution
- np hardness
- special case
- scheduling problem
- np complete
- closely related
- lower bound
- worst case
- graph structure
- integer programming
- minimum cost
- linear programming
- greedy heuristic
- constraint satisfaction problems
- decision problems
- computational complexity
- approximation ratio
- remains np hard
- maximum weight
- branch and bound algorithm
- databases
- knapsack problem
- motif discovery
- search space
- machine learning
- computationally hard
- computationally challenging
- data sets