Diploid Alignment is NP-hard.
Romeo RizziMassimo CairoVeli MäkinenDaniel ValenzuelaPublished in: CoRR (2016)
Keyphrases
- np hard
- scheduling problem
- optimal solution
- special case
- approximation algorithms
- np hardness
- np complete
- integer programming
- computational complexity
- image alignment
- lower bound
- branch and bound algorithm
- closely related
- linear programming
- greedy heuristic
- constraint satisfaction problems
- word alignment
- worst case
- search algorithm
- genetic algorithm
- minimum cost
- set cover
- principal axes
- database
- knapsack problem
- decision problems
- neural network
- real time